./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-deagle/arithmetic_prog_ok.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-deagle/arithmetic_prog_ok.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 29016034e4102bf62d4fcba069301a54da1d77dfd5739e4cf52e395ddaa22e38 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 04:45:14,322 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 04:45:14,356 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 04:45:14,360 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 04:45:14,360 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 04:45:14,373 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 04:45:14,374 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 04:45:14,374 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 04:45:14,374 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 04:45:14,374 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 04:45:14,374 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 04:45:14,374 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 04:45:14,374 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 04:45:14,375 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 04:45:14,375 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 04:45:14,375 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 04:45:14,375 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 04:45:14,375 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 04:45:14,375 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 04:45:14,375 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 04:45:14,375 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 04:45:14,375 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 04:45:14,375 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 04:45:14,375 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 04:45:14,376 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 04:45:14,376 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 04:45:14,376 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 04:45:14,376 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 04:45:14,376 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 04:45:14,376 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 04:45:14,376 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 04:45:14,376 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 04:45:14,376 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:45:14,376 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 04:45:14,376 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 04:45:14,377 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 04:45:14,377 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 04:45:14,377 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 04:45:14,377 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 04:45:14,377 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 04:45:14,377 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 04:45:14,377 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 04:45:14,377 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 04:45:14,377 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 29016034e4102bf62d4fcba069301a54da1d77dfd5739e4cf52e395ddaa22e38 [2025-02-06 04:45:14,609 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 04:45:14,614 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 04:45:14,615 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 04:45:14,616 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 04:45:14,616 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 04:45:14,617 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-deagle/arithmetic_prog_ok.i [2025-02-06 04:45:15,815 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f065670ad/e3cb60f4e2cf4dfab1786165fe5fef68/FLAG8065f8a79 [2025-02-06 04:45:16,192 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 04:45:16,193 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-deagle/arithmetic_prog_ok.i [2025-02-06 04:45:16,209 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f065670ad/e3cb60f4e2cf4dfab1786165fe5fef68/FLAG8065f8a79 [2025-02-06 04:45:16,455 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f065670ad/e3cb60f4e2cf4dfab1786165fe5fef68 [2025-02-06 04:45:16,456 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 04:45:16,457 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 04:45:16,458 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 04:45:16,458 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 04:45:16,461 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 04:45:16,461 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:45:16" (1/1) ... [2025-02-06 04:45:16,462 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d850ead and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:45:16, skipping insertion in model container [2025-02-06 04:45:16,462 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:45:16" (1/1) ... [2025-02-06 04:45:16,491 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 04:45:16,676 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-deagle/arithmetic_prog_ok.i[39757,39770] [2025-02-06 04:45:16,679 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:45:16,692 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 04:45:16,726 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-deagle/arithmetic_prog_ok.i[39757,39770] [2025-02-06 04:45:16,727 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:45:16,762 INFO L204 MainTranslator]: Completed translation [2025-02-06 04:45:16,763 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:45:16 WrapperNode [2025-02-06 04:45:16,763 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 04:45:16,765 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 04:45:16,765 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 04:45:16,765 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 04:45:16,770 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:45:16" (1/1) ... [2025-02-06 04:45:16,784 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:45:16" (1/1) ... [2025-02-06 04:45:16,802 INFO L138 Inliner]: procedures = 243, calls = 26, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 260 [2025-02-06 04:45:16,802 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 04:45:16,803 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 04:45:16,803 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 04:45:16,803 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 04:45:16,809 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:45:16" (1/1) ... [2025-02-06 04:45:16,809 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:45:16" (1/1) ... [2025-02-06 04:45:16,811 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:45:16" (1/1) ... [2025-02-06 04:45:16,823 INFO L175 MemorySlicer]: Split 11 memory accesses to 3 slices as follows [2, 1, 8]. 73 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 1, 8]. The 0 writes are split as follows [0, 0, 0]. [2025-02-06 04:45:16,823 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:45:16" (1/1) ... [2025-02-06 04:45:16,823 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:45:16" (1/1) ... [2025-02-06 04:45:16,829 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:45:16" (1/1) ... [2025-02-06 04:45:16,830 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:45:16" (1/1) ... [2025-02-06 04:45:16,831 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:45:16" (1/1) ... [2025-02-06 04:45:16,831 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:45:16" (1/1) ... [2025-02-06 04:45:16,833 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 04:45:16,834 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 04:45:16,834 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 04:45:16,834 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 04:45:16,835 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:45:16" (1/1) ... [2025-02-06 04:45:16,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:45:16,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:45:16,859 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 04:45:16,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 04:45:16,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-06 04:45:16,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-06 04:45:16,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-06 04:45:16,880 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 04:45:16,880 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-06 04:45:16,880 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-06 04:45:16,880 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-06 04:45:16,880 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-06 04:45:16,880 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 04:45:16,880 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 04:45:16,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 04:45:16,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 04:45:16,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 04:45:16,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 04:45:16,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 04:45:16,882 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 04:45:17,018 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 04:45:17,020 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 04:45:17,309 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 04:45:17,309 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 04:45:17,831 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 04:45:17,831 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 04:45:17,832 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:45:17 BoogieIcfgContainer [2025-02-06 04:45:17,832 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 04:45:17,833 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 04:45:17,833 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 04:45:17,836 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 04:45:17,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:45:16" (1/3) ... [2025-02-06 04:45:17,837 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d68e5dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:45:17, skipping insertion in model container [2025-02-06 04:45:17,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:45:16" (2/3) ... [2025-02-06 04:45:17,837 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d68e5dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:45:17, skipping insertion in model container [2025-02-06 04:45:17,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:45:17" (3/3) ... [2025-02-06 04:45:17,838 INFO L128 eAbstractionObserver]: Analyzing ICFG arithmetic_prog_ok.i [2025-02-06 04:45:17,854 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 04:45:17,855 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG arithmetic_prog_ok.i that has 3 procedures, 33 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-02-06 04:45:17,855 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 04:45:17,896 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 04:45:17,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 38 transitions, 90 flow [2025-02-06 04:45:17,976 INFO L124 PetriNetUnfolderBase]: 6/36 cut-off events. [2025-02-06 04:45:17,977 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 04:45:17,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 36 events. 6/36 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 60 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 27. Up to 3 conditions per place. [2025-02-06 04:45:17,979 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 38 transitions, 90 flow [2025-02-06 04:45:17,981 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 32 transitions, 76 flow [2025-02-06 04:45:17,989 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:45:17,996 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;@25182a8c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:45:17,996 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-02-06 04:45:18,023 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 04:45:18,023 INFO L124 PetriNetUnfolderBase]: 4/31 cut-off events. [2025-02-06 04:45:18,023 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 04:45:18,024 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:45:18,024 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:45:18,025 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:45:18,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:45:18,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1139875989, now seen corresponding path program 1 times [2025-02-06 04:45:18,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:45:18,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839650183] [2025-02-06 04:45:18,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:45:18,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:45:18,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 04:45:18,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 04:45:18,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:45:18,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:45:18,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:45:18,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:45:18,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839650183] [2025-02-06 04:45:18,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839650183] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:45:18,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:45:18,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 04:45:18,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172454064] [2025-02-06 04:45:18,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:45:18,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:45:18,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:45:18,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:45:18,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:45:18,629 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 38 [2025-02-06 04:45:18,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 32 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:45:18,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:45:18,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 38 [2025-02-06 04:45:18,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:45:18,807 INFO L124 PetriNetUnfolderBase]: 414/749 cut-off events. [2025-02-06 04:45:18,808 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2025-02-06 04:45:18,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1424 conditions, 749 events. 414/749 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3334 event pairs, 160 based on Foata normal form. 17/754 useless extension candidates. Maximal degree in co-relation 1336. Up to 394 conditions per place. [2025-02-06 04:45:18,814 INFO L140 encePairwiseOnDemand]: 35/38 looper letters, 37 selfloop transitions, 2 changer transitions 0/48 dead transitions. [2025-02-06 04:45:18,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 48 transitions, 189 flow [2025-02-06 04:45:18,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:45:18,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:45:18,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2025-02-06 04:45:18,824 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6929824561403509 [2025-02-06 04:45:18,825 INFO L175 Difference]: Start difference. First operand has 35 places, 32 transitions, 76 flow. Second operand 3 states and 79 transitions. [2025-02-06 04:45:18,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 48 transitions, 189 flow [2025-02-06 04:45:18,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 48 transitions, 179 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 04:45:18,832 INFO L231 Difference]: Finished difference. Result has 34 places, 33 transitions, 80 flow [2025-02-06 04:45:18,834 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=34, PETRI_TRANSITIONS=33} [2025-02-06 04:45:18,837 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, -1 predicate places. [2025-02-06 04:45:18,838 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 33 transitions, 80 flow [2025-02-06 04:45:18,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:45:18,838 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:45:18,838 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:45:18,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 04:45:18,839 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:45:18,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:45:18,840 INFO L85 PathProgramCache]: Analyzing trace with hash 828176399, now seen corresponding path program 1 times [2025-02-06 04:45:18,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:45:18,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022592558] [2025-02-06 04:45:18,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:45:18,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:45:19,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 04:45:19,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 04:45:19,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:45:19,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:45:19,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 04:45:19,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:45:19,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022592558] [2025-02-06 04:45:19,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022592558] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:45:19,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:45:19,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 04:45:19,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050528725] [2025-02-06 04:45:19,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:45:19,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:45:19,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:45:19,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:45:19,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:45:19,170 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 38 [2025-02-06 04:45:19,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 33 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:45:19,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:45:19,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 38 [2025-02-06 04:45:19,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:45:19,369 INFO L124 PetriNetUnfolderBase]: 735/1332 cut-off events. [2025-02-06 04:45:19,369 INFO L125 PetriNetUnfolderBase]: For 124/124 co-relation queries the response was YES. [2025-02-06 04:45:19,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2607 conditions, 1332 events. 735/1332 cut-off events. For 124/124 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 6879 event pairs, 295 based on Foata normal form. 30/1339 useless extension candidates. Maximal degree in co-relation 500. Up to 669 conditions per place. [2025-02-06 04:45:19,375 INFO L140 encePairwiseOnDemand]: 35/38 looper letters, 40 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2025-02-06 04:45:19,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 51 transitions, 211 flow [2025-02-06 04:45:19,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:45:19,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:45:19,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2025-02-06 04:45:19,376 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7017543859649122 [2025-02-06 04:45:19,376 INFO L175 Difference]: Start difference. First operand has 34 places, 33 transitions, 80 flow. Second operand 3 states and 80 transitions. [2025-02-06 04:45:19,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 51 transitions, 211 flow [2025-02-06 04:45:19,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 51 transitions, 207 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 04:45:19,378 INFO L231 Difference]: Finished difference. Result has 36 places, 34 transitions, 90 flow [2025-02-06 04:45:19,378 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=36, PETRI_TRANSITIONS=34} [2025-02-06 04:45:19,378 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 1 predicate places. [2025-02-06 04:45:19,378 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 34 transitions, 90 flow [2025-02-06 04:45:19,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:45:19,379 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:45:19,379 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-02-06 04:45:19,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 04:45:19,379 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:45:19,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:45:19,379 INFO L85 PathProgramCache]: Analyzing trace with hash 188298621, now seen corresponding path program 1 times [2025-02-06 04:45:19,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:45:19,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197401721] [2025-02-06 04:45:19,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:45:19,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:45:19,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 04:45:19,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 04:45:19,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:45:19,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:45:19,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:45:19,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:45:19,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197401721] [2025-02-06 04:45:19,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197401721] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:45:19,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040701588] [2025-02-06 04:45:19,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:45:19,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:45:19,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:45:19,644 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:45:19,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 04:45:19,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 04:45:20,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 04:45:20,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:45:20,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:45:20,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 04:45:20,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:45:20,089 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:45:20,092 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:45:20,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:45:20,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2040701588] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:45:20,145 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:45:20,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-06 04:45:20,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802753330] [2025-02-06 04:45:20,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:45:20,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 04:45:20,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:45:20,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 04:45:20,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 04:45:20,155 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 38 [2025-02-06 04:45:20,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 34 transitions, 90 flow. Second operand has 7 states, 7 states have (on average 17.571428571428573) internal successors, (123), 7 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:45:20,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:45:20,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 38 [2025-02-06 04:45:20,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:45:20,501 INFO L124 PetriNetUnfolderBase]: 1533/2646 cut-off events. [2025-02-06 04:45:20,502 INFO L125 PetriNetUnfolderBase]: For 312/312 co-relation queries the response was YES. [2025-02-06 04:45:20,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5456 conditions, 2646 events. 1533/2646 cut-off events. For 312/312 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 13505 event pairs, 118 based on Foata normal form. 90/2724 useless extension candidates. Maximal degree in co-relation 2026. Up to 548 conditions per place. [2025-02-06 04:45:20,519 INFO L140 encePairwiseOnDemand]: 34/38 looper letters, 89 selfloop transitions, 6 changer transitions 0/103 dead transitions. [2025-02-06 04:45:20,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 103 transitions, 458 flow [2025-02-06 04:45:20,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:45:20,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 04:45:20,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 165 transitions. [2025-02-06 04:45:20,522 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7236842105263158 [2025-02-06 04:45:20,522 INFO L175 Difference]: Start difference. First operand has 36 places, 34 transitions, 90 flow. Second operand 6 states and 165 transitions. [2025-02-06 04:45:20,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 103 transitions, 458 flow [2025-02-06 04:45:20,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 103 transitions, 456 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 04:45:20,527 INFO L231 Difference]: Finished difference. Result has 44 places, 37 transitions, 128 flow [2025-02-06 04:45:20,527 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=128, PETRI_PLACES=44, PETRI_TRANSITIONS=37} [2025-02-06 04:45:20,527 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 9 predicate places. [2025-02-06 04:45:20,528 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 128 flow [2025-02-06 04:45:20,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.571428571428573) internal successors, (123), 7 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:45:20,529 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:45:20,529 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:45:20,541 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 04:45:20,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:45:20,730 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:45:20,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:45:20,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1724257493, now seen corresponding path program 2 times [2025-02-06 04:45:20,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:45:20,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554561334] [2025-02-06 04:45:20,732 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:45:20,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:45:20,897 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-02-06 04:45:20,922 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-02-06 04:45:20,922 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:45:20,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:45:21,031 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 24 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-06 04:45:21,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:45:21,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554561334] [2025-02-06 04:45:21,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554561334] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:45:21,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004193324] [2025-02-06 04:45:21,033 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:45:21,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:45:21,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:45:21,036 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:45:21,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 04:45:21,294 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-02-06 04:45:21,357 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-02-06 04:45:21,358 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:45:21,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:45:21,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 04:45:21,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:45:21,385 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-06 04:45:21,385 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:45:21,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1004193324] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:45:21,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 04:45:21,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-02-06 04:45:21,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534914860] [2025-02-06 04:45:21,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:45:21,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:45:21,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:45:21,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:45:21,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:45:21,390 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 38 [2025-02-06 04:45:21,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 128 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:45:21,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:45:21,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 38 [2025-02-06 04:45:21,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:45:21,647 INFO L124 PetriNetUnfolderBase]: 1854/3262 cut-off events. [2025-02-06 04:45:21,648 INFO L125 PetriNetUnfolderBase]: For 1062/1062 co-relation queries the response was YES. [2025-02-06 04:45:21,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7249 conditions, 3262 events. 1854/3262 cut-off events. For 1062/1062 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 15783 event pairs, 445 based on Foata normal form. 0/3055 useless extension candidates. Maximal degree in co-relation 5313. Up to 1593 conditions per place. [2025-02-06 04:45:21,661 INFO L140 encePairwiseOnDemand]: 33/38 looper letters, 49 selfloop transitions, 4 changer transitions 0/61 dead transitions. [2025-02-06 04:45:21,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 61 transitions, 324 flow [2025-02-06 04:45:21,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:45:21,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 04:45:21,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2025-02-06 04:45:21,664 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5986842105263158 [2025-02-06 04:45:21,664 INFO L175 Difference]: Start difference. First operand has 44 places, 37 transitions, 128 flow. Second operand 4 states and 91 transitions. [2025-02-06 04:45:21,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 61 transitions, 324 flow [2025-02-06 04:45:21,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 61 transitions, 309 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-02-06 04:45:21,669 INFO L231 Difference]: Finished difference. Result has 48 places, 39 transitions, 145 flow [2025-02-06 04:45:21,669 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=145, PETRI_PLACES=48, PETRI_TRANSITIONS=39} [2025-02-06 04:45:21,670 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 13 predicate places. [2025-02-06 04:45:21,670 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 145 flow [2025-02-06 04:45:21,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:45:21,670 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:45:21,670 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:45:21,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 04:45:21,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:45:21,871 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:45:21,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:45:21,872 INFO L85 PathProgramCache]: Analyzing trace with hash 694048049, now seen corresponding path program 3 times [2025-02-06 04:45:21,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:45:21,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592902221] [2025-02-06 04:45:21,872 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:45:21,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:45:22,003 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 4 equivalence classes. [2025-02-06 04:45:22,037 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 44 of 56 statements. [2025-02-06 04:45:22,037 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-06 04:45:22,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:45:22,203 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 04:45:22,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:45:22,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592902221] [2025-02-06 04:45:22,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592902221] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:45:22,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:45:22,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:45:22,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676300788] [2025-02-06 04:45:22,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:45:22,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:45:22,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:45:22,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:45:22,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:45:22,206 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 38 [2025-02-06 04:45:22,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 145 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:45:22,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:45:22,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 38 [2025-02-06 04:45:22,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:45:22,385 INFO L124 PetriNetUnfolderBase]: 777/1670 cut-off events. [2025-02-06 04:45:22,385 INFO L125 PetriNetUnfolderBase]: For 959/959 co-relation queries the response was YES. [2025-02-06 04:45:22,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4024 conditions, 1670 events. 777/1670 cut-off events. For 959/959 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 7766 event pairs, 214 based on Foata normal form. 126/1795 useless extension candidates. Maximal degree in co-relation 2856. Up to 595 conditions per place. [2025-02-06 04:45:22,391 INFO L140 encePairwiseOnDemand]: 28/38 looper letters, 42 selfloop transitions, 15 changer transitions 0/67 dead transitions. [2025-02-06 04:45:22,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 67 transitions, 386 flow [2025-02-06 04:45:22,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:45:22,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:45:22,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2025-02-06 04:45:22,393 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5473684210526316 [2025-02-06 04:45:22,393 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 145 flow. Second operand 5 states and 104 transitions. [2025-02-06 04:45:22,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 67 transitions, 386 flow [2025-02-06 04:45:22,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 67 transitions, 385 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 04:45:22,395 INFO L231 Difference]: Finished difference. Result has 51 places, 44 transitions, 186 flow [2025-02-06 04:45:22,395 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=186, PETRI_PLACES=51, PETRI_TRANSITIONS=44} [2025-02-06 04:45:22,396 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 16 predicate places. [2025-02-06 04:45:22,396 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 44 transitions, 186 flow [2025-02-06 04:45:22,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:45:22,396 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:45:22,396 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:45:22,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 04:45:22,396 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:45:22,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:45:22,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1404627181, now seen corresponding path program 4 times [2025-02-06 04:45:22,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:45:22,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107071775] [2025-02-06 04:45:22,397 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 04:45:22,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:45:22,523 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-02-06 04:45:22,536 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-02-06 04:45:22,536 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 04:45:22,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:45:22,612 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 04:45:22,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:45:22,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107071775] [2025-02-06 04:45:22,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107071775] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:45:22,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742505672] [2025-02-06 04:45:22,612 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 04:45:22,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:45:22,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:45:22,615 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:45:22,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 04:45:22,960 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-02-06 04:45:22,990 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-02-06 04:45:22,990 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 04:45:22,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:45:22,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 04:45:22,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:45:23,086 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 04:45:23,086 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:45:23,170 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 04:45:23,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1742505672] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:45:23,175 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:45:23,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2025-02-06 04:45:23,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187070961] [2025-02-06 04:45:23,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:45:23,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 04:45:23,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:45:23,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 04:45:23,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 04:45:23,179 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 38 [2025-02-06 04:45:23,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 44 transitions, 186 flow. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 7 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:45:23,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:45:23,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 38 [2025-02-06 04:45:23,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:45:23,646 INFO L124 PetriNetUnfolderBase]: 1854/3711 cut-off events. [2025-02-06 04:45:23,647 INFO L125 PetriNetUnfolderBase]: For 2610/2626 co-relation queries the response was YES. [2025-02-06 04:45:23,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10100 conditions, 3711 events. 1854/3711 cut-off events. For 2610/2626 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 21043 event pairs, 179 based on Foata normal form. 207/3912 useless extension candidates. Maximal degree in co-relation 7945. Up to 1072 conditions per place. [2025-02-06 04:45:23,666 INFO L140 encePairwiseOnDemand]: 34/38 looper letters, 97 selfloop transitions, 6 changer transitions 0/113 dead transitions. [2025-02-06 04:45:23,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 113 transitions, 710 flow [2025-02-06 04:45:23,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:45:23,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 04:45:23,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 157 transitions. [2025-02-06 04:45:23,669 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6885964912280702 [2025-02-06 04:45:23,669 INFO L175 Difference]: Start difference. First operand has 51 places, 44 transitions, 186 flow. Second operand 6 states and 157 transitions. [2025-02-06 04:45:23,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 113 transitions, 710 flow [2025-02-06 04:45:23,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 113 transitions, 710 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 04:45:23,676 INFO L231 Difference]: Finished difference. Result has 60 places, 47 transitions, 232 flow [2025-02-06 04:45:23,676 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=232, PETRI_PLACES=60, PETRI_TRANSITIONS=47} [2025-02-06 04:45:23,677 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 25 predicate places. [2025-02-06 04:45:23,677 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 47 transitions, 232 flow [2025-02-06 04:45:23,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 7 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:45:23,677 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:45:23,678 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:45:23,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 04:45:23,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:45:23,882 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:45:23,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:45:23,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1978039887, now seen corresponding path program 5 times [2025-02-06 04:45:23,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:45:23,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423523412] [2025-02-06 04:45:23,884 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 04:45:23,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:45:24,072 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 62 statements into 6 equivalence classes. [2025-02-06 04:45:24,091 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 04:45:24,091 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-02-06 04:45:24,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:45:24,428 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 29 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 04:45:24,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:45:24,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423523412] [2025-02-06 04:45:24,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423523412] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:45:24,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345669822] [2025-02-06 04:45:24,429 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 04:45:24,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:45:24,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:45:24,431 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:45:24,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 04:45:24,728 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 62 statements into 6 equivalence classes. [2025-02-06 04:45:24,776 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 04:45:24,776 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-02-06 04:45:24,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:45:24,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-06 04:45:24,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:45:24,827 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 04:45:24,827 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:45:24,874 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 04:45:24,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345669822] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:45:24,875 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:45:24,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 5 [2025-02-06 04:45:24,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364451206] [2025-02-06 04:45:24,875 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:45:24,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:45:24,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:45:24,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:45:24,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:45:24,877 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 38 [2025-02-06 04:45:24,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 47 transitions, 232 flow. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:45:24,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:45:24,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 38 [2025-02-06 04:45:24,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:45:24,996 INFO L124 PetriNetUnfolderBase]: 544/1202 cut-off events. [2025-02-06 04:45:24,996 INFO L125 PetriNetUnfolderBase]: For 1587/1589 co-relation queries the response was YES. [2025-02-06 04:45:24,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3691 conditions, 1202 events. 544/1202 cut-off events. For 1587/1589 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4906 event pairs, 151 based on Foata normal form. 0/1200 useless extension candidates. Maximal degree in co-relation 2032. Up to 530 conditions per place. [2025-02-06 04:45:25,002 INFO L140 encePairwiseOnDemand]: 34/38 looper letters, 53 selfloop transitions, 3 changer transitions 3/68 dead transitions. [2025-02-06 04:45:25,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 68 transitions, 473 flow [2025-02-06 04:45:25,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:45:25,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 04:45:25,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2025-02-06 04:45:25,002 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5592105263157895 [2025-02-06 04:45:25,002 INFO L175 Difference]: Start difference. First operand has 60 places, 47 transitions, 232 flow. Second operand 4 states and 85 transitions. [2025-02-06 04:45:25,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 68 transitions, 473 flow [2025-02-06 04:45:25,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 68 transitions, 457 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-02-06 04:45:25,005 INFO L231 Difference]: Finished difference. Result has 62 places, 44 transitions, 216 flow [2025-02-06 04:45:25,005 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=216, PETRI_PLACES=62, PETRI_TRANSITIONS=44} [2025-02-06 04:45:25,006 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 27 predicate places. [2025-02-06 04:45:25,006 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 44 transitions, 216 flow [2025-02-06 04:45:25,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:45:25,006 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:45:25,006 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:45:25,017 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 04:45:25,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-02-06 04:45:25,207 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:45:25,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:45:25,208 INFO L85 PathProgramCache]: Analyzing trace with hash -361909729, now seen corresponding path program 6 times [2025-02-06 04:45:25,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:45:25,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315293079] [2025-02-06 04:45:25,208 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 04:45:25,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:45:25,422 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 62 statements into 3 equivalence classes. [2025-02-06 04:45:25,462 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 04:45:25,466 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-02-06 04:45:25,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:45:25,861 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:45:25,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:45:25,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315293079] [2025-02-06 04:45:25,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315293079] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:45:25,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510810578] [2025-02-06 04:45:25,862 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 04:45:25,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:45:25,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:45:25,864 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:45:25,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 04:45:26,174 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 62 statements into 3 equivalence classes. [2025-02-06 04:45:26,265 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 04:45:26,266 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-02-06 04:45:26,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:45:26,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-06 04:45:26,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:45:26,518 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:45:26,519 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:45:26,815 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:45:26,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1510810578] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:45:26,816 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:45:26,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 30 [2025-02-06 04:45:26,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051754303] [2025-02-06 04:45:26,816 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:45:26,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-02-06 04:45:26,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:45:26,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-02-06 04:45:26,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2025-02-06 04:45:26,965 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 38 [2025-02-06 04:45:26,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 44 transitions, 216 flow. Second operand has 31 states, 31 states have (on average 14.129032258064516) internal successors, (438), 31 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:45:26,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:45:26,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 38 [2025-02-06 04:45:26,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:45:28,029 INFO L124 PetriNetUnfolderBase]: 585/1253 cut-off events. [2025-02-06 04:45:28,030 INFO L125 PetriNetUnfolderBase]: For 1567/1567 co-relation queries the response was YES. [2025-02-06 04:45:28,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3818 conditions, 1253 events. 585/1253 cut-off events. For 1567/1567 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 5111 event pairs, 35 based on Foata normal form. 30/1279 useless extension candidates. Maximal degree in co-relation 2328. Up to 240 conditions per place. [2025-02-06 04:45:28,034 INFO L140 encePairwiseOnDemand]: 31/38 looper letters, 0 selfloop transitions, 0 changer transitions 130/130 dead transitions. [2025-02-06 04:45:28,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 130 transitions, 884 flow [2025-02-06 04:45:28,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 04:45:28,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-06 04:45:28,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 238 transitions. [2025-02-06 04:45:28,035 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5219298245614035 [2025-02-06 04:45:28,035 INFO L175 Difference]: Start difference. First operand has 62 places, 44 transitions, 216 flow. Second operand 12 states and 238 transitions. [2025-02-06 04:45:28,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 130 transitions, 884 flow [2025-02-06 04:45:28,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 130 transitions, 852 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 04:45:28,038 INFO L231 Difference]: Finished difference. Result has 67 places, 0 transitions, 0 flow [2025-02-06 04:45:28,039 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=0, PETRI_PLACES=67, PETRI_TRANSITIONS=0} [2025-02-06 04:45:28,039 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 32 predicate places. [2025-02-06 04:45:28,039 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 0 transitions, 0 flow [2025-02-06 04:45:28,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 14.129032258064516) internal successors, (438), 31 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:45:28,041 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-02-06 04:45:28,042 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-02-06 04:45:28,042 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-02-06 04:45:28,052 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 04:45:28,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:45:28,246 INFO L422 BasicCegarLoop]: Path program histogram: [6, 1, 1] [2025-02-06 04:45:28,249 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 04:45:28,249 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 04:45:28,253 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 04:45:28 BasicIcfg [2025-02-06 04:45:28,253 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 04:45:28,253 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 04:45:28,253 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 04:45:28,254 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 04:45:28,254 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:45:17" (3/4) ... [2025-02-06 04:45:28,256 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 04:45:28,258 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-06 04:45:28,258 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-06 04:45:28,266 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 141 nodes and edges [2025-02-06 04:45:28,266 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 69 nodes and edges [2025-02-06 04:45:28,267 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 34 nodes and edges [2025-02-06 04:45:28,267 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-02-06 04:45:28,267 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-02-06 04:45:28,267 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-06 04:45:28,268 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 04:45:28,332 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 04:45:28,333 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 04:45:28,333 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 04:45:28,333 INFO L158 Benchmark]: Toolchain (without parser) took 11875.91ms. Allocated memory was 142.6MB in the beginning and 755.0MB in the end (delta: 612.4MB). Free memory was 108.1MB in the beginning and 429.7MB in the end (delta: -321.6MB). Peak memory consumption was 288.6MB. Max. memory is 16.1GB. [2025-02-06 04:45:28,333 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 127.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:45:28,334 INFO L158 Benchmark]: CACSL2BoogieTranslator took 305.97ms. Allocated memory is still 142.6MB. Free memory was 108.1MB in the beginning and 79.8MB in the end (delta: 28.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 04:45:28,334 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.92ms. Allocated memory is still 142.6MB. Free memory was 79.8MB in the beginning and 78.0MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:45:28,334 INFO L158 Benchmark]: Boogie Preprocessor took 30.47ms. Allocated memory is still 142.6MB. Free memory was 78.0MB in the beginning and 74.2MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:45:28,334 INFO L158 Benchmark]: IcfgBuilder took 998.03ms. Allocated memory is still 142.6MB. Free memory was 74.2MB in the beginning and 60.0MB in the end (delta: 14.2MB). Peak memory consumption was 60.9MB. Max. memory is 16.1GB. [2025-02-06 04:45:28,334 INFO L158 Benchmark]: TraceAbstraction took 10419.65ms. Allocated memory was 142.6MB in the beginning and 755.0MB in the end (delta: 612.4MB). Free memory was 59.1MB in the beginning and 441.5MB in the end (delta: -382.4MB). Peak memory consumption was 227.7MB. Max. memory is 16.1GB. [2025-02-06 04:45:28,335 INFO L158 Benchmark]: Witness Printer took 79.37ms. Allocated memory is still 755.0MB. Free memory was 441.5MB in the beginning and 429.7MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 04:45:28,335 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 127.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 305.97ms. Allocated memory is still 142.6MB. Free memory was 108.1MB in the beginning and 79.8MB in the end (delta: 28.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.92ms. Allocated memory is still 142.6MB. Free memory was 79.8MB in the beginning and 78.0MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.47ms. Allocated memory is still 142.6MB. Free memory was 78.0MB in the beginning and 74.2MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 998.03ms. Allocated memory is still 142.6MB. Free memory was 74.2MB in the beginning and 60.0MB in the end (delta: 14.2MB). Peak memory consumption was 60.9MB. Max. memory is 16.1GB. * TraceAbstraction took 10419.65ms. Allocated memory was 142.6MB in the beginning and 755.0MB in the end (delta: 612.4MB). Free memory was 59.1MB in the beginning and 441.5MB in the end (delta: -382.4MB). Peak memory consumption was 227.7MB. Max. memory is 16.1GB. * Witness Printer took 79.37ms. Allocated memory is still 755.0MB. Free memory was 441.5MB in the beginning and 429.7MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 919]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 55 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 10.3s, OverallIterations: 8, TraceHistogramMax: 4, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 419 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 406 mSDsluCounter, 6 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3324 IncrementalHoareTripleChecker+Invalid, 3345 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 2 mSDtfsCounter, 3324 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 493 GetRequests, 438 SyntacticMatches, 4 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=232occurred in iteration=6, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 590 NumberOfCodeBlocks, 574 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 779 ConstructedInterpolants, 0 QuantifiedInterpolants, 2619 SizeOfPredicates, 1 NumberOfNonLiveVariables, 2149 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 17 InterpolantComputations, 4 PerfectInterpolantSequences, 228/512 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-06 04:45:28,349 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE