./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 735b3cc8 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 20832c4ec3f8ccecbcf7cfcec0aecbbc925bfb9e6d8397db46b5825bb40681b3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:05:16,706 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:05:16,760 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-14 01:05:16,766 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:05:16,767 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:05:16,783 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:05:16,784 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:05:16,784 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:05:16,784 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-14 01:05:16,784 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-14 01:05:16,785 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:05:16,785 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:05:16,786 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:05:16,786 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:05:16,786 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:05:16,786 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:05:16,786 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:05:16,786 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:05:16,787 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:05:16,787 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:05:16,787 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:05:16,787 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:05:16,787 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:05:16,787 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:05:16,787 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:05:16,787 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:05:16,787 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:05:16,787 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:05:16,788 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:05:16,788 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:05:16,788 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-14 01:05:16,788 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:05:16,788 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:05:16,788 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:05:16,788 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:05:16,788 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:05:16,788 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:05:16,788 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:05:16,788 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:05:16,788 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:05:16,788 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:05:16,788 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:05:16,788 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:05:16,788 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 20832c4ec3f8ccecbcf7cfcec0aecbbc925bfb9e6d8397db46b5825bb40681b3 [2025-03-14 01:05:17,003 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:05:17,012 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:05:17,014 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:05:17,016 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:05:17,016 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:05:17,017 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c [2025-03-14 01:05:18,216 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d66d1856/0998df0f5cf248d8bfb66526b6eba459/FLAGf80ac4b3b [2025-03-14 01:05:18,402 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:05:18,409 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c [2025-03-14 01:05:18,418 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d66d1856/0998df0f5cf248d8bfb66526b6eba459/FLAGf80ac4b3b [2025-03-14 01:05:18,783 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d66d1856/0998df0f5cf248d8bfb66526b6eba459 [2025-03-14 01:05:18,785 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:05:18,786 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:05:18,787 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:05:18,787 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:05:18,791 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:05:18,792 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:05:18" (1/1) ... [2025-03-14 01:05:18,792 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f3b9ed3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:05:18, skipping insertion in model container [2025-03-14 01:05:18,793 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:05:18" (1/1) ... [2025-03-14 01:05:18,810 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:05:18,971 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c[2451,2464] [2025-03-14 01:05:18,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:05:18,995 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:05:19,017 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c[2451,2464] [2025-03-14 01:05:19,026 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:05:19,040 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:05:19,041 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:05:19 WrapperNode [2025-03-14 01:05:19,042 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:05:19,043 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:05:19,043 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:05:19,043 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:05:19,048 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:05:19" (1/1) ... [2025-03-14 01:05:19,054 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:05:19" (1/1) ... [2025-03-14 01:05:19,079 INFO L138 Inliner]: procedures = 25, calls = 30, calls flagged for inlining = 15, calls inlined = 27, statements flattened = 247 [2025-03-14 01:05:19,082 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:05:19,083 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:05:19,083 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:05:19,083 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:05:19,089 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:05:19" (1/1) ... [2025-03-14 01:05:19,089 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:05:19" (1/1) ... [2025-03-14 01:05:19,095 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:05:19" (1/1) ... [2025-03-14 01:05:19,115 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [2, 9]. 82 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2025-03-14 01:05:19,115 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:05:19" (1/1) ... [2025-03-14 01:05:19,116 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:05:19" (1/1) ... [2025-03-14 01:05:19,124 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:05:19" (1/1) ... [2025-03-14 01:05:19,128 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:05:19" (1/1) ... [2025-03-14 01:05:19,130 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:05:19" (1/1) ... [2025-03-14 01:05:19,130 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:05:19" (1/1) ... [2025-03-14 01:05:19,133 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:05:19,134 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:05:19,134 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:05:19,134 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:05:19,140 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:05:19" (1/1) ... [2025-03-14 01:05:19,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:05:19,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:05:19,168 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-14 01:05:19,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-14 01:05:19,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:05:19,189 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-14 01:05:19,189 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-14 01:05:19,189 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-14 01:05:19,189 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-14 01:05:19,189 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-14 01:05:19,189 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-14 01:05:19,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-14 01:05:19,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-14 01:05:19,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-14 01:05:19,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-14 01:05:19,189 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-14 01:05:19,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:05:19,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:05:19,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-14 01:05:19,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-14 01:05:19,191 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:05:19,275 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:05:19,277 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:05:19,670 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:05:19,670 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:05:19,670 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:05:19,978 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:05:19,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:05:19 BoogieIcfgContainer [2025-03-14 01:05:19,978 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:05:19,980 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:05:19,980 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:05:19,985 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:05:19,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:05:18" (1/3) ... [2025-03-14 01:05:19,986 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f056b1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:05:19, skipping insertion in model container [2025-03-14 01:05:19,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:05:19" (2/3) ... [2025-03-14 01:05:19,987 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f056b1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:05:19, skipping insertion in model container [2025-03-14 01:05:19,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:05:19" (3/3) ... [2025-03-14 01:05:19,988 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-three-array-sum-alt.wvr.c [2025-03-14 01:05:19,999 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:05:20,000 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-three-array-sum-alt.wvr.c that has 4 procedures, 26 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-03-14 01:05:20,001 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:05:20,044 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-14 01:05:20,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 31 transitions, 83 flow [2025-03-14 01:05:20,088 INFO L124 PetriNetUnfolderBase]: 6/28 cut-off events. [2025-03-14 01:05:20,090 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-14 01:05:20,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 28 events. 6/28 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 18 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2025-03-14 01:05:20,093 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 31 transitions, 83 flow [2025-03-14 01:05:20,096 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 27 transitions, 72 flow [2025-03-14 01:05:20,103 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:05:20,113 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;@35560bdf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:05:20,114 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-14 01:05:20,126 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:05:20,126 INFO L124 PetriNetUnfolderBase]: 6/26 cut-off events. [2025-03-14 01:05:20,126 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-14 01:05:20,126 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:05:20,128 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:05:20,128 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-03-14 01:05:20,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:05:20,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1448556374, now seen corresponding path program 1 times [2025-03-14 01:05:20,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:05:20,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640326575] [2025-03-14 01:05:20,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:05:20,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:05:20,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-14 01:05:20,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-14 01:05:20,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:05:20,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:05:20,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:05:20,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:05:20,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640326575] [2025-03-14 01:05:20,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640326575] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:05:20,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:05:20,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:05:20,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348014953] [2025-03-14 01:05:20,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:05:20,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:05:20,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:05:20,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:05:20,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:05:20,628 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-14 01:05:20,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 27 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:05:20,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:05:20,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-14 01:05:20,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:05:20,859 INFO L124 PetriNetUnfolderBase]: 389/571 cut-off events. [2025-03-14 01:05:20,860 INFO L125 PetriNetUnfolderBase]: For 73/73 co-relation queries the response was YES. [2025-03-14 01:05:20,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1218 conditions, 571 events. 389/571 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1778 event pairs, 124 based on Foata normal form. 1/419 useless extension candidates. Maximal degree in co-relation 1030. Up to 349 conditions per place. [2025-03-14 01:05:20,868 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 38 selfloop transitions, 4 changer transitions 1/44 dead transitions. [2025-03-14 01:05:20,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 44 transitions, 207 flow [2025-03-14 01:05:20,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:05:20,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:05:20,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2025-03-14 01:05:20,880 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6021505376344086 [2025-03-14 01:05:20,881 INFO L175 Difference]: Start difference. First operand has 31 places, 27 transitions, 72 flow. Second operand 3 states and 56 transitions. [2025-03-14 01:05:20,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 44 transitions, 207 flow [2025-03-14 01:05:20,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 44 transitions, 185 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-14 01:05:20,888 INFO L231 Difference]: Finished difference. Result has 28 places, 30 transitions, 86 flow [2025-03-14 01:05:20,890 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=28, PETRI_TRANSITIONS=30} [2025-03-14 01:05:20,892 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, -3 predicate places. [2025-03-14 01:05:20,892 INFO L471 AbstractCegarLoop]: Abstraction has has 28 places, 30 transitions, 86 flow [2025-03-14 01:05:20,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:05:20,892 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:05:20,893 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:05:20,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:05:20,893 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-03-14 01:05:20,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:05:20,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1097131067, now seen corresponding path program 1 times [2025-03-14 01:05:20,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:05:20,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579135873] [2025-03-14 01:05:20,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:05:20,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:05:20,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-14 01:05:20,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-14 01:05:20,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:05:20,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:05:21,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:05:21,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:05:21,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579135873] [2025-03-14 01:05:21,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579135873] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:05:21,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:05:21,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 01:05:21,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155818188] [2025-03-14 01:05:21,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:05:21,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:05:21,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:05:21,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:05:21,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:05:21,093 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-14 01:05:21,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 30 transitions, 86 flow. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:05:21,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:05:21,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-14 01:05:21,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:05:21,320 INFO L124 PetriNetUnfolderBase]: 727/1089 cut-off events. [2025-03-14 01:05:21,320 INFO L125 PetriNetUnfolderBase]: For 222/222 co-relation queries the response was YES. [2025-03-14 01:05:21,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2613 conditions, 1089 events. 727/1089 cut-off events. For 222/222 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3825 event pairs, 417 based on Foata normal form. 42/1123 useless extension candidates. Maximal degree in co-relation 918. Up to 571 conditions per place. [2025-03-14 01:05:21,325 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 58 selfloop transitions, 12 changer transitions 0/71 dead transitions. [2025-03-14 01:05:21,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 71 transitions, 338 flow [2025-03-14 01:05:21,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:05:21,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:05:21,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2025-03-14 01:05:21,327 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4731182795698925 [2025-03-14 01:05:21,327 INFO L175 Difference]: Start difference. First operand has 28 places, 30 transitions, 86 flow. Second operand 6 states and 88 transitions. [2025-03-14 01:05:21,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 71 transitions, 338 flow [2025-03-14 01:05:21,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 71 transitions, 330 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:05:21,329 INFO L231 Difference]: Finished difference. Result has 35 places, 40 transitions, 159 flow [2025-03-14 01:05:21,329 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=159, PETRI_PLACES=35, PETRI_TRANSITIONS=40} [2025-03-14 01:05:21,329 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 4 predicate places. [2025-03-14 01:05:21,329 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 40 transitions, 159 flow [2025-03-14 01:05:21,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:05:21,330 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:05:21,330 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:05:21,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:05:21,330 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-03-14 01:05:21,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:05:21,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1643168801, now seen corresponding path program 1 times [2025-03-14 01:05:21,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:05:21,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831907650] [2025-03-14 01:05:21,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:05:21,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:05:21,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-14 01:05:21,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-14 01:05:21,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:05:21,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:05:21,456 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:05:21,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:05:21,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831907650] [2025-03-14 01:05:21,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831907650] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:05:21,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:05:21,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 01:05:21,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704442445] [2025-03-14 01:05:21,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:05:21,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:05:21,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:05:21,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:05:21,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:05:21,459 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-14 01:05:21,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 40 transitions, 159 flow. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:05:21,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:05:21,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-14 01:05:21,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:05:21,656 INFO L124 PetriNetUnfolderBase]: 642/981 cut-off events. [2025-03-14 01:05:21,656 INFO L125 PetriNetUnfolderBase]: For 397/397 co-relation queries the response was YES. [2025-03-14 01:05:21,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2517 conditions, 981 events. 642/981 cut-off events. For 397/397 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3566 event pairs, 391 based on Foata normal form. 42/1021 useless extension candidates. Maximal degree in co-relation 1434. Up to 571 conditions per place. [2025-03-14 01:05:21,660 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 56 selfloop transitions, 12 changer transitions 0/69 dead transitions. [2025-03-14 01:05:21,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 69 transitions, 383 flow [2025-03-14 01:05:21,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:05:21,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:05:21,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2025-03-14 01:05:21,662 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4731182795698925 [2025-03-14 01:05:21,662 INFO L175 Difference]: Start difference. First operand has 35 places, 40 transitions, 159 flow. Second operand 6 states and 88 transitions. [2025-03-14 01:05:21,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 69 transitions, 383 flow [2025-03-14 01:05:21,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 69 transitions, 383 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:05:21,665 INFO L231 Difference]: Finished difference. Result has 42 places, 42 transitions, 201 flow [2025-03-14 01:05:21,665 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=201, PETRI_PLACES=42, PETRI_TRANSITIONS=42} [2025-03-14 01:05:21,665 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 11 predicate places. [2025-03-14 01:05:21,665 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 42 transitions, 201 flow [2025-03-14 01:05:21,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:05:21,666 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:05:21,666 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:05:21,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:05:21,666 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-03-14 01:05:21,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:05:21,666 INFO L85 PathProgramCache]: Analyzing trace with hash 695918506, now seen corresponding path program 1 times [2025-03-14 01:05:21,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:05:21,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379160286] [2025-03-14 01:05:21,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:05:21,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:05:21,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-14 01:05:21,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-14 01:05:21,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:05:21,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:05:21,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:05:21,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:05:21,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379160286] [2025-03-14 01:05:21,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379160286] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:05:21,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:05:21,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 01:05:21,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269598964] [2025-03-14 01:05:21,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:05:21,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:05:21,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:05:21,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:05:21,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:05:21,763 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-14 01:05:21,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 42 transitions, 201 flow. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:05:21,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:05:21,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-14 01:05:21,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:05:21,946 INFO L124 PetriNetUnfolderBase]: 517/796 cut-off events. [2025-03-14 01:05:21,947 INFO L125 PetriNetUnfolderBase]: For 635/635 co-relation queries the response was YES. [2025-03-14 01:05:21,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2294 conditions, 796 events. 517/796 cut-off events. For 635/635 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2710 event pairs, 324 based on Foata normal form. 27/821 useless extension candidates. Maximal degree in co-relation 1587. Up to 571 conditions per place. [2025-03-14 01:05:21,952 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 26 selfloop transitions, 6 changer transitions 30/63 dead transitions. [2025-03-14 01:05:21,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 63 transitions, 395 flow [2025-03-14 01:05:21,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:05:21,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:05:21,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2025-03-14 01:05:21,953 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45161290322580644 [2025-03-14 01:05:21,953 INFO L175 Difference]: Start difference. First operand has 42 places, 42 transitions, 201 flow. Second operand 6 states and 84 transitions. [2025-03-14 01:05:21,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 63 transitions, 395 flow [2025-03-14 01:05:21,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 63 transitions, 377 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-14 01:05:21,958 INFO L231 Difference]: Finished difference. Result has 46 places, 33 transitions, 148 flow [2025-03-14 01:05:21,958 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=148, PETRI_PLACES=46, PETRI_TRANSITIONS=33} [2025-03-14 01:05:21,959 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 15 predicate places. [2025-03-14 01:05:21,959 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 33 transitions, 148 flow [2025-03-14 01:05:21,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:05:21,959 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:05:21,959 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] [2025-03-14 01:05:21,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:05:21,960 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-03-14 01:05:21,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:05:21,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1926394084, now seen corresponding path program 1 times [2025-03-14 01:05:21,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:05:21,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464760674] [2025-03-14 01:05:21,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:05:21,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:05:21,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-14 01:05:21,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-14 01:05:21,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:05:21,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:05:22,099 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:05:22,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:05:22,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464760674] [2025-03-14 01:05:22,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464760674] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:05:22,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676395863] [2025-03-14 01:05:22,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:05:22,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:05:22,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:05:22,103 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:05:22,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-14 01:05:22,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-14 01:05:22,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-14 01:05:22,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:05:22,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:05:22,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-14 01:05:22,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:05:22,268 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:05:22,268 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:05:22,327 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:05:22,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [676395863] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 01:05:22,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 01:05:22,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2025-03-14 01:05:22,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507653334] [2025-03-14 01:05:22,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:05:22,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:05:22,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:05:22,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:05:22,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-14 01:05:22,329 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-14 01:05:22,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 33 transitions, 148 flow. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:05:22,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:05:22,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-14 01:05:22,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:05:22,455 INFO L124 PetriNetUnfolderBase]: 377/554 cut-off events. [2025-03-14 01:05:22,456 INFO L125 PetriNetUnfolderBase]: For 499/499 co-relation queries the response was YES. [2025-03-14 01:05:22,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1709 conditions, 554 events. 377/554 cut-off events. For 499/499 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1682 event pairs, 150 based on Foata normal form. 50/604 useless extension candidates. Maximal degree in co-relation 1663. Up to 385 conditions per place. [2025-03-14 01:05:22,459 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 40 selfloop transitions, 5 changer transitions 0/46 dead transitions. [2025-03-14 01:05:22,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 46 transitions, 292 flow [2025-03-14 01:05:22,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 01:05:22,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 01:05:22,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2025-03-14 01:05:22,460 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38064516129032255 [2025-03-14 01:05:22,460 INFO L175 Difference]: Start difference. First operand has 46 places, 33 transitions, 148 flow. Second operand 5 states and 59 transitions. [2025-03-14 01:05:22,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 46 transitions, 292 flow [2025-03-14 01:05:22,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 46 transitions, 240 flow, removed 20 selfloop flow, removed 8 redundant places. [2025-03-14 01:05:22,463 INFO L231 Difference]: Finished difference. Result has 35 places, 34 transitions, 133 flow [2025-03-14 01:05:22,464 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=133, PETRI_PLACES=35, PETRI_TRANSITIONS=34} [2025-03-14 01:05:22,464 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 4 predicate places. [2025-03-14 01:05:22,464 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 34 transitions, 133 flow [2025-03-14 01:05:22,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:05:22,464 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:05:22,464 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] [2025-03-14 01:05:22,475 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-14 01:05:22,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:05:22,669 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-03-14 01:05:22,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:05:22,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1847487957, now seen corresponding path program 1 times [2025-03-14 01:05:22,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:05:22,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795662239] [2025-03-14 01:05:22,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:05:22,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:05:22,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-14 01:05:22,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-14 01:05:22,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:05:22,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:05:22,816 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:05:22,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:05:22,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795662239] [2025-03-14 01:05:22,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795662239] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:05:22,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545200663] [2025-03-14 01:05:22,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:05:22,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:05:22,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:05:22,818 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:05:22,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-14 01:05:22,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-14 01:05:22,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-14 01:05:22,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:05:22,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:05:22,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-14 01:05:22,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:05:22,942 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:05:22,942 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:05:22,986 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:05:22,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1545200663] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 01:05:22,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 01:05:22,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2025-03-14 01:05:22,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458717892] [2025-03-14 01:05:22,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:05:22,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:05:22,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:05:22,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:05:22,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-14 01:05:22,989 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-14 01:05:22,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 34 transitions, 133 flow. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:05:22,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:05:22,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-14 01:05:22,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:05:23,112 INFO L124 PetriNetUnfolderBase]: 383/560 cut-off events. [2025-03-14 01:05:23,112 INFO L125 PetriNetUnfolderBase]: For 385/385 co-relation queries the response was YES. [2025-03-14 01:05:23,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1561 conditions, 560 events. 383/560 cut-off events. For 385/385 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1700 event pairs, 164 based on Foata normal form. 42/602 useless extension candidates. Maximal degree in co-relation 1521. Up to 418 conditions per place. [2025-03-14 01:05:23,115 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 43 selfloop transitions, 5 changer transitions 0/49 dead transitions. [2025-03-14 01:05:23,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 49 transitions, 286 flow [2025-03-14 01:05:23,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 01:05:23,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 01:05:23,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2025-03-14 01:05:23,117 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2025-03-14 01:05:23,117 INFO L175 Difference]: Start difference. First operand has 35 places, 34 transitions, 133 flow. Second operand 5 states and 60 transitions. [2025-03-14 01:05:23,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 49 transitions, 286 flow [2025-03-14 01:05:23,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 49 transitions, 268 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-03-14 01:05:23,118 INFO L231 Difference]: Finished difference. Result has 38 places, 35 transitions, 143 flow [2025-03-14 01:05:23,118 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=143, PETRI_PLACES=38, PETRI_TRANSITIONS=35} [2025-03-14 01:05:23,119 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 7 predicate places. [2025-03-14 01:05:23,119 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 35 transitions, 143 flow [2025-03-14 01:05:23,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:05:23,119 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:05:23,120 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:05:23,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-14 01:05:23,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-14 01:05:23,320 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-03-14 01:05:23,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:05:23,321 INFO L85 PathProgramCache]: Analyzing trace with hash -434277378, now seen corresponding path program 1 times [2025-03-14 01:05:23,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:05:23,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199853794] [2025-03-14 01:05:23,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:05:23,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:05:23,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-14 01:05:23,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-14 01:05:23,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:05:23,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:05:23,458 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-14 01:05:23,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:05:23,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199853794] [2025-03-14 01:05:23,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199853794] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:05:23,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170115395] [2025-03-14 01:05:23,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:05:23,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:05:23,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:05:23,461 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:05:23,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-14 01:05:23,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-14 01:05:23,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-14 01:05:23,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:05:23,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:05:23,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-14 01:05:23,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:05:23,618 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-14 01:05:23,619 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:05:23,664 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-14 01:05:23,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [170115395] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 01:05:23,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 01:05:23,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2025-03-14 01:05:23,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971016602] [2025-03-14 01:05:23,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:05:23,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:05:23,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:05:23,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:05:23,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-14 01:05:23,666 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-14 01:05:23,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 35 transitions, 143 flow. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:05:23,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:05:23,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-14 01:05:23,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:05:23,769 INFO L124 PetriNetUnfolderBase]: 432/630 cut-off events. [2025-03-14 01:05:23,770 INFO L125 PetriNetUnfolderBase]: For 563/563 co-relation queries the response was YES. [2025-03-14 01:05:23,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1892 conditions, 630 events. 432/630 cut-off events. For 563/563 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1832 event pairs, 202 based on Foata normal form. 37/667 useless extension candidates. Maximal degree in co-relation 1851. Up to 502 conditions per place. [2025-03-14 01:05:23,774 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 43 selfloop transitions, 5 changer transitions 0/49 dead transitions. [2025-03-14 01:05:23,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 49 transitions, 302 flow [2025-03-14 01:05:23,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 01:05:23,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 01:05:23,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2025-03-14 01:05:23,775 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3741935483870968 [2025-03-14 01:05:23,776 INFO L175 Difference]: Start difference. First operand has 38 places, 35 transitions, 143 flow. Second operand 5 states and 58 transitions. [2025-03-14 01:05:23,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 49 transitions, 302 flow [2025-03-14 01:05:23,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 49 transitions, 284 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-03-14 01:05:23,777 INFO L231 Difference]: Finished difference. Result has 40 places, 36 transitions, 153 flow [2025-03-14 01:05:23,777 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=153, PETRI_PLACES=40, PETRI_TRANSITIONS=36} [2025-03-14 01:05:23,777 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 9 predicate places. [2025-03-14 01:05:23,777 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 36 transitions, 153 flow [2025-03-14 01:05:23,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:05:23,777 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:05:23,778 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:05:23,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-14 01:05:23,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:05:23,978 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-03-14 01:05:23,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:05:23,979 INFO L85 PathProgramCache]: Analyzing trace with hash -884261679, now seen corresponding path program 1 times [2025-03-14 01:05:23,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:05:23,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050246273] [2025-03-14 01:05:23,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:05:23,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:05:23,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-14 01:05:24,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-14 01:05:24,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:05:24,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:05:25,372 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:05:25,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:05:25,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050246273] [2025-03-14 01:05:25,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050246273] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:05:25,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686287100] [2025-03-14 01:05:25,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:05:25,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:05:25,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:05:25,375 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:05:25,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-14 01:05:25,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-14 01:05:25,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-14 01:05:25,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:05:25,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:05:25,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-14 01:05:25,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:05:25,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-14 01:05:25,566 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-14 01:05:25,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-14 01:05:25,828 INFO L349 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2025-03-14 01:05:25,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 29 treesize of output 35 [2025-03-14 01:05:25,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2025-03-14 01:05:25,903 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:05:25,903 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:05:30,020 WARN L851 $PredicateComparison]: unable to prove that (forall ((~C~0.offset Int) (~B~0.offset Int)) (let ((.cse2 (* 4 |c_thread3Thread1of1ForFork2_~i~2#1|))) (let ((.cse0 (select (select |c_#memory_int#1| c_~B~0.base) (+ .cse2 ~B~0.offset))) (.cse1 (select (select |c_#memory_int#1| c_~A~0.base) (+ c_~A~0.offset .cse2)))) (= (+ .cse0 c_~csum~0 .cse1) (+ c_~asum~0 c_~bsum~0 (select (select (store |c_#memory_int#1| c_~C~0.base (store (select |c_#memory_int#1| c_~C~0.base) (+ .cse2 ~C~0.offset) (+ .cse0 .cse1))) c_~B~0.base) (+ (* |c_thread2Thread1of1ForFork0_~i~1#1| 4) ~B~0.offset))))))) is different from false [2025-03-14 01:05:34,113 WARN L851 $PredicateComparison]: unable to prove that (forall ((~C~0.offset Int) (~B~0.offset Int)) (let ((.cse0 (select (select |c_#memory_int#1| c_~A~0.base) c_~A~0.offset)) (.cse1 (select (select |c_#memory_int#1| c_~B~0.base) ~B~0.offset))) (= (+ c_~asum~0 (select (select (store |c_#memory_int#1| c_~C~0.base (store (select |c_#memory_int#1| c_~C~0.base) ~C~0.offset (+ .cse0 .cse1))) c_~B~0.base) (+ (* |c_thread2Thread1of1ForFork0_~i~1#1| 4) ~B~0.offset)) c_~bsum~0) (+ c_~csum~0 .cse0 .cse1)))) is different from false [2025-03-14 01:05:34,758 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:05:34,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 40 [2025-03-14 01:05:36,359 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2025-03-14 01:05:36,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1686287100] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:05:36,359 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:05:36,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 10] total 31 [2025-03-14 01:05:36,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128502488] [2025-03-14 01:05:36,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:05:36,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-14 01:05:36,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:05:36,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-14 01:05:36,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=741, Unknown=2, NotChecked=114, Total=992 [2025-03-14 01:05:36,361 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-14 01:05:36,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 36 transitions, 153 flow. Second operand has 32 states, 32 states have (on average 6.0625) internal successors, (194), 32 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:05:36,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:05:36,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-14 01:05:36,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:05:45,020 INFO L124 PetriNetUnfolderBase]: 618/900 cut-off events. [2025-03-14 01:05:45,020 INFO L125 PetriNetUnfolderBase]: For 687/687 co-relation queries the response was YES. [2025-03-14 01:05:45,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2854 conditions, 900 events. 618/900 cut-off events. For 687/687 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3034 event pairs, 27 based on Foata normal form. 1/901 useless extension candidates. Maximal degree in co-relation 2812. Up to 659 conditions per place. [2025-03-14 01:05:45,028 INFO L140 encePairwiseOnDemand]: 17/31 looper letters, 65 selfloop transitions, 30 changer transitions 1/97 dead transitions. [2025-03-14 01:05:45,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 97 transitions, 579 flow [2025-03-14 01:05:45,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-14 01:05:45,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-14 01:05:45,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 154 transitions. [2025-03-14 01:05:45,032 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3311827956989247 [2025-03-14 01:05:45,032 INFO L175 Difference]: Start difference. First operand has 40 places, 36 transitions, 153 flow. Second operand 15 states and 154 transitions. [2025-03-14 01:05:45,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 97 transitions, 579 flow [2025-03-14 01:05:45,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 97 transitions, 552 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-03-14 01:05:45,035 INFO L231 Difference]: Finished difference. Result has 55 places, 56 transitions, 334 flow [2025-03-14 01:05:45,035 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=334, PETRI_PLACES=55, PETRI_TRANSITIONS=56} [2025-03-14 01:05:45,035 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 24 predicate places. [2025-03-14 01:05:45,035 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 56 transitions, 334 flow [2025-03-14 01:05:45,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 6.0625) internal successors, (194), 32 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:05:45,035 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:05:45,035 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:05:45,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-14 01:05:45,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:05:45,236 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-03-14 01:05:45,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:05:45,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1349128031, now seen corresponding path program 2 times [2025-03-14 01:05:45,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:05:45,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21894735] [2025-03-14 01:05:45,237 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:05:45,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:05:45,246 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-14 01:05:45,289 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-14 01:05:45,290 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:05:45,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:05:48,671 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:05:48,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:05:48,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21894735] [2025-03-14 01:05:48,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21894735] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:05:48,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521458157] [2025-03-14 01:05:48,672 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:05:48,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:05:48,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:05:48,674 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:05:48,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-14 01:05:48,726 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-14 01:05:48,750 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-14 01:05:48,750 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:05:48,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:05:48,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-14 01:05:48,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:05:51,373 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:05:51,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 20 [2025-03-14 01:05:51,454 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:05:51,454 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:05:52,360 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:05:52,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 95 [2025-03-14 01:05:53,783 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:05:53,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [521458157] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:05:53,783 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:05:53,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 7] total 22 [2025-03-14 01:05:53,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590082139] [2025-03-14 01:05:53,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:05:53,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-14 01:05:53,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:05:53,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-14 01:05:53,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2025-03-14 01:05:53,784 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-14 01:05:53,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 56 transitions, 334 flow. Second operand has 23 states, 23 states have (on average 6.608695652173913) internal successors, (152), 23 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:05:53,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:05:53,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-14 01:05:53,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:06:00,473 INFO L124 PetriNetUnfolderBase]: 720/1047 cut-off events. [2025-03-14 01:06:00,473 INFO L125 PetriNetUnfolderBase]: For 1409/1409 co-relation queries the response was YES. [2025-03-14 01:06:00,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3928 conditions, 1047 events. 720/1047 cut-off events. For 1409/1409 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3593 event pairs, 117 based on Foata normal form. 1/1048 useless extension candidates. Maximal degree in co-relation 3878. Up to 894 conditions per place. [2025-03-14 01:06:00,479 INFO L140 encePairwiseOnDemand]: 17/31 looper letters, 69 selfloop transitions, 35 changer transitions 1/106 dead transitions. [2025-03-14 01:06:00,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 106 transitions, 788 flow [2025-03-14 01:06:00,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-14 01:06:00,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-14 01:06:00,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 141 transitions. [2025-03-14 01:06:00,480 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3032258064516129 [2025-03-14 01:06:00,480 INFO L175 Difference]: Start difference. First operand has 55 places, 56 transitions, 334 flow. Second operand 15 states and 141 transitions. [2025-03-14 01:06:00,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 106 transitions, 788 flow [2025-03-14 01:06:00,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 106 transitions, 715 flow, removed 21 selfloop flow, removed 4 redundant places. [2025-03-14 01:06:00,486 INFO L231 Difference]: Finished difference. Result has 71 places, 79 transitions, 544 flow [2025-03-14 01:06:00,486 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=544, PETRI_PLACES=71, PETRI_TRANSITIONS=79} [2025-03-14 01:06:00,487 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 40 predicate places. [2025-03-14 01:06:00,487 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 79 transitions, 544 flow [2025-03-14 01:06:00,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 6.608695652173913) internal successors, (152), 23 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:06:00,487 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:06:00,487 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:06:00,494 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-14 01:06:00,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:06:00,688 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-03-14 01:06:00,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:06:00,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1312267025, now seen corresponding path program 3 times [2025-03-14 01:06:00,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:06:00,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13889726] [2025-03-14 01:06:00,689 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:06:00,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:06:00,700 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 2 equivalence classes. [2025-03-14 01:06:00,744 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-14 01:06:00,745 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-14 01:06:00,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:06:04,135 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:06:04,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:06:04,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13889726] [2025-03-14 01:06:04,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13889726] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:06:04,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651694082] [2025-03-14 01:06:04,135 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:06:04,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:06:04,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:06:04,137 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:06:04,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-14 01:06:04,194 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 2 equivalence classes. [2025-03-14 01:06:04,221 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-14 01:06:04,221 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-14 01:06:04,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:06:04,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-14 01:06:04,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:06:06,960 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:06:06,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 20 [2025-03-14 01:06:07,056 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:06:07,057 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:06:08,128 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:06:08,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 87 [2025-03-14 01:06:09,528 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:06:09,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651694082] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:06:09,528 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:06:09,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 7] total 23 [2025-03-14 01:06:09,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101428370] [2025-03-14 01:06:09,528 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:06:09,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-14 01:06:09,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:06:09,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-14 01:06:09,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2025-03-14 01:06:09,529 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-14 01:06:09,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 79 transitions, 544 flow. Second operand has 24 states, 24 states have (on average 6.458333333333333) internal successors, (155), 24 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:06:09,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:06:09,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-14 01:06:09,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:06:15,949 INFO L124 PetriNetUnfolderBase]: 841/1221 cut-off events. [2025-03-14 01:06:15,949 INFO L125 PetriNetUnfolderBase]: For 2547/2547 co-relation queries the response was YES. [2025-03-14 01:06:15,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5054 conditions, 1221 events. 841/1221 cut-off events. For 2547/2547 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4342 event pairs, 144 based on Foata normal form. 1/1222 useless extension candidates. Maximal degree in co-relation 5002. Up to 1045 conditions per place. [2025-03-14 01:06:15,956 INFO L140 encePairwiseOnDemand]: 17/31 looper letters, 84 selfloop transitions, 45 changer transitions 1/131 dead transitions. [2025-03-14 01:06:15,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 131 transitions, 1081 flow [2025-03-14 01:06:15,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-14 01:06:15,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-14 01:06:15,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 146 transitions. [2025-03-14 01:06:15,959 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3139784946236559 [2025-03-14 01:06:15,959 INFO L175 Difference]: Start difference. First operand has 71 places, 79 transitions, 544 flow. Second operand 15 states and 146 transitions. [2025-03-14 01:06:15,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 131 transitions, 1081 flow [2025-03-14 01:06:15,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 131 transitions, 1035 flow, removed 17 selfloop flow, removed 6 redundant places. [2025-03-14 01:06:15,965 INFO L231 Difference]: Finished difference. Result has 84 places, 99 transitions, 817 flow [2025-03-14 01:06:15,965 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=817, PETRI_PLACES=84, PETRI_TRANSITIONS=99} [2025-03-14 01:06:15,965 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 53 predicate places. [2025-03-14 01:06:15,965 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 99 transitions, 817 flow [2025-03-14 01:06:15,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 6.458333333333333) internal successors, (155), 24 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:06:15,966 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:06:15,966 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:06:15,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-14 01:06:16,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:06:16,167 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-03-14 01:06:16,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:06:16,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1496992263, now seen corresponding path program 4 times [2025-03-14 01:06:16,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:06:16,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009054136] [2025-03-14 01:06:16,167 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:06:16,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:06:16,174 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-03-14 01:06:16,193 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-14 01:06:16,193 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-14 01:06:16,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:06:17,957 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:06:17,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:06:17,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009054136] [2025-03-14 01:06:17,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009054136] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:06:17,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1213512711] [2025-03-14 01:06:17,957 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:06:17,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:06:17,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:06:17,963 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:06:17,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-14 01:06:18,012 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-03-14 01:06:18,035 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-14 01:06:18,035 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-14 01:06:18,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:06:18,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-14 01:06:18,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:06:19,997 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:06:19,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 24 [2025-03-14 01:06:20,068 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:06:20,068 INFO L312 TraceCheckSpWp]: Computing backward predicates...