./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/chl-array-int-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-array-int-trans.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5bb11505151393f96d52a572beff0352326876d897656a8082ae272a8f39e0b4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 01:11:44,290 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 01:11:44,334 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-08 01:11:44,338 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 01:11:44,338 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 01:11:44,358 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 01:11:44,358 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 01:11:44,359 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 01:11:44,359 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 01:11:44,359 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 01:11:44,359 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 01:11:44,359 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 01:11:44,359 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 01:11:44,359 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 01:11:44,359 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 01:11:44,360 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 01:11:44,360 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 01:11:44,360 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 01:11:44,360 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 01:11:44,360 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 01:11:44,360 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 01:11:44,360 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 01:11:44,360 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 01:11:44,360 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 01:11:44,360 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 01:11:44,361 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 01:11:44,361 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 01:11:44,361 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 01:11:44,361 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 01:11:44,361 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 01:11:44,361 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 01:11:44,361 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 01:11:44,361 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:11:44,361 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 01:11:44,361 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 01:11:44,361 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 01:11:44,362 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 01:11:44,362 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 01:11:44,362 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 01:11:44,362 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 01:11:44,362 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 01:11:44,362 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 01:11:44,362 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 01:11:44,362 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 -> 5bb11505151393f96d52a572beff0352326876d897656a8082ae272a8f39e0b4 [2025-02-08 01:11:44,631 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 01:11:44,641 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 01:11:44,646 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 01:11:44,646 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 01:11:44,646 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 01:11:44,647 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-array-int-trans.wvr.c [2025-02-08 01:11:45,796 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bf3faee5c/8cc462d076af46d4911b97d87a4dda71/FLAG652dc83bb [2025-02-08 01:11:46,040 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 01:11:46,041 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-array-int-trans.wvr.c [2025-02-08 01:11:46,061 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bf3faee5c/8cc462d076af46d4911b97d87a4dda71/FLAG652dc83bb [2025-02-08 01:11:46,089 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bf3faee5c/8cc462d076af46d4911b97d87a4dda71 [2025-02-08 01:11:46,090 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 01:11:46,092 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 01:11:46,093 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 01:11:46,093 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 01:11:46,096 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 01:11:46,097 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:11:46" (1/1) ... [2025-02-08 01:11:46,098 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@378fba94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:11:46, skipping insertion in model container [2025-02-08 01:11:46,099 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:11:46" (1/1) ... [2025-02-08 01:11:46,111 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 01:11:46,229 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-array-int-trans.wvr.c[2767,2780] [2025-02-08 01:11:46,238 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:11:46,245 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 01:11:46,267 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-array-int-trans.wvr.c[2767,2780] [2025-02-08 01:11:46,274 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:11:46,286 INFO L204 MainTranslator]: Completed translation [2025-02-08 01:11:46,287 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:11:46 WrapperNode [2025-02-08 01:11:46,287 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 01:11:46,288 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 01:11:46,288 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 01:11:46,288 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 01:11:46,292 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:11:46" (1/1) ... [2025-02-08 01:11:46,297 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:11:46" (1/1) ... [2025-02-08 01:11:46,319 INFO L138 Inliner]: procedures = 25, calls = 34, calls flagged for inlining = 13, calls inlined = 21, statements flattened = 252 [2025-02-08 01:11:46,321 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 01:11:46,322 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 01:11:46,322 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 01:11:46,322 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 01:11:46,327 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:11:46" (1/1) ... [2025-02-08 01:11:46,327 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:11:46" (1/1) ... [2025-02-08 01:11:46,333 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:11:46" (1/1) ... [2025-02-08 01:11:46,349 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [2, 15]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-02-08 01:11:46,350 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:11:46" (1/1) ... [2025-02-08 01:11:46,350 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:11:46" (1/1) ... [2025-02-08 01:11:46,358 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:11:46" (1/1) ... [2025-02-08 01:11:46,358 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:11:46" (1/1) ... [2025-02-08 01:11:46,359 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:11:46" (1/1) ... [2025-02-08 01:11:46,363 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:11:46" (1/1) ... [2025-02-08 01:11:46,365 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 01:11:46,365 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 01:11:46,365 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 01:11:46,365 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 01:11:46,366 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:11:46" (1/1) ... [2025-02-08 01:11:46,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:11:46,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:11:46,391 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 01:11:46,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 01:11:46,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 01:11:46,414 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 01:11:46,414 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 01:11:46,414 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 01:11:46,414 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 01:11:46,414 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 01:11:46,414 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 01:11:46,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 01:11:46,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 01:11:46,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 01:11:46,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 01:11:46,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 01:11:46,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 01:11:46,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 01:11:46,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 01:11:46,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 01:11:46,416 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 01:11:46,508 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 01:11:46,509 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 01:11:46,633 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52: havoc #t~ret5#1; [2025-02-08 01:11:46,634 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-1: havoc #t~mem4#1; [2025-02-08 01:11:46,634 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-2: havoc #t~mem3#1; [2025-02-08 01:11:46,634 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-3: ~res1~0 := #t~ret5#1; [2025-02-08 01:11:46,634 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-4: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647; [2025-02-08 01:11:46,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-5: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 01:11:46,638 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-6: havoc minus_~a#1, minus_~b#1; [2025-02-08 01:11:46,639 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-7: #t~ret5#1 := minus_#res#1; [2025-02-08 01:11:46,705 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66: havoc #t~ret11#1; [2025-02-08 01:11:46,706 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-1: havoc #t~mem10#1; [2025-02-08 01:11:46,706 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-2: havoc #t~mem9#1; [2025-02-08 01:11:46,706 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-3: ~res2~0 := #t~ret11#1; [2025-02-08 01:11:46,706 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-4: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret11#1 && #t~ret11#1 <= 2147483647; [2025-02-08 01:11:46,706 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-5: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 01:11:46,706 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-6: havoc minus_~a#1, minus_~b#1; [2025-02-08 01:11:46,706 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-7: #t~ret11#1 := minus_#res#1; [2025-02-08 01:11:46,741 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L80: havoc #t~ret17#1; [2025-02-08 01:11:46,741 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L80-1: havoc #t~mem16#1; [2025-02-08 01:11:46,741 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L80-2: havoc #t~mem15#1; [2025-02-08 01:11:46,741 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L80-3: ~res3~0 := #t~ret17#1; [2025-02-08 01:11:46,741 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L80-4: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret17#1 && #t~ret17#1 <= 2147483647; [2025-02-08 01:11:46,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L80-5: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 01:11:46,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L80-6: havoc minus_~a#1, minus_~b#1; [2025-02-08 01:11:46,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L80-7: #t~ret17#1 := minus_#res#1; [2025-02-08 01:11:46,854 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 01:11:46,854 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 01:11:47,049 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 01:11:47,049 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 01:11:47,050 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:11:47 BoogieIcfgContainer [2025-02-08 01:11:47,050 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 01:11:47,051 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 01:11:47,051 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 01:11:47,055 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 01:11:47,055 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:11:46" (1/3) ... [2025-02-08 01:11:47,055 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38bb4597 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:11:47, skipping insertion in model container [2025-02-08 01:11:47,055 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:11:46" (2/3) ... [2025-02-08 01:11:47,055 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38bb4597 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:11:47, skipping insertion in model container [2025-02-08 01:11:47,055 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:11:47" (3/3) ... [2025-02-08 01:11:47,056 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-array-int-trans.wvr.c [2025-02-08 01:11:47,067 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 01:11:47,068 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-array-int-trans.wvr.c that has 4 procedures, 32 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-02-08 01:11:47,068 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 01:11:47,107 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 01:11:47,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 37 transitions, 95 flow [2025-02-08 01:11:47,149 INFO L124 PetriNetUnfolderBase]: 6/34 cut-off events. [2025-02-08 01:11:47,150 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 01:11:47,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 34 events. 6/34 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 38 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2025-02-08 01:11:47,155 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 37 transitions, 95 flow [2025-02-08 01:11:47,157 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 33 transitions, 84 flow [2025-02-08 01:11:47,165 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 01:11:47,174 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;@1fbc1e3b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 01:11:47,174 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-02-08 01:11:47,189 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 01:11:47,189 INFO L124 PetriNetUnfolderBase]: 6/32 cut-off events. [2025-02-08 01:11:47,189 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 01:11:47,189 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:11:47,189 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:11:47,190 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:11:47,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:11:47,194 INFO L85 PathProgramCache]: Analyzing trace with hash 305553970, now seen corresponding path program 1 times [2025-02-08 01:11:47,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:11:47,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269913483] [2025-02-08 01:11:47,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:11:47,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:11:47,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 01:11:47,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 01:11:47,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:11:47,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:11:47,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:11:47,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:11:47,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269913483] [2025-02-08 01:11:47,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269913483] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:11:47,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:11:47,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 01:11:47,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205005350] [2025-02-08 01:11:47,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:11:47,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 01:11:47,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:11:47,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 01:11:47,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 01:11:47,735 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:11:47,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 33 transitions, 84 flow. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:11:47,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:11:47,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:11:47,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:11:48,222 INFO L124 PetriNetUnfolderBase]: 2096/3008 cut-off events. [2025-02-08 01:11:48,222 INFO L125 PetriNetUnfolderBase]: For 240/240 co-relation queries the response was YES. [2025-02-08 01:11:48,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6263 conditions, 3008 events. 2096/3008 cut-off events. For 240/240 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 14337 event pairs, 172 based on Foata normal form. 1/1995 useless extension candidates. Maximal degree in co-relation 3759. Up to 1114 conditions per place. [2025-02-08 01:11:48,232 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 77 selfloop transitions, 8 changer transitions 33/119 dead transitions. [2025-02-08 01:11:48,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 119 transitions, 537 flow [2025-02-08 01:11:48,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 01:11:48,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 01:11:48,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 155 transitions. [2025-02-08 01:11:48,241 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46546546546546547 [2025-02-08 01:11:48,242 INFO L175 Difference]: Start difference. First operand has 37 places, 33 transitions, 84 flow. Second operand 9 states and 155 transitions. [2025-02-08 01:11:48,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 119 transitions, 537 flow [2025-02-08 01:11:48,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 119 transitions, 495 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 01:11:48,250 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 113 flow [2025-02-08 01:11:48,251 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=113, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2025-02-08 01:11:48,254 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 5 predicate places. [2025-02-08 01:11:48,254 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 113 flow [2025-02-08 01:11:48,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:11:48,254 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:11:48,254 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:11:48,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 01:11:48,254 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:11:48,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:11:48,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1140161692, now seen corresponding path program 2 times [2025-02-08 01:11:48,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:11:48,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357700786] [2025-02-08 01:11:48,255 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:11:48,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:11:48,265 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 1 equivalence classes. [2025-02-08 01:11:48,277 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 01:11:48,277 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:11:48,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:11:48,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:11:48,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:11:48,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357700786] [2025-02-08 01:11:48,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357700786] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:11:48,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:11:48,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 01:11:48,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769898961] [2025-02-08 01:11:48,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:11:48,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 01:11:48,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:11:48,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 01:11:48,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 01:11:48,447 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:11:48,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 113 flow. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:11:48,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:11:48,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:11:48,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:11:48,699 INFO L124 PetriNetUnfolderBase]: 765/1113 cut-off events. [2025-02-08 01:11:48,699 INFO L125 PetriNetUnfolderBase]: For 105/105 co-relation queries the response was YES. [2025-02-08 01:11:48,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2404 conditions, 1113 events. 765/1113 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4365 event pairs, 78 based on Foata normal form. 1/884 useless extension candidates. Maximal degree in co-relation 2394. Up to 603 conditions per place. [2025-02-08 01:11:48,704 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 37 selfloop transitions, 4 changer transitions 43/85 dead transitions. [2025-02-08 01:11:48,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 85 transitions, 387 flow [2025-02-08 01:11:48,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:11:48,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:11:48,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 117 transitions. [2025-02-08 01:11:48,705 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3952702702702703 [2025-02-08 01:11:48,705 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 113 flow. Second operand 8 states and 117 transitions. [2025-02-08 01:11:48,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 85 transitions, 387 flow [2025-02-08 01:11:48,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 85 transitions, 383 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-02-08 01:11:48,707 INFO L231 Difference]: Finished difference. Result has 45 places, 33 transitions, 100 flow [2025-02-08 01:11:48,707 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=100, PETRI_PLACES=45, PETRI_TRANSITIONS=33} [2025-02-08 01:11:48,708 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 8 predicate places. [2025-02-08 01:11:48,708 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 33 transitions, 100 flow [2025-02-08 01:11:48,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:11:48,708 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:11:48,708 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:11:48,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 01:11:48,708 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:11:48,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:11:48,709 INFO L85 PathProgramCache]: Analyzing trace with hash -25472085, now seen corresponding path program 1 times [2025-02-08 01:11:48,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:11:48,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940432253] [2025-02-08 01:11:48,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:11:48,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:11:48,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 01:11:48,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 01:11:48,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:11:48,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:11:48,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:11:48,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:11:48,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940432253] [2025-02-08 01:11:48,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940432253] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:11:48,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754397241] [2025-02-08 01:11:48,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:11:48,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:11:48,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:11:48,911 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:11:48,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 01:11:48,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 01:11:48,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 01:11:48,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:11:48,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:11:48,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-08 01:11:48,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:11:49,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:11:49,134 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:11:49,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:11:49,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754397241] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-08 01:11:49,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-08 01:11:49,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 15 [2025-02-08 01:11:49,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883618392] [2025-02-08 01:11:49,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:11:49,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 01:11:49,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:11:49,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 01:11:49,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2025-02-08 01:11:49,228 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:11:49,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 100 flow. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:11:49,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:11:49,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:11:49,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:11:49,400 INFO L124 PetriNetUnfolderBase]: 861/1248 cut-off events. [2025-02-08 01:11:49,400 INFO L125 PetriNetUnfolderBase]: For 267/267 co-relation queries the response was YES. [2025-02-08 01:11:49,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2768 conditions, 1248 events. 861/1248 cut-off events. For 267/267 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 4539 event pairs, 354 based on Foata normal form. 1/1000 useless extension candidates. Maximal degree in co-relation 2757. Up to 626 conditions per place. [2025-02-08 01:11:49,404 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 29 selfloop transitions, 4 changer transitions 37/71 dead transitions. [2025-02-08 01:11:49,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 71 transitions, 348 flow [2025-02-08 01:11:49,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 01:11:49,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 01:11:49,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 93 transitions. [2025-02-08 01:11:49,405 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3590733590733591 [2025-02-08 01:11:49,405 INFO L175 Difference]: Start difference. First operand has 45 places, 33 transitions, 100 flow. Second operand 7 states and 93 transitions. [2025-02-08 01:11:49,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 71 transitions, 348 flow [2025-02-08 01:11:49,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 71 transitions, 328 flow, removed 2 selfloop flow, removed 5 redundant places. [2025-02-08 01:11:49,406 INFO L231 Difference]: Finished difference. Result has 41 places, 34 transitions, 108 flow [2025-02-08 01:11:49,406 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=108, PETRI_PLACES=41, PETRI_TRANSITIONS=34} [2025-02-08 01:11:49,407 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 4 predicate places. [2025-02-08 01:11:49,407 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 108 flow [2025-02-08 01:11:49,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:11:49,407 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:11:49,407 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:11:49,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 01:11:49,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:11:49,611 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:11:49,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:11:49,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1985488288, now seen corresponding path program 1 times [2025-02-08 01:11:49,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:11:49,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093748936] [2025-02-08 01:11:49,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:11:49,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:11:49,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 01:11:49,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 01:11:49,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:11:49,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:11:49,713 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:11:49,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:11:49,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093748936] [2025-02-08 01:11:49,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093748936] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:11:49,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1368781050] [2025-02-08 01:11:49,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:11:49,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:11:49,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:11:49,715 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:11:49,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 01:11:49,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 01:11:49,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 01:11:49,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:11:49,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:11:49,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-08 01:11:49,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:11:49,847 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:11:49,847 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:11:49,913 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:11:49,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1368781050] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-08 01:11:49,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-08 01:11:49,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 13 [2025-02-08 01:11:49,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949427348] [2025-02-08 01:11:49,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:11:49,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:11:49,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:11:49,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:11:49,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-02-08 01:11:49,914 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:11:49,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 108 flow. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:11:49,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:11:49,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:11:49,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:11:50,104 INFO L124 PetriNetUnfolderBase]: 862/1252 cut-off events. [2025-02-08 01:11:50,105 INFO L125 PetriNetUnfolderBase]: For 229/229 co-relation queries the response was YES. [2025-02-08 01:11:50,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2816 conditions, 1252 events. 862/1252 cut-off events. For 229/229 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 4712 event pairs, 324 based on Foata normal form. 1/1004 useless extension candidates. Maximal degree in co-relation 2804. Up to 621 conditions per place. [2025-02-08 01:11:50,110 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 40 selfloop transitions, 5 changer transitions 27/73 dead transitions. [2025-02-08 01:11:50,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 73 transitions, 360 flow [2025-02-08 01:11:50,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:11:50,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 01:11:50,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 92 transitions. [2025-02-08 01:11:50,113 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4144144144144144 [2025-02-08 01:11:50,113 INFO L175 Difference]: Start difference. First operand has 41 places, 34 transitions, 108 flow. Second operand 6 states and 92 transitions. [2025-02-08 01:11:50,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 73 transitions, 360 flow [2025-02-08 01:11:50,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 73 transitions, 340 flow, removed 6 selfloop flow, removed 5 redundant places. [2025-02-08 01:11:50,116 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 118 flow [2025-02-08 01:11:50,116 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=118, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2025-02-08 01:11:50,116 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 5 predicate places. [2025-02-08 01:11:50,117 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 118 flow [2025-02-08 01:11:50,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:11:50,117 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:11:50,117 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:11:50,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 01:11:50,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:11:50,321 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:11:50,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:11:50,321 INFO L85 PathProgramCache]: Analyzing trace with hash -981638786, now seen corresponding path program 1 times [2025-02-08 01:11:50,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:11:50,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339272228] [2025-02-08 01:11:50,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:11:50,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:11:50,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 01:11:50,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 01:11:50,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:11:50,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:11:50,450 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:11:50,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:11:50,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339272228] [2025-02-08 01:11:50,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339272228] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:11:50,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104694604] [2025-02-08 01:11:50,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:11:50,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:11:50,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:11:50,452 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:11:50,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 01:11:50,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 01:11:50,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 01:11:50,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:11:50,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:11:50,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-08 01:11:50,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:11:50,629 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:11:50,630 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:11:50,730 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:11:50,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1104694604] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:11:50,731 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:11:50,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 16 [2025-02-08 01:11:50,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746261165] [2025-02-08 01:11:50,731 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:11:50,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-08 01:11:50,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:11:50,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-08 01:11:50,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2025-02-08 01:11:50,733 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:11:50,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 118 flow. Second operand has 16 states, 16 states have (on average 7.4375) internal successors, (119), 16 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:11:50,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:11:50,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:11:50,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:11:51,263 INFO L124 PetriNetUnfolderBase]: 1724/2504 cut-off events. [2025-02-08 01:11:51,263 INFO L125 PetriNetUnfolderBase]: For 660/660 co-relation queries the response was YES. [2025-02-08 01:11:51,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5660 conditions, 2504 events. 1724/2504 cut-off events. For 660/660 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 11107 event pairs, 438 based on Foata normal form. 3/2010 useless extension candidates. Maximal degree in co-relation 5647. Up to 622 conditions per place. [2025-02-08 01:11:51,269 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 56 selfloop transitions, 10 changer transitions 110/177 dead transitions. [2025-02-08 01:11:51,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 177 transitions, 867 flow [2025-02-08 01:11:51,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-08 01:11:51,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-02-08 01:11:51,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 253 transitions. [2025-02-08 01:11:51,270 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3418918918918919 [2025-02-08 01:11:51,270 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 118 flow. Second operand 20 states and 253 transitions. [2025-02-08 01:11:51,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 177 transitions, 867 flow [2025-02-08 01:11:51,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 177 transitions, 831 flow, removed 7 selfloop flow, removed 4 redundant places. [2025-02-08 01:11:51,277 INFO L231 Difference]: Finished difference. Result has 65 places, 37 transitions, 162 flow [2025-02-08 01:11:51,277 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=162, PETRI_PLACES=65, PETRI_TRANSITIONS=37} [2025-02-08 01:11:51,277 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 28 predicate places. [2025-02-08 01:11:51,277 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 37 transitions, 162 flow [2025-02-08 01:11:51,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.4375) internal successors, (119), 16 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:11:51,278 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:11:51,278 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:11:51,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 01:11:51,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:11:51,479 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:11:51,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:11:51,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1796401041, now seen corresponding path program 2 times [2025-02-08 01:11:51,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:11:51,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135579931] [2025-02-08 01:11:51,480 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:11:51,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:11:51,488 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-02-08 01:11:51,492 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 26 statements. [2025-02-08 01:11:51,492 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:11:51,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:11:51,535 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-08 01:11:51,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:11:51,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135579931] [2025-02-08 01:11:51,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135579931] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:11:51,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:11:51,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 01:11:51,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580680081] [2025-02-08 01:11:51,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:11:51,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:11:51,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:11:51,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:11:51,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:11:51,537 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:11:51,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 37 transitions, 162 flow. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:11:51,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:11:51,537 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:11:51,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:11:51,692 INFO L124 PetriNetUnfolderBase]: 795/1152 cut-off events. [2025-02-08 01:11:51,692 INFO L125 PetriNetUnfolderBase]: For 316/316 co-relation queries the response was YES. [2025-02-08 01:11:51,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2590 conditions, 1152 events. 795/1152 cut-off events. For 316/316 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4167 event pairs, 27 based on Foata normal form. 1/894 useless extension candidates. Maximal degree in co-relation 2561. Up to 393 conditions per place. [2025-02-08 01:11:51,695 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 62 selfloop transitions, 6 changer transitions 15/84 dead transitions. [2025-02-08 01:11:51,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 84 transitions, 458 flow [2025-02-08 01:11:51,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:11:51,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 01:11:51,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2025-02-08 01:11:51,696 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45495495495495497 [2025-02-08 01:11:51,696 INFO L175 Difference]: Start difference. First operand has 65 places, 37 transitions, 162 flow. Second operand 6 states and 101 transitions. [2025-02-08 01:11:51,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 84 transitions, 458 flow [2025-02-08 01:11:51,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 84 transitions, 394 flow, removed 22 selfloop flow, removed 13 redundant places. [2025-02-08 01:11:51,698 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 154 flow [2025-02-08 01:11:51,698 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=154, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2025-02-08 01:11:51,699 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 13 predicate places. [2025-02-08 01:11:51,699 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 154 flow [2025-02-08 01:11:51,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:11:51,699 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:11:51,699 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:11:51,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 01:11:51,699 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:11:51,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:11:51,700 INFO L85 PathProgramCache]: Analyzing trace with hash 815830491, now seen corresponding path program 3 times [2025-02-08 01:11:51,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:11:51,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024575427] [2025-02-08 01:11:51,700 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:11:51,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:11:51,707 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-02-08 01:11:51,711 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 21 of 26 statements. [2025-02-08 01:11:51,711 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 01:11:51,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:11:51,790 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-08 01:11:51,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:11:51,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024575427] [2025-02-08 01:11:51,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024575427] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:11:51,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:11:51,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 01:11:51,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816749179] [2025-02-08 01:11:51,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:11:51,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:11:51,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:11:51,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:11:51,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:11:51,792 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:11:51,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 154 flow. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:11:51,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:11:51,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:11:51,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:11:51,962 INFO L124 PetriNetUnfolderBase]: 982/1427 cut-off events. [2025-02-08 01:11:51,963 INFO L125 PetriNetUnfolderBase]: For 451/451 co-relation queries the response was YES. [2025-02-08 01:11:51,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3098 conditions, 1427 events. 982/1427 cut-off events. For 451/451 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 5733 event pairs, 75 based on Foata normal form. 1/1096 useless extension candidates. Maximal degree in co-relation 3074. Up to 704 conditions per place. [2025-02-08 01:11:51,967 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 61 selfloop transitions, 7 changer transitions 16/85 dead transitions. [2025-02-08 01:11:51,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 85 transitions, 430 flow [2025-02-08 01:11:51,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:11:51,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 01:11:51,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 103 transitions. [2025-02-08 01:11:51,967 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46396396396396394 [2025-02-08 01:11:51,967 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 154 flow. Second operand 6 states and 103 transitions. [2025-02-08 01:11:51,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 85 transitions, 430 flow [2025-02-08 01:11:51,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 85 transitions, 423 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-02-08 01:11:51,969 INFO L231 Difference]: Finished difference. Result has 54 places, 40 transitions, 168 flow [2025-02-08 01:11:51,969 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=168, PETRI_PLACES=54, PETRI_TRANSITIONS=40} [2025-02-08 01:11:51,970 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 17 predicate places. [2025-02-08 01:11:51,970 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 40 transitions, 168 flow [2025-02-08 01:11:51,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:11:51,970 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:11:51,970 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:11:51,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 01:11:51,970 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:11:51,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:11:51,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1739338913, now seen corresponding path program 4 times [2025-02-08 01:11:51,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:11:51,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421187534] [2025-02-08 01:11:51,971 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 01:11:51,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:11:51,977 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-02-08 01:11:51,979 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 18 of 26 statements. [2025-02-08 01:11:51,979 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-08 01:11:51,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:11:52,007 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-08 01:11:52,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:11:52,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421187534] [2025-02-08 01:11:52,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421187534] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:11:52,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:11:52,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 01:11:52,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555251131] [2025-02-08 01:11:52,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:11:52,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:11:52,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:11:52,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:11:52,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:11:52,008 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:11:52,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 40 transitions, 168 flow. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:11:52,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:11:52,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:11:52,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:11:52,154 INFO L124 PetriNetUnfolderBase]: 804/1180 cut-off events. [2025-02-08 01:11:52,155 INFO L125 PetriNetUnfolderBase]: For 597/597 co-relation queries the response was YES. [2025-02-08 01:11:52,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2661 conditions, 1180 events. 804/1180 cut-off events. For 597/597 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4563 event pairs, 39 based on Foata normal form. 1/910 useless extension candidates. Maximal degree in co-relation 2640. Up to 519 conditions per place. [2025-02-08 01:11:52,158 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 58 selfloop transitions, 6 changer transitions 18/83 dead transitions. [2025-02-08 01:11:52,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 83 transitions, 438 flow [2025-02-08 01:11:52,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:11:52,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 01:11:52,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2025-02-08 01:11:52,158 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45495495495495497 [2025-02-08 01:11:52,158 INFO L175 Difference]: Start difference. First operand has 54 places, 40 transitions, 168 flow. Second operand 6 states and 101 transitions. [2025-02-08 01:11:52,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 83 transitions, 438 flow [2025-02-08 01:11:52,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 83 transitions, 420 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-02-08 01:11:52,160 INFO L231 Difference]: Finished difference. Result has 56 places, 39 transitions, 167 flow [2025-02-08 01:11:52,160 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=167, PETRI_PLACES=56, PETRI_TRANSITIONS=39} [2025-02-08 01:11:52,160 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 19 predicate places. [2025-02-08 01:11:52,161 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 39 transitions, 167 flow [2025-02-08 01:11:52,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:11:52,161 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:11:52,161 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:11:52,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 01:11:52,161 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:11:52,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:11:52,161 INFO L85 PathProgramCache]: Analyzing trace with hash 2117304859, now seen corresponding path program 5 times [2025-02-08 01:11:52,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:11:52,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064486214] [2025-02-08 01:11:52,161 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 01:11:52,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:11:52,168 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-02-08 01:11:52,174 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 01:11:52,175 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:11:52,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:11:52,228 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-08 01:11:52,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:11:52,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064486214] [2025-02-08 01:11:52,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064486214] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:11:52,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:11:52,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 01:11:52,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255257180] [2025-02-08 01:11:52,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:11:52,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:11:52,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:11:52,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:11:52,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:11:52,229 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:11:52,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 39 transitions, 167 flow. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:11:52,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:11:52,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:11:52,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:11:52,345 INFO L124 PetriNetUnfolderBase]: 490/717 cut-off events. [2025-02-08 01:11:52,345 INFO L125 PetriNetUnfolderBase]: For 524/524 co-relation queries the response was YES. [2025-02-08 01:11:52,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1699 conditions, 717 events. 490/717 cut-off events. For 524/524 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2428 event pairs, 12 based on Foata normal form. 1/552 useless extension candidates. Maximal degree in co-relation 1681. Up to 360 conditions per place. [2025-02-08 01:11:52,347 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 45 selfloop transitions, 5 changer transitions 17/68 dead transitions. [2025-02-08 01:11:52,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 68 transitions, 364 flow [2025-02-08 01:11:52,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:11:52,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 01:11:52,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 86 transitions. [2025-02-08 01:11:52,348 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38738738738738737 [2025-02-08 01:11:52,348 INFO L175 Difference]: Start difference. First operand has 56 places, 39 transitions, 167 flow. Second operand 6 states and 86 transitions. [2025-02-08 01:11:52,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 68 transitions, 364 flow [2025-02-08 01:11:52,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 68 transitions, 347 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-02-08 01:11:52,350 INFO L231 Difference]: Finished difference. Result has 54 places, 37 transitions, 148 flow [2025-02-08 01:11:52,350 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=148, PETRI_PLACES=54, PETRI_TRANSITIONS=37} [2025-02-08 01:11:52,350 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 17 predicate places. [2025-02-08 01:11:52,350 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 37 transitions, 148 flow [2025-02-08 01:11:52,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:11:52,351 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:11:52,351 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:11:52,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 01:11:52,351 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:11:52,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:11:52,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1944236699, now seen corresponding path program 6 times [2025-02-08 01:11:52,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:11:52,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488188947] [2025-02-08 01:11:52,351 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 01:11:52,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:11:52,359 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 2 equivalence classes. [2025-02-08 01:11:52,362 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 21 of 26 statements. [2025-02-08 01:11:52,362 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-08 01:11:52,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:11:52,434 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-08 01:11:52,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:11:52,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488188947] [2025-02-08 01:11:52,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488188947] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:11:52,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:11:52,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 01:11:52,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456432387] [2025-02-08 01:11:52,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:11:52,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:11:52,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:11:52,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:11:52,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:11:52,436 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:11:52,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 37 transitions, 148 flow. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:11:52,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:11:52,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:11:52,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:11:52,564 INFO L124 PetriNetUnfolderBase]: 435/640 cut-off events. [2025-02-08 01:11:52,564 INFO L125 PetriNetUnfolderBase]: For 250/250 co-relation queries the response was YES. [2025-02-08 01:11:52,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1512 conditions, 640 events. 435/640 cut-off events. For 250/250 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2032 event pairs, 42 based on Foata normal form. 1/488 useless extension candidates. Maximal degree in co-relation 1495. Up to 318 conditions per place. [2025-02-08 01:11:52,566 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 36 selfloop transitions, 3 changer transitions 25/65 dead transitions. [2025-02-08 01:11:52,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 65 transitions, 343 flow [2025-02-08 01:11:52,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:11:52,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 01:11:52,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2025-02-08 01:11:52,567 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3783783783783784 [2025-02-08 01:11:52,567 INFO L175 Difference]: Start difference. First operand has 54 places, 37 transitions, 148 flow. Second operand 6 states and 84 transitions. [2025-02-08 01:11:52,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 65 transitions, 343 flow [2025-02-08 01:11:52,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 65 transitions, 321 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-02-08 01:11:52,569 INFO L231 Difference]: Finished difference. Result has 53 places, 35 transitions, 129 flow [2025-02-08 01:11:52,569 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=129, PETRI_PLACES=53, PETRI_TRANSITIONS=35} [2025-02-08 01:11:52,569 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 16 predicate places. [2025-02-08 01:11:52,569 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 35 transitions, 129 flow [2025-02-08 01:11:52,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:11:52,570 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:11:52,570 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:11:52,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 01:11:52,570 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:11:52,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:11:52,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1465575845, now seen corresponding path program 7 times [2025-02-08 01:11:52,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:11:52,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754060692] [2025-02-08 01:11:52,571 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 01:11:52,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:11:52,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 01:11:52,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 01:11:52,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:11:52,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:11:52,753 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:11:52,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:11:52,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754060692] [2025-02-08 01:11:52,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754060692] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:11:52,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [892783813] [2025-02-08 01:11:52,754 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 01:11:52,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:11:52,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:11:52,756 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:11:52,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 01:11:52,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 01:11:52,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 01:11:52,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:11:52,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:11:52,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-08 01:11:52,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:11:52,957 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 01:11:52,957 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:11:53,072 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 01:11:53,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [892783813] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:11:53,072 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:11:53,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 22 [2025-02-08 01:11:53,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71254957] [2025-02-08 01:11:53,072 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:11:53,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-08 01:11:53,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:11:53,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-08 01:11:53,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2025-02-08 01:11:53,074 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:11:53,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 35 transitions, 129 flow. Second operand has 23 states, 23 states have (on average 6.695652173913044) internal successors, (154), 23 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:11:53,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:11:53,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:11:53,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:11:53,596 INFO L124 PetriNetUnfolderBase]: 852/1259 cut-off events. [2025-02-08 01:11:53,597 INFO L125 PetriNetUnfolderBase]: For 296/296 co-relation queries the response was YES. [2025-02-08 01:11:53,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2927 conditions, 1259 events. 852/1259 cut-off events. For 296/296 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 4697 event pairs, 280 based on Foata normal form. 3/958 useless extension candidates. Maximal degree in co-relation 2911. Up to 304 conditions per place. [2025-02-08 01:11:53,601 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 26 selfloop transitions, 11 changer transitions 81/119 dead transitions. [2025-02-08 01:11:53,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 119 transitions, 618 flow [2025-02-08 01:11:53,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-08 01:11:53,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-02-08 01:11:53,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 213 transitions. [2025-02-08 01:11:53,602 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2502937720329025 [2025-02-08 01:11:53,602 INFO L175 Difference]: Start difference. First operand has 53 places, 35 transitions, 129 flow. Second operand 23 states and 213 transitions. [2025-02-08 01:11:53,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 119 transitions, 618 flow [2025-02-08 01:11:53,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 119 transitions, 580 flow, removed 5 selfloop flow, removed 7 redundant places. [2025-02-08 01:11:53,605 INFO L231 Difference]: Finished difference. Result has 75 places, 37 transitions, 173 flow [2025-02-08 01:11:53,605 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=173, PETRI_PLACES=75, PETRI_TRANSITIONS=37} [2025-02-08 01:11:53,606 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 38 predicate places. [2025-02-08 01:11:53,606 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 37 transitions, 173 flow [2025-02-08 01:11:53,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 6.695652173913044) internal successors, (154), 23 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:11:53,606 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:11:53,606 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:11:53,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-08 01:11:53,806 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,SelfDestructingSolverStorable10 [2025-02-08 01:11:53,807 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:11:53,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:11:53,807 INFO L85 PathProgramCache]: Analyzing trace with hash 367699260, now seen corresponding path program 8 times [2025-02-08 01:11:53,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:11:53,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802578509] [2025-02-08 01:11:53,808 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:11:53,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:11:53,818 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-02-08 01:11:53,824 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 28 statements. [2025-02-08 01:11:53,825 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:11:53,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:11:53,886 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 01:11:53,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:11:53,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802578509] [2025-02-08 01:11:53,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802578509] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:11:53,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:11:53,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 01:11:53,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096407516] [2025-02-08 01:11:53,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:11:53,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:11:53,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:11:53,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:11:53,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:11:53,889 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:11:53,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 37 transitions, 173 flow. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:11:53,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:11:53,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:11:53,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:11:53,961 INFO L124 PetriNetUnfolderBase]: 215/323 cut-off events. [2025-02-08 01:11:53,962 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2025-02-08 01:11:53,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 785 conditions, 323 events. 215/323 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 854 event pairs, 0 based on Foata normal form. 1/249 useless extension candidates. Maximal degree in co-relation 767. Up to 241 conditions per place. [2025-02-08 01:11:53,962 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 0 selfloop transitions, 0 changer transitions 47/47 dead transitions. [2025-02-08 01:11:53,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 47 transitions, 281 flow [2025-02-08 01:11:53,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:11:53,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 01:11:53,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2025-02-08 01:11:53,964 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2927927927927928 [2025-02-08 01:11:53,964 INFO L175 Difference]: Start difference. First operand has 75 places, 37 transitions, 173 flow. Second operand 6 states and 65 transitions. [2025-02-08 01:11:53,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 47 transitions, 281 flow [2025-02-08 01:11:53,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 47 transitions, 246 flow, removed 10 selfloop flow, removed 11 redundant places. [2025-02-08 01:11:53,965 INFO L231 Difference]: Finished difference. Result has 56 places, 0 transitions, 0 flow [2025-02-08 01:11:53,965 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=56, PETRI_TRANSITIONS=0} [2025-02-08 01:11:53,966 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 19 predicate places. [2025-02-08 01:11:53,966 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 0 transitions, 0 flow [2025-02-08 01:11:53,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:11:53,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-02-08 01:11:53,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-02-08 01:11:53,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-02-08 01:11:53,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-02-08 01:11:53,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 01:11:53,969 INFO L422 BasicCegarLoop]: Path program histogram: [8, 2, 1, 1] [2025-02-08 01:11:53,971 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 01:11:53,972 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 01:11:53,975 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 01:11:53 BasicIcfg [2025-02-08 01:11:53,976 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 01:11:53,976 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 01:11:53,976 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 01:11:53,976 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 01:11:53,977 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:11:47" (3/4) ... [2025-02-08 01:11:53,978 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 01:11:53,980 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 01:11:53,980 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 01:11:53,980 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-02-08 01:11:53,984 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 108 nodes and edges [2025-02-08 01:11:53,984 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 50 nodes and edges [2025-02-08 01:11:53,984 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2025-02-08 01:11:53,985 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-08 01:11:54,052 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 01:11:54,052 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 01:11:54,052 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 01:11:54,053 INFO L158 Benchmark]: Toolchain (without parser) took 7961.17ms. Allocated memory was 142.6MB in the beginning and 411.0MB in the end (delta: 268.4MB). Free memory was 104.8MB in the beginning and 329.0MB in the end (delta: -224.2MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2025-02-08 01:11:54,053 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 226.5MB. Free memory is still 140.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 01:11:54,054 INFO L158 Benchmark]: CACSL2BoogieTranslator took 194.17ms. Allocated memory is still 142.6MB. Free memory was 104.8MB in the beginning and 92.0MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 01:11:54,055 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.14ms. Allocated memory is still 142.6MB. Free memory was 92.0MB in the beginning and 89.8MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 01:11:54,057 INFO L158 Benchmark]: Boogie Preprocessor took 43.12ms. Allocated memory is still 142.6MB. Free memory was 89.8MB in the beginning and 87.7MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 01:11:54,057 INFO L158 Benchmark]: IcfgBuilder took 684.70ms. Allocated memory is still 142.6MB. Free memory was 87.7MB in the beginning and 87.9MB in the end (delta: -242.9kB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. [2025-02-08 01:11:54,057 INFO L158 Benchmark]: TraceAbstraction took 6924.31ms. Allocated memory was 142.6MB in the beginning and 411.0MB in the end (delta: 268.4MB). Free memory was 87.2MB in the beginning and 333.2MB in the end (delta: -246.0MB). Peak memory consumption was 25.1MB. Max. memory is 16.1GB. [2025-02-08 01:11:54,057 INFO L158 Benchmark]: Witness Printer took 76.24ms. Allocated memory is still 411.0MB. Free memory was 333.2MB in the beginning and 329.0MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 01:11:54,058 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.13ms. Allocated memory is still 226.5MB. Free memory is still 140.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 194.17ms. Allocated memory is still 142.6MB. Free memory was 104.8MB in the beginning and 92.0MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.14ms. Allocated memory is still 142.6MB. Free memory was 92.0MB in the beginning and 89.8MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.12ms. Allocated memory is still 142.6MB. Free memory was 89.8MB in the beginning and 87.7MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 684.70ms. Allocated memory is still 142.6MB. Free memory was 87.7MB in the beginning and 87.9MB in the end (delta: -242.9kB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. * TraceAbstraction took 6924.31ms. Allocated memory was 142.6MB in the beginning and 411.0MB in the end (delta: 268.4MB). Free memory was 87.2MB in the beginning and 333.2MB in the end (delta: -246.0MB). Peak memory consumption was 25.1MB. Max. memory is 16.1GB. * Witness Printer took 76.24ms. Allocated memory is still 411.0MB. Free memory was 333.2MB in the beginning and 329.0MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 108]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 50 locations, 4 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: 6.8s, OverallIterations: 12, TraceHistogramMax: 3, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1402 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1402 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2301 IncrementalHoareTripleChecker+Invalid, 2332 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 0 mSDtfsCounter, 2301 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 330 GetRequests, 172 SyntacticMatches, 5 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 529 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=173occurred in iteration=11, InterpolantAutomatonStates: 109, 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.2s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 390 NumberOfCodeBlocks, 360 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 465 ConstructedInterpolants, 0 QuantifiedInterpolants, 1753 SizeOfPredicates, 32 NumberOfNonLiveVariables, 1011 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 20 InterpolantComputations, 10 PerfectInterpolantSequences, 67/86 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 01:11:54,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE