./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread/triangular-longest-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread/triangular-longest-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 874fb84f685baf0441a9bf8db1864605baa10908128545fe3028b9b499246108 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:22:05,334 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:22:05,372 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 16:22:05,375 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:22:05,375 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:22:05,390 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:22:05,390 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:22:05,390 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:22:05,390 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:22:05,391 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:22:05,391 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:22:05,391 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:22:05,391 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:22:05,391 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:22:05,391 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:22:05,391 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:22:05,391 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:22:05,391 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:22:05,392 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:22:05,392 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:22:05,392 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:22:05,392 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:22:05,392 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:22:05,392 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:22:05,392 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:22:05,392 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:22:05,392 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:22:05,392 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:22:05,392 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:22:05,393 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:22:05,393 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:22:05,393 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:22:05,393 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:22:05,393 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:22:05,393 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:22:05,393 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:22:05,393 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:22:05,393 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:22:05,394 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:22:05,394 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:22:05,394 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:22:05,394 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:22:05,394 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:22:05,394 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:22:05,394 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:22:05,394 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:22:05,394 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:22:05,394 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:22:05,394 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 874fb84f685baf0441a9bf8db1864605baa10908128545fe3028b9b499246108 [2025-01-09 16:22:05,602 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:22:05,607 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:22:05,608 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:22:05,609 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:22:05,609 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:22:05,610 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/triangular-longest-2.i [2025-01-09 16:22:06,722 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/06d4a3f5e/e05e0d631c7943e89c2104e3efe4df90/FLAGfe155321b [2025-01-09 16:22:07,111 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:22:07,112 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread/triangular-longest-2.i [2025-01-09 16:22:07,128 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/06d4a3f5e/e05e0d631c7943e89c2104e3efe4df90/FLAGfe155321b [2025-01-09 16:22:07,316 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/06d4a3f5e/e05e0d631c7943e89c2104e3efe4df90 [2025-01-09 16:22:07,318 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:22:07,320 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:22:07,321 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:22:07,321 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:22:07,325 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:22:07,326 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:22:07" (1/1) ... [2025-01-09 16:22:07,327 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fa3d139 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:22:07, skipping insertion in model container [2025-01-09 16:22:07,327 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:22:07" (1/1) ... [2025-01-09 16:22:07,350 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:22:07,608 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread/triangular-longest-2.i[30964,30977] [2025-01-09 16:22:07,611 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:22:07,621 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:22:07,650 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread/triangular-longest-2.i[30964,30977] [2025-01-09 16:22:07,651 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:22:07,672 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:22:07,673 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:22:07 WrapperNode [2025-01-09 16:22:07,673 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:22:07,674 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:22:07,674 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:22:07,675 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:22:07,679 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:22:07" (1/1) ... [2025-01-09 16:22:07,687 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:22:07" (1/1) ... [2025-01-09 16:22:07,697 INFO L138 Inliner]: procedures = 168, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 37 [2025-01-09 16:22:07,697 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:22:07,698 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:22:07,698 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:22:07,698 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:22:07,703 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:22:07" (1/1) ... [2025-01-09 16:22:07,703 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:22:07" (1/1) ... [2025-01-09 16:22:07,704 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:22:07" (1/1) ... [2025-01-09 16:22:07,719 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 16:22:07,719 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:22:07" (1/1) ... [2025-01-09 16:22:07,719 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:22:07" (1/1) ... [2025-01-09 16:22:07,724 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:22:07" (1/1) ... [2025-01-09 16:22:07,724 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:22:07" (1/1) ... [2025-01-09 16:22:07,727 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:22:07" (1/1) ... [2025-01-09 16:22:07,729 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:22:07" (1/1) ... [2025-01-09 16:22:07,729 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:22:07" (1/1) ... [2025-01-09 16:22:07,730 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:22:07,731 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:22:07,731 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:22:07,731 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:22:07,732 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:22:07" (1/1) ... [2025-01-09 16:22:07,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:22:07,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:22:07,775 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 16:22:07,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 16:22:07,798 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-01-09 16:22:07,799 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-01-09 16:22:07,799 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-01-09 16:22:07,799 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-01-09 16:22:07,799 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-09 16:22:07,799 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:22:07,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:22:07,799 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-09 16:22:07,799 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:22:07,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:22:07,800 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 16:22:07,867 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:22:07,868 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:22:07,935 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:22:07,935 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:22:07,984 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:22:07,984 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 16:22:07,985 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:22:07 BoogieIcfgContainer [2025-01-09 16:22:07,985 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:22:07,986 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:22:07,987 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:22:07,990 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:22:07,990 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:22:07" (1/3) ... [2025-01-09 16:22:07,991 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@618db83d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:22:07, skipping insertion in model container [2025-01-09 16:22:07,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:22:07" (2/3) ... [2025-01-09 16:22:07,991 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@618db83d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:22:07, skipping insertion in model container [2025-01-09 16:22:07,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:22:07" (3/3) ... [2025-01-09 16:22:07,992 INFO L128 eAbstractionObserver]: Analyzing ICFG triangular-longest-2.i [2025-01-09 16:22:08,002 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:22:08,003 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG triangular-longest-2.i that has 3 procedures, 22 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-01-09 16:22:08,003 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:22:08,030 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 16:22:08,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 24 transitions, 56 flow [2025-01-09 16:22:08,090 INFO L124 PetriNetUnfolderBase]: 3/22 cut-off events. [2025-01-09 16:22:08,096 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:22:08,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29 conditions, 22 events. 3/22 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 30 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 22. Up to 2 conditions per place. [2025-01-09 16:22:08,099 INFO L82 GeneralOperation]: Start removeDead. Operand has 28 places, 24 transitions, 56 flow [2025-01-09 16:22:08,104 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 26 places, 22 transitions, 50 flow [2025-01-09 16:22:08,115 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:22:08,125 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;@1d9dd755, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:22:08,128 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-01-09 16:22:08,138 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:22:08,141 INFO L124 PetriNetUnfolderBase]: 3/20 cut-off events. [2025-01-09 16:22:08,141 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:22:08,141 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:22:08,142 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:22:08,143 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-01-09 16:22:08,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:22:08,148 INFO L85 PathProgramCache]: Analyzing trace with hash -60315798, now seen corresponding path program 1 times [2025-01-09 16:22:08,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:22:08,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329714965] [2025-01-09 16:22:08,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:22:08,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:22:08,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 16:22:08,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 16:22:08,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:22:08,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:22:08,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:22:08,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:22:08,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329714965] [2025-01-09 16:22:08,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329714965] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:22:08,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:22:08,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:22:08,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234052344] [2025-01-09 16:22:08,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:22:08,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:22:08,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:22:08,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:22:08,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:22:08,564 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-01-09 16:22:08,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 22 transitions, 50 flow. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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-01-09 16:22:08,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:22:08,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-01-09 16:22:08,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:22:08,765 INFO L124 PetriNetUnfolderBase]: 321/539 cut-off events. [2025-01-09 16:22:08,765 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 16:22:08,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1051 conditions, 539 events. 321/539 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2106 event pairs, 62 based on Foata normal form. 12/534 useless extension candidates. Maximal degree in co-relation 1041. Up to 221 conditions per place. [2025-01-09 16:22:08,777 INFO L140 encePairwiseOnDemand]: 16/24 looper letters, 25 selfloop transitions, 4 changer transitions 22/54 dead transitions. [2025-01-09 16:22:08,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 54 transitions, 216 flow [2025-01-09 16:22:08,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:22:08,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:22:08,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2025-01-09 16:22:08,793 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2025-01-09 16:22:08,794 INFO L175 Difference]: Start difference. First operand has 26 places, 22 transitions, 50 flow. Second operand 6 states and 84 transitions. [2025-01-09 16:22:08,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 54 transitions, 216 flow [2025-01-09 16:22:08,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 54 transitions, 214 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 16:22:08,798 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 71 flow [2025-01-09 16:22:08,800 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=71, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2025-01-09 16:22:08,802 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 7 predicate places. [2025-01-09 16:22:08,802 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 71 flow [2025-01-09 16:22:08,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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-01-09 16:22:08,803 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:22:08,803 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:22:08,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:22:08,803 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-01-09 16:22:08,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:22:08,803 INFO L85 PathProgramCache]: Analyzing trace with hash -39912258, now seen corresponding path program 1 times [2025-01-09 16:22:08,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:22:08,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221615521] [2025-01-09 16:22:08,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:22:08,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:22:08,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-09 16:22:08,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 16:22:08,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:22:08,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:22:08,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:22:08,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:22:08,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221615521] [2025-01-09 16:22:08,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221615521] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:22:08,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:22:08,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:22:08,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434538813] [2025-01-09 16:22:08,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:22:08,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:22:08,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:22:08,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:22:08,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:22:08,973 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-01-09 16:22:08,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 71 flow. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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-01-09 16:22:08,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:22:08,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-01-09 16:22:08,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:22:09,169 INFO L124 PetriNetUnfolderBase]: 382/686 cut-off events. [2025-01-09 16:22:09,170 INFO L125 PetriNetUnfolderBase]: For 276/276 co-relation queries the response was YES. [2025-01-09 16:22:09,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1583 conditions, 686 events. 382/686 cut-off events. For 276/276 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2880 event pairs, 65 based on Foata normal form. 27/709 useless extension candidates. Maximal degree in co-relation 1569. Up to 246 conditions per place. [2025-01-09 16:22:09,175 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 46 selfloop transitions, 9 changer transitions 20/78 dead transitions. [2025-01-09 16:22:09,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 78 transitions, 379 flow [2025-01-09 16:22:09,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 16:22:09,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-09 16:22:09,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2025-01-09 16:22:09,177 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2025-01-09 16:22:09,177 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 71 flow. Second operand 9 states and 117 transitions. [2025-01-09 16:22:09,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 78 transitions, 379 flow [2025-01-09 16:22:09,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 78 transitions, 363 flow, removed 8 selfloop flow, removed 2 redundant places. [2025-01-09 16:22:09,180 INFO L231 Difference]: Finished difference. Result has 42 places, 31 transitions, 156 flow [2025-01-09 16:22:09,180 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=156, PETRI_PLACES=42, PETRI_TRANSITIONS=31} [2025-01-09 16:22:09,183 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 16 predicate places. [2025-01-09 16:22:09,183 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 156 flow [2025-01-09 16:22:09,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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-01-09 16:22:09,183 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:22:09,184 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:22:09,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:22:09,184 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-01-09 16:22:09,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:22:09,184 INFO L85 PathProgramCache]: Analyzing trace with hash -908019650, now seen corresponding path program 2 times [2025-01-09 16:22:09,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:22:09,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952805512] [2025-01-09 16:22:09,185 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:22:09,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:22:09,189 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 1 equivalence classes. [2025-01-09 16:22:09,192 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 16:22:09,192 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:22:09,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:22:09,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:22:09,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:22:09,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952805512] [2025-01-09 16:22:09,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952805512] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:22:09,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:22:09,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:22:09,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492501444] [2025-01-09 16:22:09,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:22:09,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:22:09,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:22:09,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:22:09,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:22:09,268 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-01-09 16:22:09,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 156 flow. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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-01-09 16:22:09,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:22:09,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-01-09 16:22:09,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:22:09,422 INFO L124 PetriNetUnfolderBase]: 328/602 cut-off events. [2025-01-09 16:22:09,422 INFO L125 PetriNetUnfolderBase]: For 971/971 co-relation queries the response was YES. [2025-01-09 16:22:09,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1731 conditions, 602 events. 328/602 cut-off events. For 971/971 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2501 event pairs, 65 based on Foata normal form. 45/643 useless extension candidates. Maximal degree in co-relation 1710. Up to 234 conditions per place. [2025-01-09 16:22:09,424 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 38 selfloop transitions, 9 changer transitions 28/78 dead transitions. [2025-01-09 16:22:09,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 78 transitions, 496 flow [2025-01-09 16:22:09,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:22:09,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-09 16:22:09,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2025-01-09 16:22:09,426 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5364583333333334 [2025-01-09 16:22:09,426 INFO L175 Difference]: Start difference. First operand has 42 places, 31 transitions, 156 flow. Second operand 8 states and 103 transitions. [2025-01-09 16:22:09,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 78 transitions, 496 flow [2025-01-09 16:22:09,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 78 transitions, 488 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-01-09 16:22:09,429 INFO L231 Difference]: Finished difference. Result has 49 places, 33 transitions, 210 flow [2025-01-09 16:22:09,429 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=210, PETRI_PLACES=49, PETRI_TRANSITIONS=33} [2025-01-09 16:22:09,430 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 23 predicate places. [2025-01-09 16:22:09,430 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 33 transitions, 210 flow [2025-01-09 16:22:09,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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-01-09 16:22:09,430 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:22:09,430 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:22:09,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:22:09,431 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-01-09 16:22:09,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:22:09,431 INFO L85 PathProgramCache]: Analyzing trace with hash 382127805, now seen corresponding path program 1 times [2025-01-09 16:22:09,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:22:09,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189654694] [2025-01-09 16:22:09,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:22:09,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:22:09,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-09 16:22:09,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-09 16:22:09,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:22:09,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:22:09,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:22:09,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:22:09,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189654694] [2025-01-09 16:22:09,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189654694] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:22:09,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:22:09,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:22:09,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089973351] [2025-01-09 16:22:09,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:22:09,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:22:09,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:22:09,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:22:09,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:22:09,519 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-01-09 16:22:09,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 33 transitions, 210 flow. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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-01-09 16:22:09,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:22:09,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-01-09 16:22:09,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:22:09,712 INFO L124 PetriNetUnfolderBase]: 337/611 cut-off events. [2025-01-09 16:22:09,712 INFO L125 PetriNetUnfolderBase]: For 1649/1649 co-relation queries the response was YES. [2025-01-09 16:22:09,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1936 conditions, 611 events. 337/611 cut-off events. For 1649/1649 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2546 event pairs, 74 based on Foata normal form. 18/625 useless extension candidates. Maximal degree in co-relation 1910. Up to 237 conditions per place. [2025-01-09 16:22:09,716 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 46 selfloop transitions, 16 changer transitions 24/89 dead transitions. [2025-01-09 16:22:09,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 89 transitions, 607 flow [2025-01-09 16:22:09,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 16:22:09,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 16:22:09,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 135 transitions. [2025-01-09 16:22:09,717 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5113636363636364 [2025-01-09 16:22:09,717 INFO L175 Difference]: Start difference. First operand has 49 places, 33 transitions, 210 flow. Second operand 11 states and 135 transitions. [2025-01-09 16:22:09,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 89 transitions, 607 flow [2025-01-09 16:22:09,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 89 transitions, 540 flow, removed 24 selfloop flow, removed 7 redundant places. [2025-01-09 16:22:09,722 INFO L231 Difference]: Finished difference. Result has 54 places, 39 transitions, 279 flow [2025-01-09 16:22:09,722 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=279, PETRI_PLACES=54, PETRI_TRANSITIONS=39} [2025-01-09 16:22:09,723 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 28 predicate places. [2025-01-09 16:22:09,723 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 39 transitions, 279 flow [2025-01-09 16:22:09,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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-01-09 16:22:09,723 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:22:09,723 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:22:09,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:22:09,723 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-01-09 16:22:09,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:22:09,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1499908535, now seen corresponding path program 2 times [2025-01-09 16:22:09,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:22:09,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036500815] [2025-01-09 16:22:09,724 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:22:09,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:22:09,728 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 1 equivalence classes. [2025-01-09 16:22:09,731 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-09 16:22:09,731 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:22:09,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:22:09,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:22:09,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:22:09,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036500815] [2025-01-09 16:22:09,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036500815] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:22:09,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:22:09,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:22:09,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475132529] [2025-01-09 16:22:09,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:22:09,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:22:09,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:22:09,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:22:09,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:22:09,830 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-01-09 16:22:09,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 39 transitions, 279 flow. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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-01-09 16:22:09,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:22:09,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-01-09 16:22:09,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:22:10,023 INFO L124 PetriNetUnfolderBase]: 445/798 cut-off events. [2025-01-09 16:22:10,023 INFO L125 PetriNetUnfolderBase]: For 2473/2473 co-relation queries the response was YES. [2025-01-09 16:22:10,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2624 conditions, 798 events. 445/798 cut-off events. For 2473/2473 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3421 event pairs, 59 based on Foata normal form. 27/819 useless extension candidates. Maximal degree in co-relation 2597. Up to 151 conditions per place. [2025-01-09 16:22:10,031 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 44 selfloop transitions, 23 changer transitions 30/100 dead transitions. [2025-01-09 16:22:10,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 100 transitions, 739 flow [2025-01-09 16:22:10,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 16:22:10,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 16:22:10,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 138 transitions. [2025-01-09 16:22:10,033 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5227272727272727 [2025-01-09 16:22:10,033 INFO L175 Difference]: Start difference. First operand has 54 places, 39 transitions, 279 flow. Second operand 11 states and 138 transitions. [2025-01-09 16:22:10,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 100 transitions, 739 flow [2025-01-09 16:22:10,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 100 transitions, 685 flow, removed 21 selfloop flow, removed 4 redundant places. [2025-01-09 16:22:10,042 INFO L231 Difference]: Finished difference. Result has 65 places, 45 transitions, 390 flow [2025-01-09 16:22:10,043 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=390, PETRI_PLACES=65, PETRI_TRANSITIONS=45} [2025-01-09 16:22:10,043 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 39 predicate places. [2025-01-09 16:22:10,044 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 45 transitions, 390 flow [2025-01-09 16:22:10,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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-01-09 16:22:10,044 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:22:10,044 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:22:10,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:22:10,045 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-01-09 16:22:10,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:22:10,046 INFO L85 PathProgramCache]: Analyzing trace with hash 820165627, now seen corresponding path program 1 times [2025-01-09 16:22:10,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:22:10,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243417518] [2025-01-09 16:22:10,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:22:10,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:22:10,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 16:22:10,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 16:22:10,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:22:10,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:22:10,141 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:22:10,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:22:10,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243417518] [2025-01-09 16:22:10,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243417518] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:22:10,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524112079] [2025-01-09 16:22:10,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:22:10,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:22:10,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:22:10,147 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:22:10,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 16:22:10,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 16:22:10,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 16:22:10,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:22:10,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:22:10,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 16:22:10,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:22:10,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:22:10,251 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:22:10,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:22:10,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524112079] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:22:10,361 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:22:10,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-01-09 16:22:10,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436726741] [2025-01-09 16:22:10,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:22:10,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 16:22:10,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:22:10,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 16:22:10,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-01-09 16:22:10,378 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-01-09 16:22:10,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 45 transitions, 390 flow. Second operand has 13 states, 13 states have (on average 7.153846153846154) internal successors, (93), 13 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:22:10,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:22:10,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-01-09 16:22:10,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:22:10,724 INFO L124 PetriNetUnfolderBase]: 571/1049 cut-off events. [2025-01-09 16:22:10,724 INFO L125 PetriNetUnfolderBase]: For 6872/6872 co-relation queries the response was YES. [2025-01-09 16:22:10,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4138 conditions, 1049 events. 571/1049 cut-off events. For 6872/6872 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 4385 event pairs, 137 based on Foata normal form. 63/1108 useless extension candidates. Maximal degree in co-relation 4106. Up to 486 conditions per place. [2025-01-09 16:22:10,729 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 64 selfloop transitions, 17 changer transitions 67/151 dead transitions. [2025-01-09 16:22:10,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 151 transitions, 1346 flow [2025-01-09 16:22:10,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 16:22:10,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-01-09 16:22:10,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 231 transitions. [2025-01-09 16:22:10,731 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.506578947368421 [2025-01-09 16:22:10,732 INFO L175 Difference]: Start difference. First operand has 65 places, 45 transitions, 390 flow. Second operand 19 states and 231 transitions. [2025-01-09 16:22:10,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 151 transitions, 1346 flow [2025-01-09 16:22:10,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 151 transitions, 1267 flow, removed 32 selfloop flow, removed 5 redundant places. [2025-01-09 16:22:10,740 INFO L231 Difference]: Finished difference. Result has 88 places, 51 transitions, 521 flow [2025-01-09 16:22:10,740 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=341, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=521, PETRI_PLACES=88, PETRI_TRANSITIONS=51} [2025-01-09 16:22:10,741 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 62 predicate places. [2025-01-09 16:22:10,741 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 51 transitions, 521 flow [2025-01-09 16:22:10,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.153846153846154) internal successors, (93), 13 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:22:10,741 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:22:10,741 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:22:10,748 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 16:22:10,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:22:10,942 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-01-09 16:22:10,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:22:10,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1577438379, now seen corresponding path program 2 times [2025-01-09 16:22:10,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:22:10,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996235400] [2025-01-09 16:22:10,943 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:22:10,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:22:10,947 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 1 equivalence classes. [2025-01-09 16:22:10,950 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 16:22:10,950 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:22:10,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:22:11,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:22:11,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:22:11,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996235400] [2025-01-09 16:22:11,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996235400] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:22:11,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:22:11,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:22:11,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928385018] [2025-01-09 16:22:11,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:22:11,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:22:11,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:22:11,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:22:11,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:22:11,035 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-01-09 16:22:11,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 51 transitions, 521 flow. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 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-01-09 16:22:11,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:22:11,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-01-09 16:22:11,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:22:11,324 INFO L124 PetriNetUnfolderBase]: 652/1216 cut-off events. [2025-01-09 16:22:11,324 INFO L125 PetriNetUnfolderBase]: For 19130/19130 co-relation queries the response was YES. [2025-01-09 16:22:11,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6061 conditions, 1216 events. 652/1216 cut-off events. For 19130/19130 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 5659 event pairs, 132 based on Foata normal form. 27/1239 useless extension candidates. Maximal degree in co-relation 6018. Up to 483 conditions per place. [2025-01-09 16:22:11,330 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 76 selfloop transitions, 23 changer transitions 31/133 dead transitions. [2025-01-09 16:22:11,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 133 transitions, 1509 flow [2025-01-09 16:22:11,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 16:22:11,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-01-09 16:22:11,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 187 transitions. [2025-01-09 16:22:11,331 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5194444444444445 [2025-01-09 16:22:11,332 INFO L175 Difference]: Start difference. First operand has 88 places, 51 transitions, 521 flow. Second operand 15 states and 187 transitions. [2025-01-09 16:22:11,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 133 transitions, 1509 flow [2025-01-09 16:22:11,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 133 transitions, 1211 flow, removed 138 selfloop flow, removed 12 redundant places. [2025-01-09 16:22:11,347 INFO L231 Difference]: Finished difference. Result has 90 places, 57 transitions, 583 flow [2025-01-09 16:22:11,348 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=397, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=583, PETRI_PLACES=90, PETRI_TRANSITIONS=57} [2025-01-09 16:22:11,348 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 64 predicate places. [2025-01-09 16:22:11,348 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 57 transitions, 583 flow [2025-01-09 16:22:11,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 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-01-09 16:22:11,348 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:22:11,348 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:22:11,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 16:22:11,349 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-01-09 16:22:11,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:22:11,349 INFO L85 PathProgramCache]: Analyzing trace with hash 133024501, now seen corresponding path program 3 times [2025-01-09 16:22:11,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:22:11,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656450103] [2025-01-09 16:22:11,349 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:22:11,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:22:11,354 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-01-09 16:22:11,357 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 16:22:11,358 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 16:22:11,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:22:11,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:22:11,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:22:11,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656450103] [2025-01-09 16:22:11,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656450103] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:22:11,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189430738] [2025-01-09 16:22:11,452 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:22:11,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:22:11,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:22:11,454 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:22:11,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 16:22:11,488 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-01-09 16:22:11,497 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 16:22:11,497 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 16:22:11,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:22:11,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 16:22:11,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:22:11,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:22:11,549 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:22:11,649 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:22:11,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1189430738] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:22:11,649 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:22:11,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-01-09 16:22:11,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551020586] [2025-01-09 16:22:11,650 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:22:11,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 16:22:11,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:22:11,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 16:22:11,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-01-09 16:22:11,668 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-01-09 16:22:11,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 57 transitions, 583 flow. Second operand has 14 states, 14 states have (on average 7.071428571428571) internal successors, (99), 14 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:22:11,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:22:11,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-01-09 16:22:11,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:22:12,255 INFO L124 PetriNetUnfolderBase]: 841/1528 cut-off events. [2025-01-09 16:22:12,255 INFO L125 PetriNetUnfolderBase]: For 24317/24317 co-relation queries the response was YES. [2025-01-09 16:22:12,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7755 conditions, 1528 events. 841/1528 cut-off events. For 24317/24317 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 7221 event pairs, 46 based on Foata normal form. 81/1605 useless extension candidates. Maximal degree in co-relation 7712. Up to 246 conditions per place. [2025-01-09 16:22:12,264 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 79 selfloop transitions, 49 changer transitions 83/214 dead transitions. [2025-01-09 16:22:12,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 214 transitions, 2477 flow [2025-01-09 16:22:12,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-01-09 16:22:12,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-01-09 16:22:12,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 321 transitions. [2025-01-09 16:22:12,265 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5144230769230769 [2025-01-09 16:22:12,265 INFO L175 Difference]: Start difference. First operand has 90 places, 57 transitions, 583 flow. Second operand 26 states and 321 transitions. [2025-01-09 16:22:12,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 214 transitions, 2477 flow [2025-01-09 16:22:12,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 214 transitions, 2253 flow, removed 96 selfloop flow, removed 10 redundant places. [2025-01-09 16:22:12,291 INFO L231 Difference]: Finished difference. Result has 119 places, 70 transitions, 953 flow [2025-01-09 16:22:12,291 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=481, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=953, PETRI_PLACES=119, PETRI_TRANSITIONS=70} [2025-01-09 16:22:12,292 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 93 predicate places. [2025-01-09 16:22:12,293 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 70 transitions, 953 flow [2025-01-09 16:22:12,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.071428571428571) internal successors, (99), 14 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:22:12,293 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:22:12,293 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:22:12,302 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 16:22:12,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:22:12,497 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-01-09 16:22:12,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:22:12,498 INFO L85 PathProgramCache]: Analyzing trace with hash 329719795, now seen corresponding path program 1 times [2025-01-09 16:22:12,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:22:12,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788413775] [2025-01-09 16:22:12,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:22:12,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:22:12,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 16:22:12,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 16:22:12,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:22:12,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:22:12,621 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:22:12,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:22:12,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788413775] [2025-01-09 16:22:12,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788413775] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:22:12,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2070277901] [2025-01-09 16:22:12,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:22:12,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:22:12,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:22:12,624 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:22:12,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 16:22:12,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 16:22:12,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 16:22:12,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:22:12,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:22:12,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-09 16:22:12,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:22:12,721 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:22:12,721 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:22:12,846 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:22:12,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2070277901] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:22:12,847 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:22:12,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2025-01-09 16:22:12,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209723383] [2025-01-09 16:22:12,847 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:22:12,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 16:22:12,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:22:12,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 16:22:12,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2025-01-09 16:22:12,879 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-01-09 16:22:12,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 70 transitions, 953 flow. Second operand has 18 states, 18 states have (on average 7.055555555555555) internal successors, (127), 18 states have internal predecessors, (127), 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-01-09 16:22:12,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:22:12,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-01-09 16:22:12,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:22:13,593 INFO L124 PetriNetUnfolderBase]: 1327/2413 cut-off events. [2025-01-09 16:22:13,593 INFO L125 PetriNetUnfolderBase]: For 77863/77863 co-relation queries the response was YES. [2025-01-09 16:22:13,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14982 conditions, 2413 events. 1327/2413 cut-off events. For 77863/77863 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 11785 event pairs, 83 based on Foata normal form. 63/2470 useless extension candidates. Maximal degree in co-relation 14925. Up to 444 conditions per place. [2025-01-09 16:22:13,608 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 97 selfloop transitions, 80 changer transitions 86/266 dead transitions. [2025-01-09 16:22:13,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 266 transitions, 4124 flow [2025-01-09 16:22:13,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-01-09 16:22:13,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2025-01-09 16:22:13,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 358 transitions. [2025-01-09 16:22:13,611 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.514367816091954 [2025-01-09 16:22:13,611 INFO L175 Difference]: Start difference. First operand has 119 places, 70 transitions, 953 flow. Second operand 29 states and 358 transitions. [2025-01-09 16:22:13,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 266 transitions, 4124 flow [2025-01-09 16:22:13,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 266 transitions, 3416 flow, removed 330 selfloop flow, removed 18 redundant places. [2025-01-09 16:22:13,700 INFO L231 Difference]: Finished difference. Result has 141 places, 106 transitions, 1630 flow [2025-01-09 16:22:13,700 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=675, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=1630, PETRI_PLACES=141, PETRI_TRANSITIONS=106} [2025-01-09 16:22:13,701 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 115 predicate places. [2025-01-09 16:22:13,701 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 106 transitions, 1630 flow [2025-01-09 16:22:13,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 7.055555555555555) internal successors, (127), 18 states have internal predecessors, (127), 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-01-09 16:22:13,701 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:22:13,702 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:22:13,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 16:22:13,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:22:13,903 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-01-09 16:22:13,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:22:13,904 INFO L85 PathProgramCache]: Analyzing trace with hash -585990530, now seen corresponding path program 2 times [2025-01-09 16:22:13,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:22:13,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564921300] [2025-01-09 16:22:13,904 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:22:13,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:22:13,911 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-01-09 16:22:13,918 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 16:22:13,920 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:22:13,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:22:14,094 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:22:14,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:22:14,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564921300] [2025-01-09 16:22:14,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564921300] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:22:14,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [719355172] [2025-01-09 16:22:14,095 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:22:14,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:22:14,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:22:14,097 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:22:14,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 16:22:14,133 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-01-09 16:22:14,144 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 16:22:14,144 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:22:14,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:22:14,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 16:22:14,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:22:14,237 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:22:14,237 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:22:14,545 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:22:14,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [719355172] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:22:14,545 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:22:14,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2025-01-09 16:22:14,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179539666] [2025-01-09 16:22:14,545 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:22:14,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-09 16:22:14,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:22:14,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-09 16:22:14,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2025-01-09 16:22:14,571 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-01-09 16:22:14,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 106 transitions, 1630 flow. Second operand has 25 states, 25 states have (on average 7.2) internal successors, (180), 25 states have internal predecessors, (180), 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-01-09 16:22:14,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:22:14,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-01-09 16:22:14,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:22:15,460 INFO L124 PetriNetUnfolderBase]: 1561/2912 cut-off events. [2025-01-09 16:22:15,460 INFO L125 PetriNetUnfolderBase]: For 172037/172037 co-relation queries the response was YES. [2025-01-09 16:22:15,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21786 conditions, 2912 events. 1561/2912 cut-off events. For 172037/172037 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 13942 event pairs, 455 based on Foata normal form. 117/3025 useless extension candidates. Maximal degree in co-relation 21719. Up to 1656 conditions per place. [2025-01-09 16:22:15,477 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 152 selfloop transitions, 35 changer transitions 133/323 dead transitions. [2025-01-09 16:22:15,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 323 transitions, 6273 flow [2025-01-09 16:22:15,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-01-09 16:22:15,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2025-01-09 16:22:15,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 441 transitions. [2025-01-09 16:22:15,479 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4966216216216216 [2025-01-09 16:22:15,479 INFO L175 Difference]: Start difference. First operand has 141 places, 106 transitions, 1630 flow. Second operand 37 states and 441 transitions. [2025-01-09 16:22:15,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 323 transitions, 6273 flow [2025-01-09 16:22:15,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 323 transitions, 4779 flow, removed 724 selfloop flow, removed 14 redundant places. [2025-01-09 16:22:15,584 INFO L231 Difference]: Finished difference. Result has 181 places, 120 transitions, 1824 flow [2025-01-09 16:22:15,585 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=1148, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=1824, PETRI_PLACES=181, PETRI_TRANSITIONS=120} [2025-01-09 16:22:15,585 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 155 predicate places. [2025-01-09 16:22:15,585 INFO L471 AbstractCegarLoop]: Abstraction has has 181 places, 120 transitions, 1824 flow [2025-01-09 16:22:15,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 7.2) internal successors, (180), 25 states have internal predecessors, (180), 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-01-09 16:22:15,585 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:22:15,585 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:22:15,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 16:22:15,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-09 16:22:15,786 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:22:15,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:22:15,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1476950616, now seen corresponding path program 3 times [2025-01-09 16:22:15,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:22:15,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457081323] [2025-01-09 16:22:15,787 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:22:15,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:22:15,791 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 4 equivalence classes. [2025-01-09 16:22:15,796 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 16:22:15,796 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-01-09 16:22:15,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:22:15,966 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:22:15,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:22:15,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457081323] [2025-01-09 16:22:15,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457081323] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:22:15,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437470259] [2025-01-09 16:22:15,966 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:22:15,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:22:15,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:22:15,971 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:22:15,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 16:22:16,001 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 4 equivalence classes. [2025-01-09 16:22:16,011 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 16:22:16,012 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-01-09 16:22:16,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:22:16,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 16:22:16,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:22:16,080 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:22:16,080 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:22:16,310 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:22:16,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437470259] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:22:16,310 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:22:16,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2025-01-09 16:22:16,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335958459] [2025-01-09 16:22:16,310 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:22:16,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-09 16:22:16,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:22:16,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-09 16:22:16,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=476, Unknown=0, NotChecked=0, Total=600 [2025-01-09 16:22:16,338 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-01-09 16:22:16,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 120 transitions, 1824 flow. Second operand has 25 states, 25 states have (on average 7.2) internal successors, (180), 25 states have internal predecessors, (180), 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-01-09 16:22:16,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:22:16,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-01-09 16:22:16,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:22:17,600 INFO L124 PetriNetUnfolderBase]: 1957/3798 cut-off events. [2025-01-09 16:22:17,600 INFO L125 PetriNetUnfolderBase]: For 291079/291079 co-relation queries the response was YES. [2025-01-09 16:22:17,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30188 conditions, 3798 events. 1957/3798 cut-off events. For 291079/291079 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 20760 event pairs, 266 based on Foata normal form. 117/3911 useless extension candidates. Maximal degree in co-relation 30103. Up to 1084 conditions per place. [2025-01-09 16:22:17,626 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 152 selfloop transitions, 106 changer transitions 147/408 dead transitions. [2025-01-09 16:22:17,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 408 transitions, 8148 flow [2025-01-09 16:22:17,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-01-09 16:22:17,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2025-01-09 16:22:17,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 527 transitions. [2025-01-09 16:22:17,629 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4990530303030303 [2025-01-09 16:22:17,629 INFO L175 Difference]: Start difference. First operand has 181 places, 120 transitions, 1824 flow. Second operand 44 states and 527 transitions. [2025-01-09 16:22:17,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 408 transitions, 8148 flow [2025-01-09 16:22:17,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 408 transitions, 6881 flow, removed 613 selfloop flow, removed 24 redundant places. [2025-01-09 16:22:17,862 INFO L231 Difference]: Finished difference. Result has 213 places, 165 transitions, 2837 flow [2025-01-09 16:22:17,862 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=1325, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=2837, PETRI_PLACES=213, PETRI_TRANSITIONS=165} [2025-01-09 16:22:17,863 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 187 predicate places. [2025-01-09 16:22:17,863 INFO L471 AbstractCegarLoop]: Abstraction has has 213 places, 165 transitions, 2837 flow [2025-01-09 16:22:17,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 7.2) internal successors, (180), 25 states have internal predecessors, (180), 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-01-09 16:22:17,863 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:22:17,863 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:22:17,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 16:22:18,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-09 16:22:18,064 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:22:18,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:22:18,064 INFO L85 PathProgramCache]: Analyzing trace with hash 854768232, now seen corresponding path program 4 times [2025-01-09 16:22:18,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:22:18,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986960277] [2025-01-09 16:22:18,064 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:22:18,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:22:18,074 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 39 statements into 2 equivalence classes. [2025-01-09 16:22:18,085 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 16:22:18,085 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:22:18,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:22:18,336 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:22:18,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:22:18,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986960277] [2025-01-09 16:22:18,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986960277] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:22:18,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528230644] [2025-01-09 16:22:18,336 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:22:18,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:22:18,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:22:18,338 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:22:18,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 16:22:18,370 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 39 statements into 2 equivalence classes. [2025-01-09 16:22:18,382 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 16:22:18,382 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:22:18,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:22:18,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 16:22:18,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:22:18,449 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:22:18,449 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:22:18,647 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:22:18,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528230644] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:22:18,647 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:22:18,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2025-01-09 16:22:18,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846982428] [2025-01-09 16:22:18,647 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:22:18,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-09 16:22:18,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:22:18,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-09 16:22:18,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=532, Unknown=0, NotChecked=0, Total=650 [2025-01-09 16:22:18,677 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-01-09 16:22:18,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 165 transitions, 2837 flow. Second operand has 26 states, 26 states have (on average 7.230769230769231) internal successors, (188), 26 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:22:18,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:22:18,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-01-09 16:22:18,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:22:20,566 INFO L124 PetriNetUnfolderBase]: 3433/6568 cut-off events. [2025-01-09 16:22:20,566 INFO L125 PetriNetUnfolderBase]: For 700008/700008 co-relation queries the response was YES. [2025-01-09 16:22:20,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57355 conditions, 6568 events. 3433/6568 cut-off events. For 700008/700008 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 41204 event pairs, 144 based on Foata normal form. 126/6690 useless extension candidates. Maximal degree in co-relation 57257. Up to 1500 conditions per place. [2025-01-09 16:22:20,629 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 161 selfloop transitions, 235 changer transitions 162/561 dead transitions. [2025-01-09 16:22:20,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 561 transitions, 12693 flow [2025-01-09 16:22:20,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-01-09 16:22:20,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2025-01-09 16:22:20,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 607 transitions. [2025-01-09 16:22:20,631 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5058333333333334 [2025-01-09 16:22:20,632 INFO L175 Difference]: Start difference. First operand has 213 places, 165 transitions, 2837 flow. Second operand 50 states and 607 transitions. [2025-01-09 16:22:20,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 561 transitions, 12693 flow [2025-01-09 16:22:21,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 561 transitions, 10864 flow, removed 886 selfloop flow, removed 26 redundant places. [2025-01-09 16:22:21,682 INFO L231 Difference]: Finished difference. Result has 256 places, 278 transitions, 5391 flow [2025-01-09 16:22:21,683 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=2126, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=50, PETRI_FLOW=5391, PETRI_PLACES=256, PETRI_TRANSITIONS=278} [2025-01-09 16:22:21,683 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 230 predicate places. [2025-01-09 16:22:21,683 INFO L471 AbstractCegarLoop]: Abstraction has has 256 places, 278 transitions, 5391 flow [2025-01-09 16:22:21,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 7.230769230769231) internal successors, (188), 26 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:22:21,684 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:22:21,684 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:22:21,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-09 16:22:21,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-01-09 16:22:21,884 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:22:21,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:22:21,885 INFO L85 PathProgramCache]: Analyzing trace with hash -487926749, now seen corresponding path program 5 times [2025-01-09 16:22:21,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:22:21,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084234171] [2025-01-09 16:22:21,885 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:22:21,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:22:21,890 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 42 statements into 5 equivalence classes. [2025-01-09 16:22:21,894 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 16:22:21,894 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-01-09 16:22:21,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:22:22,021 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:22:22,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:22:22,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084234171] [2025-01-09 16:22:22,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084234171] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:22:22,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654290243] [2025-01-09 16:22:22,021 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:22:22,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:22:22,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:22:22,023 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:22:22,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 16:22:22,057 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 42 statements into 5 equivalence classes. [2025-01-09 16:22:22,068 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 16:22:22,068 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-01-09 16:22:22,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:22:22,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 16:22:22,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:22:22,124 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:22:22,125 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:22:22,317 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:22:22,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [654290243] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:22:22,317 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:22:22,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 26 [2025-01-09 16:22:22,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923097054] [2025-01-09 16:22:22,317 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:22:22,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-01-09 16:22:22,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:22:22,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-01-09 16:22:22,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=547, Unknown=0, NotChecked=0, Total=702 [2025-01-09 16:22:22,338 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-01-09 16:22:22,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 278 transitions, 5391 flow. Second operand has 27 states, 27 states have (on average 7.185185185185185) internal successors, (194), 27 states have internal predecessors, (194), 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-01-09 16:22:22,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:22:22,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-01-09 16:22:22,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:22:25,065 INFO L124 PetriNetUnfolderBase]: 4819/9210 cut-off events. [2025-01-09 16:22:25,066 INFO L125 PetriNetUnfolderBase]: For 1635604/1635604 co-relation queries the response was YES. [2025-01-09 16:22:25,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99054 conditions, 9210 events. 4819/9210 cut-off events. For 1635604/1635604 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 59330 event pairs, 47 based on Foata normal form. 135/9339 useless extension candidates. Maximal degree in co-relation 98936. Up to 2127 conditions per place. [2025-01-09 16:22:25,165 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 198 selfloop transitions, 357 changer transitions 183/741 dead transitions. [2025-01-09 16:22:25,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 741 transitions, 21890 flow [2025-01-09 16:22:25,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2025-01-09 16:22:25,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2025-01-09 16:22:25,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 750 transitions. [2025-01-09 16:22:25,170 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5122950819672131 [2025-01-09 16:22:25,170 INFO L175 Difference]: Start difference. First operand has 256 places, 278 transitions, 5391 flow. Second operand 61 states and 750 transitions. [2025-01-09 16:22:25,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 741 transitions, 21890 flow [2025-01-09 16:22:27,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 741 transitions, 15904 flow, removed 2955 selfloop flow, removed 25 redundant places. [2025-01-09 16:22:27,729 INFO L231 Difference]: Finished difference. Result has 318 places, 387 transitions, 8332 flow [2025-01-09 16:22:27,729 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=4027, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=249, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=61, PETRI_FLOW=8332, PETRI_PLACES=318, PETRI_TRANSITIONS=387} [2025-01-09 16:22:27,730 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 292 predicate places. [2025-01-09 16:22:27,730 INFO L471 AbstractCegarLoop]: Abstraction has has 318 places, 387 transitions, 8332 flow [2025-01-09 16:22:27,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 7.185185185185185) internal successors, (194), 27 states have internal predecessors, (194), 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-01-09 16:22:27,731 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:22:27,731 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:22:27,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-09 16:22:27,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:22:27,931 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:22:27,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:22:27,932 INFO L85 PathProgramCache]: Analyzing trace with hash -739125571, now seen corresponding path program 6 times [2025-01-09 16:22:27,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:22:27,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338699656] [2025-01-09 16:22:27,932 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 16:22:27,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:22:27,941 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 66 statements into 8 equivalence classes. [2025-01-09 16:22:27,957 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 16:22:27,957 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-01-09 16:22:27,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:22:28,221 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:22:28,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:22:28,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338699656] [2025-01-09 16:22:28,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338699656] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:22:28,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172908054] [2025-01-09 16:22:28,221 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 16:22:28,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:22:28,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:22:28,225 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:22:28,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 16:22:28,255 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 66 statements into 8 equivalence classes. [2025-01-09 16:22:28,275 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 16:22:28,276 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-01-09 16:22:28,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:22:28,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-09 16:22:28,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:22:28,368 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:22:28,368 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:22:28,728 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:22:28,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1172908054] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:22:28,729 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:22:28,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 44 [2025-01-09 16:22:28,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022187140] [2025-01-09 16:22:28,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:22:28,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-01-09 16:22:28,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:22:28,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-01-09 16:22:28,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=461, Invalid=1519, Unknown=0, NotChecked=0, Total=1980 [2025-01-09 16:22:28,781 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-01-09 16:22:28,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 387 transitions, 8332 flow. Second operand has 45 states, 45 states have (on average 7.044444444444444) internal successors, (317), 45 states have internal predecessors, (317), 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-01-09 16:22:28,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:22:28,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-01-09 16:22:28,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:22:33,912 INFO L124 PetriNetUnfolderBase]: 6574/12420 cut-off events. [2025-01-09 16:22:33,913 INFO L125 PetriNetUnfolderBase]: For 3237313/3237313 co-relation queries the response was YES. [2025-01-09 16:22:34,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155450 conditions, 12420 events. 6574/12420 cut-off events. For 3237313/3237313 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 76672 event pairs, 58 based on Foata normal form. 279/12695 useless extension candidates. Maximal degree in co-relation 155303. Up to 2835 conditions per place. [2025-01-09 16:22:34,142 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 316 selfloop transitions, 470 changer transitions 329/1118 dead transitions. [2025-01-09 16:22:34,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 407 places, 1118 transitions, 37469 flow [2025-01-09 16:22:34,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2025-01-09 16:22:34,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2025-01-09 16:22:34,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 1284 transitions. [2025-01-09 16:22:34,144 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5095238095238095 [2025-01-09 16:22:34,144 INFO L175 Difference]: Start difference. First operand has 318 places, 387 transitions, 8332 flow. Second operand 105 states and 1284 transitions. [2025-01-09 16:22:34,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 407 places, 1118 transitions, 37469 flow [2025-01-09 16:22:38,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 1118 transitions, 29014 flow, removed 4177 selfloop flow, removed 27 redundant places. [2025-01-09 16:22:38,269 INFO L231 Difference]: Finished difference. Result has 444 places, 502 transitions, 12264 flow [2025-01-09 16:22:38,269 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=6067, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=387, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=358, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=105, PETRI_FLOW=12264, PETRI_PLACES=444, PETRI_TRANSITIONS=502} [2025-01-09 16:22:38,270 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 418 predicate places. [2025-01-09 16:22:38,270 INFO L471 AbstractCegarLoop]: Abstraction has has 444 places, 502 transitions, 12264 flow [2025-01-09 16:22:38,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 7.044444444444444) internal successors, (317), 45 states have internal predecessors, (317), 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-01-09 16:22:38,270 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:22:38,271 INFO L206 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:22:38,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-09 16:22:38,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:22:38,474 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:22:38,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:22:38,475 INFO L85 PathProgramCache]: Analyzing trace with hash -625182617, now seen corresponding path program 7 times [2025-01-09 16:22:38,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:22:38,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691312002] [2025-01-09 16:22:38,475 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 16:22:38,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:22:38,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-09 16:22:38,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-09 16:22:38,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:22:38,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:22:39,440 INFO L134 CoverageAnalysis]: Checked inductivity of 793 backedges. 0 proven. 792 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:22:39,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:22:39,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691312002] [2025-01-09 16:22:39,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691312002] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:22:39,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799442245] [2025-01-09 16:22:39,441 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 16:22:39,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:22:39,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:22:39,444 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:22:39,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-09 16:22:39,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-09 16:22:39,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-09 16:22:39,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:22:39,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:22:39,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-01-09 16:22:39,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:22:39,670 INFO L134 CoverageAnalysis]: Checked inductivity of 793 backedges. 0 proven. 792 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:22:39,670 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:22:40,200 INFO L134 CoverageAnalysis]: Checked inductivity of 793 backedges. 0 proven. 792 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:22:40,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [799442245] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:22:40,201 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:22:40,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 45 [2025-01-09 16:22:40,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455199524] [2025-01-09 16:22:40,201 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:22:40,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-01-09 16:22:40,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:22:40,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-01-09 16:22:40,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=460, Invalid=1610, Unknown=0, NotChecked=0, Total=2070 [2025-01-09 16:22:40,263 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-01-09 16:22:40,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 444 places, 502 transitions, 12264 flow. Second operand has 46 states, 46 states have (on average 7.195652173913044) internal successors, (331), 46 states have internal predecessors, (331), 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-01-09 16:22:40,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:22:40,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-01-09 16:22:40,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:22:47,121 INFO L124 PetriNetUnfolderBase]: 8635/16054 cut-off events. [2025-01-09 16:22:47,121 INFO L125 PetriNetUnfolderBase]: For 6562932/6562932 co-relation queries the response was YES. [2025-01-09 16:22:47,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 230187 conditions, 16054 events. 8635/16054 cut-off events. For 6562932/6562932 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 97330 event pairs, 65 based on Foata normal form. 54/16102 useless extension candidates. Maximal degree in co-relation 229992. Up to 3621 conditions per place. [2025-01-09 16:22:47,322 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 320 selfloop transitions, 631 changer transitions 195/1149 dead transitions. [2025-01-09 16:22:47,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 506 places, 1149 transitions, 43320 flow [2025-01-09 16:22:47,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2025-01-09 16:22:47,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2025-01-09 16:22:47,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 1041 transitions. [2025-01-09 16:22:47,327 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5043604651162791 [2025-01-09 16:22:47,327 INFO L175 Difference]: Start difference. First operand has 444 places, 502 transitions, 12264 flow. Second operand 86 states and 1041 transitions. [2025-01-09 16:22:47,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 506 places, 1149 transitions, 43320 flow [2025-01-09 16:23:08,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 466 places, 1149 transitions, 28246 flow, removed 7436 selfloop flow, removed 40 redundant places. [2025-01-09 16:23:08,018 INFO L231 Difference]: Finished difference. Result has 486 places, 669 transitions, 13503 flow [2025-01-09 16:23:08,019 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=8226, PETRI_DIFFERENCE_MINUEND_PLACES=381, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=502, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=469, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=86, PETRI_FLOW=13503, PETRI_PLACES=486, PETRI_TRANSITIONS=669} [2025-01-09 16:23:08,019 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 460 predicate places. [2025-01-09 16:23:08,020 INFO L471 AbstractCegarLoop]: Abstraction has has 486 places, 669 transitions, 13503 flow [2025-01-09 16:23:08,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 7.195652173913044) internal successors, (331), 46 states have internal predecessors, (331), 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-01-09 16:23:08,020 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:23:08,020 INFO L206 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:23:08,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-09 16:23:08,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:23:08,221 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:23:08,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:23:08,222 INFO L85 PathProgramCache]: Analyzing trace with hash 545898124, now seen corresponding path program 8 times [2025-01-09 16:23:08,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:23:08,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518574780] [2025-01-09 16:23:08,222 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:23:08,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:23:08,228 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 129 statements into 2 equivalence classes. [2025-01-09 16:23:08,242 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 16:23:08,244 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:23:08,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:23:08,245 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 16:23:08,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 16:23:08,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 16:23:08,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:23:08,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:23:08,303 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 16:23:08,303 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 16:23:08,304 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-01-09 16:23:08,305 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-01-09 16:23:08,305 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-01-09 16:23:08,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 16:23:08,306 INFO L422 BasicCegarLoop]: Path program histogram: [8, 3, 2, 2, 1] [2025-01-09 16:23:08,416 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 16:23:08,416 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 16:23:08,422 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 04:23:08 BasicIcfg [2025-01-09 16:23:08,422 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 16:23:08,423 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 16:23:08,423 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 16:23:08,423 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 16:23:08,424 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:22:07" (3/4) ... [2025-01-09 16:23:08,424 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-09 16:23:08,517 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 42. [2025-01-09 16:23:08,579 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 16:23:08,580 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 16:23:08,580 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 16:23:08,581 INFO L158 Benchmark]: Toolchain (without parser) took 61261.04ms. Allocated memory was 167.8MB in the beginning and 2.8GB in the end (delta: 2.6GB). Free memory was 131.7MB in the beginning and 1.1GB in the end (delta: -950.8MB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2025-01-09 16:23:08,581 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 226.5MB. Free memory is still 141.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:23:08,581 INFO L158 Benchmark]: CACSL2BoogieTranslator took 353.25ms. Allocated memory is still 167.8MB. Free memory was 131.2MB in the beginning and 112.1MB in the end (delta: 19.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 16:23:08,581 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.08ms. Allocated memory is still 167.8MB. Free memory was 112.1MB in the beginning and 110.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:23:08,581 INFO L158 Benchmark]: Boogie Preprocessor took 32.96ms. Allocated memory is still 167.8MB. Free memory was 110.7MB in the beginning and 109.1MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 16:23:08,581 INFO L158 Benchmark]: RCFGBuilder took 253.66ms. Allocated memory is still 167.8MB. Free memory was 109.1MB in the beginning and 91.9MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 16:23:08,581 INFO L158 Benchmark]: TraceAbstraction took 60436.00ms. Allocated memory was 167.8MB in the beginning and 2.8GB in the end (delta: 2.6GB). Free memory was 91.4MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2025-01-09 16:23:08,581 INFO L158 Benchmark]: Witness Printer took 157.04ms. Allocated memory is still 2.8GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 29.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-09 16:23:08,582 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 226.5MB. Free memory is still 141.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 353.25ms. Allocated memory is still 167.8MB. Free memory was 131.2MB in the beginning and 112.1MB in the end (delta: 19.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.08ms. Allocated memory is still 167.8MB. Free memory was 112.1MB in the beginning and 110.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.96ms. Allocated memory is still 167.8MB. Free memory was 110.7MB in the beginning and 109.1MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 253.66ms. Allocated memory is still 167.8MB. Free memory was 109.1MB in the beginning and 91.9MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 60436.00ms. Allocated memory was 167.8MB in the beginning and 2.8GB in the end (delta: 2.6GB). Free memory was 91.4MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. * Witness Printer took 157.04ms. Allocated memory is still 2.8GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 29.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 722]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L694] 0 int i = 3, j = 6; [L712] 0 pthread_t id1, id2; [L713] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [\old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, argc=51, i=3, id1=-2, j=6] [L696] 1 int k = 0; VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=6, k=0] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=6, k=0] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, arg={0:0}, i=7, j=6, k=0] [L714] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, argc=51, i=7, id1=-2, id2=-1, j=6, k=0] [L704] 2 int k = 0; VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=0] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=0, k=1] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=1] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=1, k=2] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=2] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=3] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=3] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=3] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=2, k=3] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=3] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=4] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=4] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=3, k=4] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=4] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=5] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=5] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=4, k=5] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=5, k=5] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=5, k=5] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=5] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=5] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=6] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=5, k=6] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=6, k=6] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=6, k=6] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=6, k=6] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=6, k=7] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=6, k=7] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=6, k=7] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=7, k=7] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=7, k=7] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=7] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=7] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=8] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=7, k=8] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=7, k=8] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=8, k=8] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=8] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=9] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=9] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=8, k=9] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=8, k=9] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=9, k=9] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=9, k=9] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=10, k=9] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=10, k=9] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=10, k=9] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=10, k=10] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=10, k=10] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=10, k=10] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=27, j=26, k=10, k=10] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=27, j=26, k=10, k=11] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=27, j=28, k=10, k=11] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=27, j=28, k=10, k=11] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=27, j=28, k=11, k=11] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=29, j=28, k=11, k=11] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=29, j=28, k=11, k=12] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=29, j=28, k=11, k=12] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=29, j=30, k=11, k=12] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=29, j=30, k=12, k=12] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=29, j=30, k=12, k=12] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=31, j=30, k=12, k=12] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=31, j=30, k=12, k=13] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=31, j=30, k=12, k=13] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=31, j=32, k=12, k=13] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=31, j=32, k=13, k=13] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=31, j=32, k=13, k=13] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=33, j=32, k=13, k=13] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=33, j=32, k=13, k=14] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=33, j=32, k=13, k=14] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=33, j=34, k=13, k=14] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=33, j=34, k=13, k=14] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=33, j=34, k=14, k=14] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=35, j=34, k=14, k=14] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=35, j=34, k=14, k=15] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=35, j=34, k=14, k=15] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=35, j=36, k=14, k=15] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=35, j=36, k=15, k=15] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=35, j=36, k=15, k=15] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=37, j=36, k=15, k=15] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=37, j=36, k=15, k=16] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=37, j=36, k=15, k=16] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=37, j=38, k=15, k=16] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=37, j=38, k=16, k=16] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=37, j=38, k=16, k=16] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=39, j=38, k=16, k=16] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=39, j=38, k=16, k=17] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=39, j=38, k=16, k=17] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=39, j=40, k=16, k=17] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=39, j=40, k=16, k=17] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=39, j=40, k=17, k=17] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=41, j=40, k=17, k=17] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=41, j=40, k=17, k=18] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=41, j=40, k=17, k=18] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=41, j=42, k=17, k=18] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=41, j=42, k=18, k=18] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=41, j=42, k=18, k=18] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=41, j=42, k=18, k=18] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=43, j=42, k=18, k=18] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=43, j=42, k=18, k=19] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=43, j=44, k=18, k=19] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=43, j=44, k=19, k=19] [L716] 0 int condI = i >= (2*20 +6); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, i=43, id1=-2, id2=-1, j=44, k=19, k=19] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=43, j=44, k=19, k=19] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=45, j=44, k=19, k=19] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=45, j=44, k=19, k=19] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=45, j=46, k=19, k=19] [L719] 0 int condJ = j >= (2*20 +6); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, condJ=1, i=45, id1=-2, id2=-1, j=46, k=19, k=19] [L721] COND TRUE 0 condI || condJ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, condJ=1, i=45, id1=-2, id2=-1, j=46, k=19, k=19] [L722] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, condJ=1, i=45, id1=-2, id2=-1, j=46, k=19, k=19] - UnprovableResult [Line: 714]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 713]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 34 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 60.3s, OverallIterations: 16, TraceHistogramMax: 20, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 51.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7067 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7042 mSDsluCounter, 466 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 457 mSDsCounter, 403 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6711 IncrementalHoareTripleChecker+Invalid, 7114 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 403 mSolverCounterUnsat, 9 mSDtfsCounter, 6711 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1397 GetRequests, 678 SyntacticMatches, 31 SemanticMatches, 688 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19065 ImplicationChecksByTransitivity, 8.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13503occurred in iteration=15, InterpolantAutomatonStates: 517, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 1014 NumberOfCodeBlocks, 1014 NumberOfCodeBlocksAsserted, 60 NumberOfCheckSat, 1254 ConstructedInterpolants, 0 QuantifiedInterpolants, 4917 SizeOfPredicates, 111 NumberOfNonLiveVariables, 1201 ConjunctsInSsa, 157 ConjunctsInUnsatCore, 33 InterpolantComputations, 6 PerfectInterpolantSequences, 37/3510 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-01-09 16:23:08,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE