./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/chl-nzb-file-subst.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-nzb-file-subst.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 47976145f2a7f206dd7d2e7a0ffeac879f94f33f7a5b87161ebd997173567eb0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 01:13:01,741 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 01:13:01,814 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:13:01,822 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 01:13:01,824 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 01:13:01,846 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 01:13:01,847 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 01:13:01,847 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 01:13:01,847 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 01:13:01,847 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 01:13:01,848 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 01:13:01,848 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 01:13:01,848 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 01:13:01,848 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 01:13:01,848 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 01:13:01,848 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 01:13:01,849 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 01:13:01,849 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 01:13:01,849 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 01:13:01,849 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 01:13:01,849 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 01:13:01,849 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 01:13:01,849 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 01:13:01,849 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 01:13:01,850 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 01:13:01,850 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 01:13:01,850 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 01:13:01,850 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 01:13:01,850 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 01:13:01,850 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 01:13:01,850 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 01:13:01,850 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 01:13:01,850 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:13:01,850 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 01:13:01,850 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 01:13:01,850 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 01:13:01,851 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 01:13:01,851 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 01:13:01,851 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 01:13:01,851 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 01:13:01,851 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 01:13:01,851 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 01:13:01,852 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 01:13:01,852 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 -> 47976145f2a7f206dd7d2e7a0ffeac879f94f33f7a5b87161ebd997173567eb0 [2025-02-08 01:13:02,132 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 01:13:02,143 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 01:13:02,145 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 01:13:02,147 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 01:13:02,147 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 01:13:02,148 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-nzb-file-subst.wvr.c [2025-02-08 01:13:03,460 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eb021dfd7/aed1620a48624c32b7722dc01cd7c94e/FLAG8cb65d9ff [2025-02-08 01:13:03,735 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 01:13:03,736 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-nzb-file-subst.wvr.c [2025-02-08 01:13:03,746 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eb021dfd7/aed1620a48624c32b7722dc01cd7c94e/FLAG8cb65d9ff [2025-02-08 01:13:03,769 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eb021dfd7/aed1620a48624c32b7722dc01cd7c94e [2025-02-08 01:13:03,773 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 01:13:03,775 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 01:13:03,776 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 01:13:03,776 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 01:13:03,781 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 01:13:03,782 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:13:03" (1/1) ... [2025-02-08 01:13:03,782 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@568aa3a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:13:03, skipping insertion in model container [2025-02-08 01:13:03,785 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:13:03" (1/1) ... [2025-02-08 01:13:03,805 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 01:13:04,017 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-nzb-file-subst.wvr.c[6540,6553] [2025-02-08 01:13:04,030 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:13:04,045 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 01:13:04,101 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-nzb-file-subst.wvr.c[6540,6553] [2025-02-08 01:13:04,108 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:13:04,126 INFO L204 MainTranslator]: Completed translation [2025-02-08 01:13:04,126 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:13:04 WrapperNode [2025-02-08 01:13:04,126 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 01:13:04,128 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 01:13:04,128 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 01:13:04,128 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 01:13:04,134 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:13:04" (1/1) ... [2025-02-08 01:13:04,149 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:13:04" (1/1) ... [2025-02-08 01:13:04,202 INFO L138 Inliner]: procedures = 25, calls = 61, calls flagged for inlining = 28, calls inlined = 42, statements flattened = 591 [2025-02-08 01:13:04,203 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 01:13:04,204 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 01:13:04,204 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 01:13:04,204 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 01:13:04,212 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:13:04" (1/1) ... [2025-02-08 01:13:04,212 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:13:04" (1/1) ... [2025-02-08 01:13:04,217 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:13:04" (1/1) ... [2025-02-08 01:13:04,247 INFO L175 MemorySlicer]: Split 29 memory accesses to 2 slices as follows [2, 27]. 93 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:13:04,247 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:13:04" (1/1) ... [2025-02-08 01:13:04,247 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:13:04" (1/1) ... [2025-02-08 01:13:04,259 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:13:04" (1/1) ... [2025-02-08 01:13:04,261 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:13:04" (1/1) ... [2025-02-08 01:13:04,263 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:13:04" (1/1) ... [2025-02-08 01:13:04,264 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:13:04" (1/1) ... [2025-02-08 01:13:04,272 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 01:13:04,273 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 01:13:04,273 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 01:13:04,273 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 01:13:04,274 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:13:04" (1/1) ... [2025-02-08 01:13:04,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:13:04,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:13:04,307 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:13:04,314 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:13:04,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 01:13:04,337 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 01:13:04,337 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 01:13:04,337 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 01:13:04,337 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 01:13:04,338 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 01:13:04,338 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 01:13:04,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 01:13:04,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 01:13:04,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 01:13:04,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 01:13:04,339 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 01:13:04,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 01:13:04,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 01:13:04,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 01:13:04,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 01:13:04,341 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:13:04,488 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 01:13:04,491 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 01:13:04,781 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-5: #t~ite21#1 := #t~ret20#1; [2025-02-08 01:13:04,781 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-6: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret20#1 && #t~ret20#1 <= 2147483647; [2025-02-08 01:13:04,781 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-7: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 01:13:04,781 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-8: havoc minus_~a#1, minus_~b#1; [2025-02-08 01:13:04,781 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-9: #t~ret20#1 := minus_#res#1; [2025-02-08 01:13:04,781 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-3: #t~ite19#1 := #t~ret18#1; [2025-02-08 01:13:04,781 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-4: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret18#1 && #t~ret18#1 <= 2147483647; [2025-02-08 01:13:04,781 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-5: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 01:13:04,782 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-6: havoc minus_~a#1, minus_~b#1; [2025-02-08 01:13:04,782 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-7: #t~ret18#1 := minus_#res#1; [2025-02-08 01:13:04,978 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L96-5: #t~ite43#1 := #t~ret42#1; [2025-02-08 01:13:04,979 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L96-6: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret42#1 && #t~ret42#1 <= 2147483647; [2025-02-08 01:13:04,979 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L96-7: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 01:13:04,979 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L96-8: havoc minus_~a#1, minus_~b#1; [2025-02-08 01:13:04,979 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L96-9: #t~ret42#1 := minus_#res#1; [2025-02-08 01:13:04,979 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L92-3: #t~ite41#1 := #t~ret40#1; [2025-02-08 01:13:04,979 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L92-4: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret40#1 && #t~ret40#1 <= 2147483647; [2025-02-08 01:13:04,979 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L92-5: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 01:13:04,979 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L92-6: havoc minus_~a#1, minus_~b#1; [2025-02-08 01:13:04,979 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L92-7: #t~ret40#1 := minus_#res#1; [2025-02-08 01:13:05,136 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L119-3: #t~ite63#1 := #t~ret62#1; [2025-02-08 01:13:05,137 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L119-4: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret62#1 && #t~ret62#1 <= 2147483647; [2025-02-08 01:13:05,137 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L119-5: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 01:13:05,137 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L119-6: havoc minus_~a#1, minus_~b#1; [2025-02-08 01:13:05,137 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L119-7: #t~ret62#1 := minus_#res#1; [2025-02-08 01:13:05,137 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L123-5: #t~ite65#1 := #t~ret64#1; [2025-02-08 01:13:05,137 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L123-6: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret64#1 && #t~ret64#1 <= 2147483647; [2025-02-08 01:13:05,137 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L123-7: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 01:13:05,137 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L123-8: havoc minus_~a#1, minus_~b#1; [2025-02-08 01:13:05,138 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L123-9: #t~ret64#1 := minus_#res#1; [2025-02-08 01:13:05,328 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 01:13:05,328 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 01:13:05,988 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 01:13:05,988 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 01:13:05,989 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:13:05 BoogieIcfgContainer [2025-02-08 01:13:05,989 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 01:13:05,991 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 01:13:05,991 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 01:13:05,995 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 01:13:05,996 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:13:03" (1/3) ... [2025-02-08 01:13:05,996 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47f6bfea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:13:05, skipping insertion in model container [2025-02-08 01:13:05,996 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:13:04" (2/3) ... [2025-02-08 01:13:05,996 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47f6bfea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:13:05, skipping insertion in model container [2025-02-08 01:13:05,997 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:13:05" (3/3) ... [2025-02-08 01:13:05,998 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-nzb-file-subst.wvr.c [2025-02-08 01:13:06,016 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 01:13:06,017 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-nzb-file-subst.wvr.c that has 4 procedures, 56 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-02-08 01:13:06,017 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 01:13:06,137 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 01:13:06,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 70 transitions, 161 flow [2025-02-08 01:13:06,220 INFO L124 PetriNetUnfolderBase]: 15/67 cut-off events. [2025-02-08 01:13:06,224 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 01:13:06,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 67 events. 15/67 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 182 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2025-02-08 01:13:06,229 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 70 transitions, 161 flow [2025-02-08 01:13:06,233 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 66 transitions, 150 flow [2025-02-08 01:13:06,246 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 01:13:06,262 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;@54244a8f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 01:13:06,265 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-02-08 01:13:06,295 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 01:13:06,295 INFO L124 PetriNetUnfolderBase]: 15/65 cut-off events. [2025-02-08 01:13:06,295 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 01:13:06,296 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:06,296 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:06,297 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:13:06,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:06,302 INFO L85 PathProgramCache]: Analyzing trace with hash -427593346, now seen corresponding path program 1 times [2025-02-08 01:13:06,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:06,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793902693] [2025-02-08 01:13:06,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:13:06,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:06,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 01:13:06,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:13:06,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:13:06,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:06,861 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:13:06,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:06,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793902693] [2025-02-08 01:13:06,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793902693] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:06,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:06,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 01:13:06,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914016981] [2025-02-08 01:13:06,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:06,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 01:13:06,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:06,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 01:13:06,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 01:13:06,899 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 70 [2025-02-08 01:13:06,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 66 transitions, 150 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:06,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:06,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 70 [2025-02-08 01:13:06,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:08,928 INFO L124 PetriNetUnfolderBase]: 11422/15592 cut-off events. [2025-02-08 01:13:08,928 INFO L125 PetriNetUnfolderBase]: For 571/571 co-relation queries the response was YES. [2025-02-08 01:13:08,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31423 conditions, 15592 events. 11422/15592 cut-off events. For 571/571 co-relation queries the response was YES. Maximal size of possible extension queue 623. Compared 79232 event pairs, 8602 based on Foata normal form. 0/11771 useless extension candidates. Maximal degree in co-relation 30220. Up to 15353 conditions per place. [2025-02-08 01:13:09,037 INFO L140 encePairwiseOnDemand]: 60/70 looper letters, 50 selfloop transitions, 6 changer transitions 6/66 dead transitions. [2025-02-08 01:13:09,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 66 transitions, 274 flow [2025-02-08 01:13:09,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 01:13:09,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 01:13:09,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2025-02-08 01:13:09,051 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4238095238095238 [2025-02-08 01:13:09,053 INFO L175 Difference]: Start difference. First operand has 61 places, 66 transitions, 150 flow. Second operand 3 states and 89 transitions. [2025-02-08 01:13:09,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 66 transitions, 274 flow [2025-02-08 01:13:09,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 66 transitions, 262 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 01:13:09,075 INFO L231 Difference]: Finished difference. Result has 58 places, 60 transitions, 152 flow [2025-02-08 01:13:09,079 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=58, PETRI_TRANSITIONS=60} [2025-02-08 01:13:09,084 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -3 predicate places. [2025-02-08 01:13:09,085 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 60 transitions, 152 flow [2025-02-08 01:13:09,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:09,085 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:09,085 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:09,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 01:13:09,086 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:13:09,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:09,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1105534426, now seen corresponding path program 1 times [2025-02-08 01:13:09,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:09,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932641546] [2025-02-08 01:13:09,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:13:09,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:09,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 01:13:09,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 01:13:09,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:13:09,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:09,273 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 01:13:09,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:09,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932641546] [2025-02-08 01:13:09,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932641546] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:09,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:09,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 01:13:09,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559711157] [2025-02-08 01:13:09,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:09,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 01:13:09,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:09,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 01:13:09,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 01:13:09,284 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 70 [2025-02-08 01:13:09,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 60 transitions, 152 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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:13:09,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:09,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 70 [2025-02-08 01:13:09,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:10,721 INFO L124 PetriNetUnfolderBase]: 9780/13495 cut-off events. [2025-02-08 01:13:10,721 INFO L125 PetriNetUnfolderBase]: For 88/88 co-relation queries the response was YES. [2025-02-08 01:13:10,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26973 conditions, 13495 events. 9780/13495 cut-off events. For 88/88 co-relation queries the response was YES. Maximal size of possible extension queue 514. Compared 68802 event pairs, 4968 based on Foata normal form. 131/11880 useless extension candidates. Maximal degree in co-relation 26942. Up to 8867 conditions per place. [2025-02-08 01:13:10,804 INFO L140 encePairwiseOnDemand]: 64/70 looper letters, 95 selfloop transitions, 2 changer transitions 0/101 dead transitions. [2025-02-08 01:13:10,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 101 transitions, 433 flow [2025-02-08 01:13:10,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 01:13:10,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 01:13:10,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2025-02-08 01:13:10,807 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2025-02-08 01:13:10,807 INFO L175 Difference]: Start difference. First operand has 58 places, 60 transitions, 152 flow. Second operand 3 states and 119 transitions. [2025-02-08 01:13:10,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 101 transitions, 433 flow [2025-02-08 01:13:10,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 101 transitions, 427 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 01:13:10,810 INFO L231 Difference]: Finished difference. Result has 55 places, 62 transitions, 170 flow [2025-02-08 01:13:10,811 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=170, PETRI_PLACES=55, PETRI_TRANSITIONS=62} [2025-02-08 01:13:10,812 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -6 predicate places. [2025-02-08 01:13:10,812 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 62 transitions, 170 flow [2025-02-08 01:13:10,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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:13:10,812 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:10,812 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:10,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 01:13:10,813 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:13:10,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:10,814 INFO L85 PathProgramCache]: Analyzing trace with hash 138836158, now seen corresponding path program 2 times [2025-02-08 01:13:10,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:10,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692812068] [2025-02-08 01:13:10,814 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:13:10,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:10,843 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-02-08 01:13:10,860 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 30 of 33 statements. [2025-02-08 01:13:10,863 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:13:10,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:10,972 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 01:13:10,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:10,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692812068] [2025-02-08 01:13:10,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692812068] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:10,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:10,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 01:13:10,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005872499] [2025-02-08 01:13:10,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:10,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:13:10,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:10,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:13:10,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:13:10,985 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 70 [2025-02-08 01:13:10,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 62 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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:13:10,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:10,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 70 [2025-02-08 01:13:10,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:12,926 INFO L124 PetriNetUnfolderBase]: 13548/19083 cut-off events. [2025-02-08 01:13:12,927 INFO L125 PetriNetUnfolderBase]: For 3066/3066 co-relation queries the response was YES. [2025-02-08 01:13:12,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40692 conditions, 19083 events. 13548/19083 cut-off events. For 3066/3066 co-relation queries the response was YES. Maximal size of possible extension queue 730. Compared 108768 event pairs, 4238 based on Foata normal form. 348/17694 useless extension candidates. Maximal degree in co-relation 40657. Up to 6940 conditions per place. [2025-02-08 01:13:13,053 INFO L140 encePairwiseOnDemand]: 60/70 looper letters, 133 selfloop transitions, 7 changer transitions 0/144 dead transitions. [2025-02-08 01:13:13,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 144 transitions, 640 flow [2025-02-08 01:13:13,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 01:13:13,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 01:13:13,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 167 transitions. [2025-02-08 01:13:13,056 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5964285714285714 [2025-02-08 01:13:13,056 INFO L175 Difference]: Start difference. First operand has 55 places, 62 transitions, 170 flow. Second operand 4 states and 167 transitions. [2025-02-08 01:13:13,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 144 transitions, 640 flow [2025-02-08 01:13:13,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 144 transitions, 635 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 01:13:13,161 INFO L231 Difference]: Finished difference. Result has 60 places, 69 transitions, 239 flow [2025-02-08 01:13:13,162 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=239, PETRI_PLACES=60, PETRI_TRANSITIONS=69} [2025-02-08 01:13:13,163 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -1 predicate places. [2025-02-08 01:13:13,163 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 69 transitions, 239 flow [2025-02-08 01:13:13,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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:13:13,163 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:13,163 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:13,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 01:13:13,164 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:13:13,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:13,164 INFO L85 PathProgramCache]: Analyzing trace with hash -724836350, now seen corresponding path program 3 times [2025-02-08 01:13:13,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:13,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868821597] [2025-02-08 01:13:13,164 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:13:13,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:13,182 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 2 equivalence classes. [2025-02-08 01:13:13,206 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 30 of 33 statements. [2025-02-08 01:13:13,206 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 01:13:13,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:13,350 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 01:13:13,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:13,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868821597] [2025-02-08 01:13:13,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868821597] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:13,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:13,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 01:13:13,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324795678] [2025-02-08 01:13:13,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:13,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:13:13,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:13,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:13:13,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:13:13,364 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 70 [2025-02-08 01:13:13,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 69 transitions, 239 flow. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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:13:13,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:13,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 70 [2025-02-08 01:13:13,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:14,771 INFO L124 PetriNetUnfolderBase]: 13850/19561 cut-off events. [2025-02-08 01:13:14,771 INFO L125 PetriNetUnfolderBase]: For 10046/10123 co-relation queries the response was YES. [2025-02-08 01:13:14,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45771 conditions, 19561 events. 13850/19561 cut-off events. For 10046/10123 co-relation queries the response was YES. Maximal size of possible extension queue 790. Compared 113971 event pairs, 4060 based on Foata normal form. 763/19075 useless extension candidates. Maximal degree in co-relation 45734. Up to 7726 conditions per place. [2025-02-08 01:13:14,905 INFO L140 encePairwiseOnDemand]: 59/70 looper letters, 126 selfloop transitions, 10 changer transitions 2/141 dead transitions. [2025-02-08 01:13:14,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 141 transitions, 730 flow [2025-02-08 01:13:14,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 01:13:14,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 01:13:14,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 153 transitions. [2025-02-08 01:13:14,909 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5464285714285714 [2025-02-08 01:13:14,910 INFO L175 Difference]: Start difference. First operand has 60 places, 69 transitions, 239 flow. Second operand 4 states and 153 transitions. [2025-02-08 01:13:14,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 141 transitions, 730 flow [2025-02-08 01:13:14,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 141 transitions, 730 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 01:13:14,917 INFO L231 Difference]: Finished difference. Result has 66 places, 77 transitions, 356 flow [2025-02-08 01:13:14,918 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=356, PETRI_PLACES=66, PETRI_TRANSITIONS=77} [2025-02-08 01:13:14,920 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 5 predicate places. [2025-02-08 01:13:14,920 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 77 transitions, 356 flow [2025-02-08 01:13:14,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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:13:14,920 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:14,921 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:14,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 01:13:14,921 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:13:14,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:14,921 INFO L85 PathProgramCache]: Analyzing trace with hash 381419288, now seen corresponding path program 4 times [2025-02-08 01:13:14,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:14,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342353038] [2025-02-08 01:13:14,921 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 01:13:14,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:14,938 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-02-08 01:13:14,960 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 01:13:14,962 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 01:13:14,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:15,101 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 01:13:15,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:15,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342353038] [2025-02-08 01:13:15,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342353038] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:15,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:15,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 01:13:15,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196529790] [2025-02-08 01:13:15,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:15,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:13:15,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:15,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:13:15,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:13:15,104 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 70 [2025-02-08 01:13:15,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 77 transitions, 356 flow. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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:13:15,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:15,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 70 [2025-02-08 01:13:15,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:16,410 INFO L124 PetriNetUnfolderBase]: 12691/18074 cut-off events. [2025-02-08 01:13:16,411 INFO L125 PetriNetUnfolderBase]: For 19258/19437 co-relation queries the response was YES. [2025-02-08 01:13:16,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46697 conditions, 18074 events. 12691/18074 cut-off events. For 19258/19437 co-relation queries the response was YES. Maximal size of possible extension queue 772. Compared 104748 event pairs, 5963 based on Foata normal form. 28/16836 useless extension candidates. Maximal degree in co-relation 46657. Up to 11042 conditions per place. [2025-02-08 01:13:16,470 INFO L140 encePairwiseOnDemand]: 66/70 looper letters, 56 selfloop transitions, 0 changer transitions 91/150 dead transitions. [2025-02-08 01:13:16,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 150 transitions, 939 flow [2025-02-08 01:13:16,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 01:13:16,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 01:13:16,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 144 transitions. [2025-02-08 01:13:16,472 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2025-02-08 01:13:16,472 INFO L175 Difference]: Start difference. First operand has 66 places, 77 transitions, 356 flow. Second operand 4 states and 144 transitions. [2025-02-08 01:13:16,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 150 transitions, 939 flow [2025-02-08 01:13:16,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 150 transitions, 933 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-02-08 01:13:16,486 INFO L231 Difference]: Finished difference. Result has 70 places, 59 transitions, 216 flow [2025-02-08 01:13:16,487 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=216, PETRI_PLACES=70, PETRI_TRANSITIONS=59} [2025-02-08 01:13:16,487 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 9 predicate places. [2025-02-08 01:13:16,488 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 59 transitions, 216 flow [2025-02-08 01:13:16,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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:13:16,488 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:16,488 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:16,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 01:13:16,488 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:13:16,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:16,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1893900823, now seen corresponding path program 1 times [2025-02-08 01:13:16,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:16,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877951663] [2025-02-08 01:13:16,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:13:16,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:16,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 01:13:16,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 01:13:16,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:13:16,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:16,667 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 01:13:16,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:16,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877951663] [2025-02-08 01:13:16,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877951663] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:13:16,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444786164] [2025-02-08 01:13:16,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:13:16,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:13:16,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:13:16,671 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:13:16,673 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:13:16,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 01:13:16,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 01:13:16,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:13:16,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:16,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 01:13:16,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:13:16,904 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 01:13:16,904 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:13:16,934 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 01:13:16,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444786164] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:13:16,934 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:13:16,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2025-02-08 01:13:16,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439533381] [2025-02-08 01:13:16,934 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:13:16,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:13:16,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:16,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:13:16,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:13:16,937 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 70 [2025-02-08 01:13:16,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 59 transitions, 216 flow. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 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:13:16,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:16,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 70 [2025-02-08 01:13:16,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:17,547 INFO L124 PetriNetUnfolderBase]: 5397/7600 cut-off events. [2025-02-08 01:13:17,548 INFO L125 PetriNetUnfolderBase]: For 5715/5715 co-relation queries the response was YES. [2025-02-08 01:13:17,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18314 conditions, 7600 events. 5397/7600 cut-off events. For 5715/5715 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 35179 event pairs, 4094 based on Foata normal form. 0/6962 useless extension candidates. Maximal degree in co-relation 18302. Up to 7486 conditions per place. [2025-02-08 01:13:17,591 INFO L140 encePairwiseOnDemand]: 63/70 looper letters, 50 selfloop transitions, 15 changer transitions 0/68 dead transitions. [2025-02-08 01:13:17,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 68 transitions, 382 flow [2025-02-08 01:13:17,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:13:17,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 01:13:17,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2025-02-08 01:13:17,592 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2619047619047619 [2025-02-08 01:13:17,593 INFO L175 Difference]: Start difference. First operand has 70 places, 59 transitions, 216 flow. Second operand 6 states and 110 transitions. [2025-02-08 01:13:17,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 68 transitions, 382 flow [2025-02-08 01:13:17,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 68 transitions, 354 flow, removed 12 selfloop flow, removed 3 redundant places. [2025-02-08 01:13:17,611 INFO L231 Difference]: Finished difference. Result has 65 places, 68 transitions, 284 flow [2025-02-08 01:13:17,611 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=284, PETRI_PLACES=65, PETRI_TRANSITIONS=68} [2025-02-08 01:13:17,611 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 4 predicate places. [2025-02-08 01:13:17,611 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 68 transitions, 284 flow [2025-02-08 01:13:17,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 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:13:17,612 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:17,612 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:17,621 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 01:13:17,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:13:17,813 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:13:17,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:17,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1145011869, now seen corresponding path program 2 times [2025-02-08 01:13:17,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:17,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394200696] [2025-02-08 01:13:17,814 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:13:17,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:17,832 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-02-08 01:13:17,845 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 32 of 44 statements. [2025-02-08 01:13:17,846 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:13:17,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:17,946 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-08 01:13:17,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:17,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394200696] [2025-02-08 01:13:17,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394200696] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:17,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:17,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 01:13:17,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507791914] [2025-02-08 01:13:17,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:17,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 01:13:17,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:17,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 01:13:17,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 01:13:17,948 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 70 [2025-02-08 01:13:17,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 68 transitions, 284 flow. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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:13:17,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:17,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 70 [2025-02-08 01:13:17,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:18,686 INFO L124 PetriNetUnfolderBase]: 7733/10808 cut-off events. [2025-02-08 01:13:18,687 INFO L125 PetriNetUnfolderBase]: For 3496/3496 co-relation queries the response was YES. [2025-02-08 01:13:18,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24630 conditions, 10808 events. 7733/10808 cut-off events. For 3496/3496 co-relation queries the response was YES. Maximal size of possible extension queue 356. Compared 52622 event pairs, 4316 based on Foata normal form. 222/10003 useless extension candidates. Maximal degree in co-relation 24617. Up to 7400 conditions per place. [2025-02-08 01:13:18,731 INFO L140 encePairwiseOnDemand]: 67/70 looper letters, 90 selfloop transitions, 4 changer transitions 2/99 dead transitions. [2025-02-08 01:13:18,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 99 transitions, 556 flow [2025-02-08 01:13:18,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 01:13:18,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 01:13:18,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 100 transitions. [2025-02-08 01:13:18,732 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2025-02-08 01:13:18,732 INFO L175 Difference]: Start difference. First operand has 65 places, 68 transitions, 284 flow. Second operand 3 states and 100 transitions. [2025-02-08 01:13:18,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 99 transitions, 556 flow [2025-02-08 01:13:18,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 99 transitions, 522 flow, removed 14 selfloop flow, removed 2 redundant places. [2025-02-08 01:13:18,738 INFO L231 Difference]: Finished difference. Result has 66 places, 69 transitions, 272 flow [2025-02-08 01:13:18,738 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=272, PETRI_PLACES=66, PETRI_TRANSITIONS=69} [2025-02-08 01:13:18,738 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 5 predicate places. [2025-02-08 01:13:18,738 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 69 transitions, 272 flow [2025-02-08 01:13:18,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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:13:18,739 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:18,739 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:18,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 01:13:18,739 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:13:18,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:18,739 INFO L85 PathProgramCache]: Analyzing trace with hash -296437630, now seen corresponding path program 1 times [2025-02-08 01:13:18,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:18,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248884385] [2025-02-08 01:13:18,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:13:18,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:18,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 01:13:18,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 01:13:18,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:13:18,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:19,055 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-08 01:13:19,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:19,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248884385] [2025-02-08 01:13:19,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248884385] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:13:19,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76269377] [2025-02-08 01:13:19,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:13:19,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:13:19,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:13:19,058 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:13:19,061 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:13:19,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 01:13:19,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 01:13:19,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:13:19,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:19,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 01:13:19,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:13:19,338 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-08 01:13:19,339 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:13:19,427 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-08 01:13:19,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [76269377] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:13:19,427 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:13:19,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2025-02-08 01:13:19,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585288142] [2025-02-08 01:13:19,428 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:13:19,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-08 01:13:19,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:19,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-08 01:13:19,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=166, Unknown=0, NotChecked=0, Total=272 [2025-02-08 01:13:19,430 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 70 [2025-02-08 01:13:19,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 69 transitions, 272 flow. Second operand has 17 states, 17 states have (on average 9.941176470588236) internal successors, (169), 17 states have internal predecessors, (169), 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:13:19,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:19,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 70 [2025-02-08 01:13:19,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:20,353 INFO L124 PetriNetUnfolderBase]: 7733/10869 cut-off events. [2025-02-08 01:13:20,354 INFO L125 PetriNetUnfolderBase]: For 4745/4745 co-relation queries the response was YES. [2025-02-08 01:13:20,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25339 conditions, 10869 events. 7733/10869 cut-off events. For 4745/4745 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 52752 event pairs, 6094 based on Foata normal form. 1/10287 useless extension candidates. Maximal degree in co-relation 25325. Up to 10710 conditions per place. [2025-02-08 01:13:20,429 INFO L140 encePairwiseOnDemand]: 63/70 looper letters, 51 selfloop transitions, 18 changer transitions 0/72 dead transitions. [2025-02-08 01:13:20,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 72 transitions, 428 flow [2025-02-08 01:13:20,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 01:13:20,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 01:13:20,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2025-02-08 01:13:20,430 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.23265306122448978 [2025-02-08 01:13:20,430 INFO L175 Difference]: Start difference. First operand has 66 places, 69 transitions, 272 flow. Second operand 7 states and 114 transitions. [2025-02-08 01:13:20,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 72 transitions, 428 flow [2025-02-08 01:13:20,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 72 transitions, 424 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 01:13:20,435 INFO L231 Difference]: Finished difference. Result has 72 places, 72 transitions, 336 flow [2025-02-08 01:13:20,435 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=336, PETRI_PLACES=72, PETRI_TRANSITIONS=72} [2025-02-08 01:13:20,436 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 11 predicate places. [2025-02-08 01:13:20,436 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 72 transitions, 336 flow [2025-02-08 01:13:20,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 9.941176470588236) internal successors, (169), 17 states have internal predecessors, (169), 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:13:20,436 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:20,436 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:20,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 01:13:20,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:13:20,637 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:13:20,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:20,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1278293652, now seen corresponding path program 2 times [2025-02-08 01:13:20,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:20,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639090435] [2025-02-08 01:13:20,638 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:13:20,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:20,666 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-02-08 01:13:20,716 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 32 of 49 statements. [2025-02-08 01:13:20,716 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:13:20,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:20,951 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-08 01:13:20,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:20,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639090435] [2025-02-08 01:13:20,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639090435] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:20,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:20,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 01:13:20,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919177376] [2025-02-08 01:13:20,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:20,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:13:20,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:20,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:13:20,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:13:20,954 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 70 [2025-02-08 01:13:20,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 72 transitions, 336 flow. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:20,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:20,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 70 [2025-02-08 01:13:20,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:22,076 INFO L124 PetriNetUnfolderBase]: 9217/13116 cut-off events. [2025-02-08 01:13:22,076 INFO L125 PetriNetUnfolderBase]: For 4509/4509 co-relation queries the response was YES. [2025-02-08 01:13:22,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30292 conditions, 13116 events. 9217/13116 cut-off events. For 4509/4509 co-relation queries the response was YES. Maximal size of possible extension queue 421. Compared 68245 event pairs, 5475 based on Foata normal form. 1/12477 useless extension candidates. Maximal degree in co-relation 30277. Up to 9386 conditions per place. [2025-02-08 01:13:22,122 INFO L140 encePairwiseOnDemand]: 65/70 looper letters, 121 selfloop transitions, 3 changer transitions 32/159 dead transitions. [2025-02-08 01:13:22,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 159 transitions, 919 flow [2025-02-08 01:13:22,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:13:22,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 01:13:22,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 167 transitions. [2025-02-08 01:13:22,123 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3976190476190476 [2025-02-08 01:13:22,123 INFO L175 Difference]: Start difference. First operand has 72 places, 72 transitions, 336 flow. Second operand 6 states and 167 transitions. [2025-02-08 01:13:22,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 159 transitions, 919 flow [2025-02-08 01:13:22,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 159 transitions, 883 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-02-08 01:13:22,130 INFO L231 Difference]: Finished difference. Result has 76 places, 72 transitions, 315 flow [2025-02-08 01:13:22,131 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=315, PETRI_PLACES=76, PETRI_TRANSITIONS=72} [2025-02-08 01:13:22,131 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 15 predicate places. [2025-02-08 01:13:22,131 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 72 transitions, 315 flow [2025-02-08 01:13:22,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:22,132 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:22,132 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:22,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 01:13:22,132 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:13:22,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:22,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1275147016, now seen corresponding path program 3 times [2025-02-08 01:13:22,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:22,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581605639] [2025-02-08 01:13:22,133 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:13:22,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:22,153 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 49 statements into 4 equivalence classes. [2025-02-08 01:13:22,176 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 32 of 49 statements. [2025-02-08 01:13:22,176 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 01:13:22,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:22,802 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-08 01:13:22,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:22,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581605639] [2025-02-08 01:13:22,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581605639] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:22,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:22,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 01:13:22,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090306106] [2025-02-08 01:13:22,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:22,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:13:22,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:22,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:13:22,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:13:22,805 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 70 [2025-02-08 01:13:22,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 72 transitions, 315 flow. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:22,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:22,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 70 [2025-02-08 01:13:22,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:24,465 INFO L124 PetriNetUnfolderBase]: 10491/15079 cut-off events. [2025-02-08 01:13:24,465 INFO L125 PetriNetUnfolderBase]: For 7162/7162 co-relation queries the response was YES. [2025-02-08 01:13:24,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35943 conditions, 15079 events. 10491/15079 cut-off events. For 7162/7162 co-relation queries the response was YES. Maximal size of possible extension queue 464. Compared 80784 event pairs, 6690 based on Foata normal form. 1/14382 useless extension candidates. Maximal degree in co-relation 35924. Up to 11104 conditions per place. [2025-02-08 01:13:24,559 INFO L140 encePairwiseOnDemand]: 65/70 looper letters, 120 selfloop transitions, 3 changer transitions 31/157 dead transitions. [2025-02-08 01:13:24,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 157 transitions, 915 flow [2025-02-08 01:13:24,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:13:24,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 01:13:24,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 163 transitions. [2025-02-08 01:13:24,561 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3880952380952381 [2025-02-08 01:13:24,562 INFO L175 Difference]: Start difference. First operand has 76 places, 72 transitions, 315 flow. Second operand 6 states and 163 transitions. [2025-02-08 01:13:24,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 157 transitions, 915 flow [2025-02-08 01:13:24,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 157 transitions, 893 flow, removed 3 selfloop flow, removed 4 redundant places. [2025-02-08 01:13:24,586 INFO L231 Difference]: Finished difference. Result has 78 places, 72 transitions, 321 flow [2025-02-08 01:13:24,586 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=321, PETRI_PLACES=78, PETRI_TRANSITIONS=72} [2025-02-08 01:13:24,586 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 17 predicate places. [2025-02-08 01:13:24,586 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 72 transitions, 321 flow [2025-02-08 01:13:24,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:24,587 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:24,587 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:24,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 01:13:24,587 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:13:24,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:24,588 INFO L85 PathProgramCache]: Analyzing trace with hash 295242620, now seen corresponding path program 4 times [2025-02-08 01:13:24,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:24,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958000485] [2025-02-08 01:13:24,588 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 01:13:24,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:24,613 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 49 statements into 2 equivalence classes. [2025-02-08 01:13:24,640 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 01:13:24,640 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 01:13:24,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:25,170 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-08 01:13:25,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:25,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958000485] [2025-02-08 01:13:25,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958000485] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:25,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:25,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 01:13:25,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306176113] [2025-02-08 01:13:25,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:25,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:13:25,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:25,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:13:25,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:13:25,172 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 70 [2025-02-08 01:13:25,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 72 transitions, 321 flow. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:25,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:25,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 70 [2025-02-08 01:13:25,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:26,732 INFO L124 PetriNetUnfolderBase]: 10478/15076 cut-off events. [2025-02-08 01:13:26,732 INFO L125 PetriNetUnfolderBase]: For 8161/8161 co-relation queries the response was YES. [2025-02-08 01:13:26,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36495 conditions, 15076 events. 10478/15076 cut-off events. For 8161/8161 co-relation queries the response was YES. Maximal size of possible extension queue 467. Compared 80791 event pairs, 7995 based on Foata normal form. 1/14379 useless extension candidates. Maximal degree in co-relation 36475. Up to 13301 conditions per place. [2025-02-08 01:13:26,787 INFO L140 encePairwiseOnDemand]: 65/70 looper letters, 102 selfloop transitions, 6 changer transitions 30/141 dead transitions. [2025-02-08 01:13:26,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 141 transitions, 831 flow [2025-02-08 01:13:26,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:13:26,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 01:13:26,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 152 transitions. [2025-02-08 01:13:26,788 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3619047619047619 [2025-02-08 01:13:26,788 INFO L175 Difference]: Start difference. First operand has 78 places, 72 transitions, 321 flow. Second operand 6 states and 152 transitions. [2025-02-08 01:13:26,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 141 transitions, 831 flow [2025-02-08 01:13:26,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 141 transitions, 813 flow, removed 3 selfloop flow, removed 4 redundant places. [2025-02-08 01:13:26,814 INFO L231 Difference]: Finished difference. Result has 81 places, 75 transitions, 362 flow [2025-02-08 01:13:26,814 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=362, PETRI_PLACES=81, PETRI_TRANSITIONS=75} [2025-02-08 01:13:26,814 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 20 predicate places. [2025-02-08 01:13:26,814 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 75 transitions, 362 flow [2025-02-08 01:13:26,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:26,815 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:26,815 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:26,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 01:13:26,815 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:13:26,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:26,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1945244612, now seen corresponding path program 5 times [2025-02-08 01:13:26,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:26,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690240920] [2025-02-08 01:13:26,815 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 01:13:26,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:26,835 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 49 statements into 4 equivalence classes. [2025-02-08 01:13:27,031 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 01:13:27,031 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-02-08 01:13:27,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:27,368 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-08 01:13:27,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:27,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690240920] [2025-02-08 01:13:27,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690240920] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:27,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:27,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 01:13:27,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634626347] [2025-02-08 01:13:27,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:27,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:13:27,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:27,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:13:27,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:13:27,370 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 70 [2025-02-08 01:13:27,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 75 transitions, 362 flow. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:27,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:27,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 70 [2025-02-08 01:13:27,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:29,046 INFO L124 PetriNetUnfolderBase]: 10353/14904 cut-off events. [2025-02-08 01:13:29,046 INFO L125 PetriNetUnfolderBase]: For 10728/10728 co-relation queries the response was YES. [2025-02-08 01:13:29,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37381 conditions, 14904 events. 10353/14904 cut-off events. For 10728/10728 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 79628 event pairs, 8043 based on Foata normal form. 1/14207 useless extension candidates. Maximal degree in co-relation 37359. Up to 13360 conditions per place. [2025-02-08 01:13:29,178 INFO L140 encePairwiseOnDemand]: 65/70 looper letters, 101 selfloop transitions, 9 changer transitions 30/143 dead transitions. [2025-02-08 01:13:29,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 143 transitions, 882 flow [2025-02-08 01:13:29,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:13:29,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 01:13:29,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 150 transitions. [2025-02-08 01:13:29,180 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35714285714285715 [2025-02-08 01:13:29,180 INFO L175 Difference]: Start difference. First operand has 81 places, 75 transitions, 362 flow. Second operand 6 states and 150 transitions. [2025-02-08 01:13:29,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 143 transitions, 882 flow [2025-02-08 01:13:29,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 143 transitions, 858 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-02-08 01:13:29,230 INFO L231 Difference]: Finished difference. Result has 83 places, 78 transitions, 407 flow [2025-02-08 01:13:29,231 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=407, PETRI_PLACES=83, PETRI_TRANSITIONS=78} [2025-02-08 01:13:29,232 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 22 predicate places. [2025-02-08 01:13:29,232 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 78 transitions, 407 flow [2025-02-08 01:13:29,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:29,232 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:29,232 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:29,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 01:13:29,233 INFO L396 AbstractCegarLoop]: === Iteration 13 === 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:13:29,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:29,233 INFO L85 PathProgramCache]: Analyzing trace with hash -788933084, now seen corresponding path program 6 times [2025-02-08 01:13:29,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:29,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621688598] [2025-02-08 01:13:29,233 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 01:13:29,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:29,259 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 49 statements into 4 equivalence classes. [2025-02-08 01:13:29,273 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 32 of 49 statements. [2025-02-08 01:13:29,274 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-08 01:13:29,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:29,446 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-08 01:13:29,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:29,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621688598] [2025-02-08 01:13:29,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621688598] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:29,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:29,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 01:13:29,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231166109] [2025-02-08 01:13:29,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:29,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:13:29,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:29,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:13:29,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:13:29,449 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 70 [2025-02-08 01:13:29,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 78 transitions, 407 flow. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:29,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:29,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 70 [2025-02-08 01:13:29,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:30,912 INFO L124 PetriNetUnfolderBase]: 10287/14809 cut-off events. [2025-02-08 01:13:30,912 INFO L125 PetriNetUnfolderBase]: For 12290/12290 co-relation queries the response was YES. [2025-02-08 01:13:30,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37634 conditions, 14809 events. 10287/14809 cut-off events. For 12290/12290 co-relation queries the response was YES. Maximal size of possible extension queue 455. Compared 79260 event pairs, 7883 based on Foata normal form. 1/14112 useless extension candidates. Maximal degree in co-relation 37611. Up to 13077 conditions per place. [2025-02-08 01:13:30,961 INFO L140 encePairwiseOnDemand]: 65/70 looper letters, 90 selfloop transitions, 5 changer transitions 43/141 dead transitions. [2025-02-08 01:13:30,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 141 transitions, 881 flow [2025-02-08 01:13:30,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:13:30,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 01:13:30,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 150 transitions. [2025-02-08 01:13:30,962 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35714285714285715 [2025-02-08 01:13:30,962 INFO L175 Difference]: Start difference. First operand has 83 places, 78 transitions, 407 flow. Second operand 6 states and 150 transitions. [2025-02-08 01:13:30,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 141 transitions, 881 flow [2025-02-08 01:13:31,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 141 transitions, 859 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-02-08 01:13:31,023 INFO L231 Difference]: Finished difference. Result has 84 places, 75 transitions, 367 flow [2025-02-08 01:13:31,024 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=367, PETRI_PLACES=84, PETRI_TRANSITIONS=75} [2025-02-08 01:13:31,025 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 23 predicate places. [2025-02-08 01:13:31,025 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 75 transitions, 367 flow [2025-02-08 01:13:31,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:31,025 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:31,025 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:31,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 01:13:31,026 INFO L396 AbstractCegarLoop]: === Iteration 14 === 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:13:31,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:31,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1955802180, now seen corresponding path program 7 times [2025-02-08 01:13:31,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:31,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464394823] [2025-02-08 01:13:31,027 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 01:13:31,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:31,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 01:13:31,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 01:13:31,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:13:31,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:31,442 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-08 01:13:31,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:31,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464394823] [2025-02-08 01:13:31,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464394823] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:31,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:31,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 01:13:31,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769215579] [2025-02-08 01:13:31,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:31,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:13:31,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:31,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:13:31,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:13:31,445 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 70 [2025-02-08 01:13:31,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 75 transitions, 367 flow. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:31,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:31,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 70 [2025-02-08 01:13:31,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:32,829 INFO L124 PetriNetUnfolderBase]: 9977/14323 cut-off events. [2025-02-08 01:13:32,830 INFO L125 PetriNetUnfolderBase]: For 12388/12388 co-relation queries the response was YES. [2025-02-08 01:13:32,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36220 conditions, 14323 events. 9977/14323 cut-off events. For 12388/12388 co-relation queries the response was YES. Maximal size of possible extension queue 436. Compared 75506 event pairs, 7762 based on Foata normal form. 1/13626 useless extension candidates. Maximal degree in co-relation 36197. Up to 12844 conditions per place. [2025-02-08 01:13:32,899 INFO L140 encePairwiseOnDemand]: 65/70 looper letters, 89 selfloop transitions, 3 changer transitions 43/138 dead transitions. [2025-02-08 01:13:32,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 138 transitions, 840 flow [2025-02-08 01:13:32,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:13:32,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 01:13:32,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 148 transitions. [2025-02-08 01:13:32,900 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3523809523809524 [2025-02-08 01:13:32,900 INFO L175 Difference]: Start difference. First operand has 84 places, 75 transitions, 367 flow. Second operand 6 states and 148 transitions. [2025-02-08 01:13:32,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 138 transitions, 840 flow [2025-02-08 01:13:32,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 138 transitions, 824 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-02-08 01:13:32,959 INFO L231 Difference]: Finished difference. Result has 83 places, 72 transitions, 338 flow [2025-02-08 01:13:32,959 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=338, PETRI_PLACES=83, PETRI_TRANSITIONS=72} [2025-02-08 01:13:32,959 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 22 predicate places. [2025-02-08 01:13:32,960 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 72 transitions, 338 flow [2025-02-08 01:13:32,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:32,960 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:32,960 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:32,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 01:13:32,960 INFO L396 AbstractCegarLoop]: === Iteration 15 === 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:13:32,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:32,961 INFO L85 PathProgramCache]: Analyzing trace with hash 2069092875, now seen corresponding path program 1 times [2025-02-08 01:13:32,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:32,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568075299] [2025-02-08 01:13:32,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:13:32,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:32,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-08 01:13:32,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-08 01:13:32,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:13:32,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:33,053 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-08 01:13:33,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:33,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568075299] [2025-02-08 01:13:33,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568075299] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:33,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:33,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 01:13:33,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946328007] [2025-02-08 01:13:33,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:33,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 01:13:33,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:33,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 01:13:33,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 01:13:33,060 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 70 [2025-02-08 01:13:33,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 72 transitions, 338 flow. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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:13:33,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:33,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 70 [2025-02-08 01:13:33,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:34,669 INFO L124 PetriNetUnfolderBase]: 9054/13018 cut-off events. [2025-02-08 01:13:34,669 INFO L125 PetriNetUnfolderBase]: For 12265/12265 co-relation queries the response was YES. [2025-02-08 01:13:34,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31596 conditions, 13018 events. 9054/13018 cut-off events. For 12265/12265 co-relation queries the response was YES. Maximal size of possible extension queue 381. Compared 68568 event pairs, 2449 based on Foata normal form. 301/12645 useless extension candidates. Maximal degree in co-relation 31573. Up to 10398 conditions per place. [2025-02-08 01:13:34,794 INFO L140 encePairwiseOnDemand]: 66/70 looper letters, 89 selfloop transitions, 4 changer transitions 2/98 dead transitions. [2025-02-08 01:13:34,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 98 transitions, 616 flow [2025-02-08 01:13:34,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 01:13:34,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 01:13:34,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2025-02-08 01:13:34,795 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44285714285714284 [2025-02-08 01:13:34,795 INFO L175 Difference]: Start difference. First operand has 83 places, 72 transitions, 338 flow. Second operand 3 states and 93 transitions. [2025-02-08 01:13:34,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 98 transitions, 616 flow [2025-02-08 01:13:34,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 98 transitions, 600 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-02-08 01:13:34,822 INFO L231 Difference]: Finished difference. Result has 78 places, 75 transitions, 367 flow [2025-02-08 01:13:34,823 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=367, PETRI_PLACES=78, PETRI_TRANSITIONS=75} [2025-02-08 01:13:34,823 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 17 predicate places. [2025-02-08 01:13:34,823 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 75 transitions, 367 flow [2025-02-08 01:13:34,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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:13:34,823 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:34,824 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:34,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 01:13:34,824 INFO L396 AbstractCegarLoop]: === Iteration 16 === 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:13:34,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:34,824 INFO L85 PathProgramCache]: Analyzing trace with hash 133945623, now seen corresponding path program 2 times [2025-02-08 01:13:34,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:34,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967610717] [2025-02-08 01:13:34,825 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:13:34,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:34,847 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 51 statements into 2 equivalence classes. [2025-02-08 01:13:34,854 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 34 of 51 statements. [2025-02-08 01:13:34,855 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:13:34,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:34,919 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-08 01:13:34,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:34,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967610717] [2025-02-08 01:13:34,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967610717] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:34,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:34,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 01:13:34,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972038800] [2025-02-08 01:13:34,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:34,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:13:34,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:34,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:13:34,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:13:34,928 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 70 [2025-02-08 01:13:34,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 75 transitions, 367 flow. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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:13:34,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:34,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 70 [2025-02-08 01:13:34,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:36,063 INFO L124 PetriNetUnfolderBase]: 7345/10723 cut-off events. [2025-02-08 01:13:36,063 INFO L125 PetriNetUnfolderBase]: For 9884/9884 co-relation queries the response was YES. [2025-02-08 01:13:36,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26141 conditions, 10723 events. 7345/10723 cut-off events. For 9884/9884 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 57336 event pairs, 2075 based on Foata normal form. 172/10351 useless extension candidates. Maximal degree in co-relation 26120. Up to 7738 conditions per place. [2025-02-08 01:13:36,101 INFO L140 encePairwiseOnDemand]: 64/70 looper letters, 76 selfloop transitions, 3 changer transitions 46/126 dead transitions. [2025-02-08 01:13:36,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 126 transitions, 773 flow [2025-02-08 01:13:36,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 01:13:36,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 01:13:36,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 139 transitions. [2025-02-08 01:13:36,103 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39714285714285713 [2025-02-08 01:13:36,103 INFO L175 Difference]: Start difference. First operand has 78 places, 75 transitions, 367 flow. Second operand 5 states and 139 transitions. [2025-02-08 01:13:36,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 126 transitions, 773 flow [2025-02-08 01:13:36,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 126 transitions, 769 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 01:13:36,125 INFO L231 Difference]: Finished difference. Result has 82 places, 65 transitions, 310 flow [2025-02-08 01:13:36,125 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=355, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=310, PETRI_PLACES=82, PETRI_TRANSITIONS=65} [2025-02-08 01:13:36,126 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 21 predicate places. [2025-02-08 01:13:36,126 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 65 transitions, 310 flow [2025-02-08 01:13:36,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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:13:36,126 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:36,126 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:36,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 01:13:36,126 INFO L396 AbstractCegarLoop]: === Iteration 17 === 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:13:36,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:36,127 INFO L85 PathProgramCache]: Analyzing trace with hash 884977274, now seen corresponding path program 1 times [2025-02-08 01:13:36,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:36,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434791861] [2025-02-08 01:13:36,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:13:36,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:36,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-08 01:13:36,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-08 01:13:36,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:13:36,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:36,254 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-02-08 01:13:36,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:36,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434791861] [2025-02-08 01:13:36,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434791861] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:36,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:36,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 01:13:36,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952072548] [2025-02-08 01:13:36,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:36,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 01:13:36,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:36,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 01:13:36,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 01:13:36,256 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 70 [2025-02-08 01:13:36,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 65 transitions, 310 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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:13:36,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:36,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 70 [2025-02-08 01:13:36,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:37,308 INFO L124 PetriNetUnfolderBase]: 7164/10146 cut-off events. [2025-02-08 01:13:37,308 INFO L125 PetriNetUnfolderBase]: For 4958/4958 co-relation queries the response was YES. [2025-02-08 01:13:37,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23923 conditions, 10146 events. 7164/10146 cut-off events. For 4958/4958 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 48072 event pairs, 4144 based on Foata normal form. 248/9557 useless extension candidates. Maximal degree in co-relation 23901. Up to 6762 conditions per place. [2025-02-08 01:13:37,385 INFO L140 encePairwiseOnDemand]: 67/70 looper letters, 84 selfloop transitions, 5 changer transitions 2/92 dead transitions. [2025-02-08 01:13:37,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 92 transitions, 576 flow [2025-02-08 01:13:37,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 01:13:37,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 01:13:37,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2025-02-08 01:13:37,387 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4142857142857143 [2025-02-08 01:13:37,387 INFO L175 Difference]: Start difference. First operand has 82 places, 65 transitions, 310 flow. Second operand 3 states and 87 transitions. [2025-02-08 01:13:37,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 92 transitions, 576 flow [2025-02-08 01:13:37,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 92 transitions, 563 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-02-08 01:13:37,394 INFO L231 Difference]: Finished difference. Result has 73 places, 66 transitions, 320 flow [2025-02-08 01:13:37,395 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=320, PETRI_PLACES=73, PETRI_TRANSITIONS=66} [2025-02-08 01:13:37,395 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 12 predicate places. [2025-02-08 01:13:37,395 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 66 transitions, 320 flow [2025-02-08 01:13:37,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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:13:37,396 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:37,396 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:37,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 01:13:37,396 INFO L396 AbstractCegarLoop]: === Iteration 18 === 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:13:37,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:37,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1209483160, now seen corresponding path program 1 times [2025-02-08 01:13:37,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:37,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975856954] [2025-02-08 01:13:37,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:13:37,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:37,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-08 01:13:37,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 01:13:37,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:13:37,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:37,564 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-02-08 01:13:37,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:37,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975856954] [2025-02-08 01:13:37,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975856954] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:37,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:37,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 01:13:37,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810385811] [2025-02-08 01:13:37,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:37,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 01:13:37,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:37,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 01:13:37,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 01:13:37,566 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 70 [2025-02-08 01:13:37,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 66 transitions, 320 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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:13:37,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:37,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 70 [2025-02-08 01:13:37,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:38,828 INFO L124 PetriNetUnfolderBase]: 10544/14890 cut-off events. [2025-02-08 01:13:38,828 INFO L125 PetriNetUnfolderBase]: For 8839/8839 co-relation queries the response was YES. [2025-02-08 01:13:38,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36069 conditions, 14890 events. 10544/14890 cut-off events. For 8839/8839 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 74597 event pairs, 6028 based on Foata normal form. 341/14549 useless extension candidates. Maximal degree in co-relation 36047. Up to 10186 conditions per place. [2025-02-08 01:13:38,877 INFO L140 encePairwiseOnDemand]: 67/70 looper letters, 87 selfloop transitions, 4 changer transitions 2/94 dead transitions. [2025-02-08 01:13:38,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 94 transitions, 613 flow [2025-02-08 01:13:38,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 01:13:38,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 01:13:38,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2025-02-08 01:13:38,878 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2025-02-08 01:13:38,878 INFO L175 Difference]: Start difference. First operand has 73 places, 66 transitions, 320 flow. Second operand 3 states and 86 transitions. [2025-02-08 01:13:38,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 94 transitions, 613 flow [2025-02-08 01:13:38,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 94 transitions, 605 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 01:13:38,883 INFO L231 Difference]: Finished difference. Result has 75 places, 67 transitions, 333 flow [2025-02-08 01:13:38,883 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=333, PETRI_PLACES=75, PETRI_TRANSITIONS=67} [2025-02-08 01:13:38,883 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 14 predicate places. [2025-02-08 01:13:38,884 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 67 transitions, 333 flow [2025-02-08 01:13:38,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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:13:38,884 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:38,884 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:38,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 01:13:38,884 INFO L396 AbstractCegarLoop]: === Iteration 19 === 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:13:38,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:38,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1293977294, now seen corresponding path program 1 times [2025-02-08 01:13:38,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:38,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182642127] [2025-02-08 01:13:38,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:13:38,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:38,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-08 01:13:39,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-08 01:13:39,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:13:39,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:48,199 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:13:48,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:48,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182642127] [2025-02-08 01:13:48,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182642127] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:13:48,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000156999] [2025-02-08 01:13:48,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:13:48,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:13:48,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:13:48,202 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:13:48,205 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:13:48,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-08 01:13:48,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-08 01:13:48,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:13:48,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:48,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 86 conjuncts are in the unsatisfiable core [2025-02-08 01:13:48,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:13:48,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2025-02-08 01:13:48,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2025-02-08 01:13:48,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2025-02-08 01:13:48,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 46 [2025-02-08 01:13:48,620 INFO L349 Elim1Store]: treesize reduction 34, result has 12.8 percent of original size [2025-02-08 01:13:48,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 63 [2025-02-08 01:13:48,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:13:48,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2025-02-08 01:13:48,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 90 [2025-02-08 01:13:48,845 INFO L349 Elim1Store]: treesize reduction 127, result has 18.1 percent of original size [2025-02-08 01:13:48,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 90 treesize of output 117 [2025-02-08 01:13:49,010 INFO L349 Elim1Store]: treesize reduction 76, result has 39.7 percent of original size [2025-02-08 01:13:49,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 73 treesize of output 101 [2025-02-08 01:13:49,969 INFO L349 Elim1Store]: treesize reduction 246, result has 57.7 percent of original size [2025-02-08 01:13:49,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 45 case distinctions, treesize of input 209 treesize of output 445