./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/goblint-regression/13-privatized_24-multiple-protecting_true.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/13-privatized_24-multiple-protecting_true.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 5a41a1715a056c3cefb9e5b0430ae444adde5aa2f4e6078578085bf381d921cf --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 01:08:18,806 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 01:08:18,854 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-08 01:08:18,862 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 01:08:18,863 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 01:08:18,878 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 01:08:18,878 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 01:08:18,878 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 01:08:18,879 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 01:08:18,879 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 01:08:18,879 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 01:08:18,880 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 01:08:18,880 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 01:08:18,880 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 01:08:18,880 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 01:08:18,880 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 01:08:18,880 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 01:08:18,880 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 01:08:18,880 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 01:08:18,880 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 01:08:18,881 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 01:08:18,881 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 01:08:18,881 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 01:08:18,881 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 01:08:18,881 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 01:08:18,881 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 01:08:18,881 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 01:08:18,881 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 01:08:18,881 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 01:08:18,881 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 01:08:18,881 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 01:08:18,881 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 01:08:18,881 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:08:18,881 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 01:08:18,882 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 01:08:18,882 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 01:08:18,882 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 01:08:18,882 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 01:08:18,882 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 01:08:18,882 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 01:08:18,882 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 01:08:18,882 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 01:08:18,882 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 01:08:18,882 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 -> 5a41a1715a056c3cefb9e5b0430ae444adde5aa2f4e6078578085bf381d921cf [2025-02-08 01:08:19,107 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 01:08:19,115 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 01:08:19,117 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 01:08:19,118 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 01:08:19,118 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 01:08:19,120 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/13-privatized_24-multiple-protecting_true.i [2025-02-08 01:08:20,256 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/056b78f7e/bf3bb44d12ce42a98821b9a5a8d3340b/FLAG058610f2b [2025-02-08 01:08:20,535 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 01:08:20,536 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/13-privatized_24-multiple-protecting_true.i [2025-02-08 01:08:20,548 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/056b78f7e/bf3bb44d12ce42a98821b9a5a8d3340b/FLAG058610f2b [2025-02-08 01:08:20,835 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/056b78f7e/bf3bb44d12ce42a98821b9a5a8d3340b [2025-02-08 01:08:20,837 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 01:08:20,838 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 01:08:20,840 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 01:08:20,840 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 01:08:20,843 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 01:08:20,843 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:08:20" (1/1) ... [2025-02-08 01:08:20,844 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cc6569d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:08:20, skipping insertion in model container [2025-02-08 01:08:20,845 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:08:20" (1/1) ... [2025-02-08 01:08:20,865 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 01:08:20,974 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/goblint-regression/13-privatized_24-multiple-protecting_true.i[1096,1109] [2025-02-08 01:08:21,104 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:08:21,128 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 01:08:21,136 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/goblint-regression/13-privatized_24-multiple-protecting_true.i[1096,1109] [2025-02-08 01:08:21,160 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:08:21,189 INFO L204 MainTranslator]: Completed translation [2025-02-08 01:08:21,189 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:08:21 WrapperNode [2025-02-08 01:08:21,189 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 01:08:21,190 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 01:08:21,190 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 01:08:21,190 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 01:08:21,195 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:08:21" (1/1) ... [2025-02-08 01:08:21,203 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:08:21" (1/1) ... [2025-02-08 01:08:21,222 INFO L138 Inliner]: procedures = 162, calls = 53, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 101 [2025-02-08 01:08:21,223 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 01:08:21,224 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 01:08:21,224 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 01:08:21,224 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 01:08:21,230 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:08:21" (1/1) ... [2025-02-08 01:08:21,231 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:08:21" (1/1) ... [2025-02-08 01:08:21,235 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:08:21" (1/1) ... [2025-02-08 01:08:21,251 INFO L175 MemorySlicer]: Split 17 memory accesses to 4 slices as follows [2, 5, 5, 5]. 29 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 5, 5, 5]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-02-08 01:08:21,251 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:08:21" (1/1) ... [2025-02-08 01:08:21,251 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:08:21" (1/1) ... [2025-02-08 01:08:21,258 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:08:21" (1/1) ... [2025-02-08 01:08:21,259 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:08:21" (1/1) ... [2025-02-08 01:08:21,260 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:08:21" (1/1) ... [2025-02-08 01:08:21,261 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:08:21" (1/1) ... [2025-02-08 01:08:21,266 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 01:08:21,267 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 01:08:21,267 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 01:08:21,267 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 01:08:21,267 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:08:21" (1/1) ... [2025-02-08 01:08:21,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:08:21,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:08:21,294 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 01:08:21,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 01:08:21,317 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 01:08:21,317 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 01:08:21,318 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-08 01:08:21,318 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-08 01:08:21,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 01:08:21,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 01:08:21,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 01:08:21,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-08 01:08:21,319 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 01:08:21,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 01:08:21,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 01:08:21,320 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 01:08:21,426 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 01:08:21,428 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 01:08:21,650 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 01:08:21,650 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 01:08:21,749 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 01:08:21,749 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 01:08:21,749 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:08:21 BoogieIcfgContainer [2025-02-08 01:08:21,750 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 01:08:21,752 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 01:08:21,752 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 01:08:21,755 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 01:08:21,755 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:08:20" (1/3) ... [2025-02-08 01:08:21,757 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c8cae3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:08:21, skipping insertion in model container [2025-02-08 01:08:21,757 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:08:21" (2/3) ... [2025-02-08 01:08:21,757 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c8cae3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:08:21, skipping insertion in model container [2025-02-08 01:08:21,757 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:08:21" (3/3) ... [2025-02-08 01:08:21,759 INFO L128 eAbstractionObserver]: Analyzing ICFG 13-privatized_24-multiple-protecting_true.i [2025-02-08 01:08:21,769 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 01:08:21,771 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 13-privatized_24-multiple-protecting_true.i that has 2 procedures, 72 locations, 1 initial locations, 0 loop locations, and 4 error locations. [2025-02-08 01:08:21,772 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 01:08:21,813 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-08 01:08:21,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 75 transitions, 157 flow [2025-02-08 01:08:21,879 INFO L124 PetriNetUnfolderBase]: 4/74 cut-off events. [2025-02-08 01:08:21,882 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 01:08:21,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 74 events. 4/74 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 78 event pairs, 0 based on Foata normal form. 0/66 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2025-02-08 01:08:21,887 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 75 transitions, 157 flow [2025-02-08 01:08:21,890 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 65 transitions, 133 flow [2025-02-08 01:08:21,899 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 01:08:21,907 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;@6e24fdb4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 01:08:21,908 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-02-08 01:08:21,917 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 01:08:21,917 INFO L124 PetriNetUnfolderBase]: 1/16 cut-off events. [2025-02-08 01:08:21,917 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 01:08:21,917 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:08:21,918 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:08:21,918 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-08 01:08:21,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:08:21,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1854023003, now seen corresponding path program 1 times [2025-02-08 01:08:21,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:08:21,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332911962] [2025-02-08 01:08:21,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:08:21,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:08:21,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 01:08:22,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 01:08:22,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:08:22,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:08:22,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:08:22,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:08:22,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332911962] [2025-02-08 01:08:22,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332911962] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:08:22,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:08:22,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 01:08:22,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584577550] [2025-02-08 01:08:22,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:08:22,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:08:22,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:08:22,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:08:22,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:08:22,268 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 75 [2025-02-08 01:08:22,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 65 transitions, 133 flow. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:08:22,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:08:22,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 75 [2025-02-08 01:08:22,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:08:22,586 INFO L124 PetriNetUnfolderBase]: 443/1135 cut-off events. [2025-02-08 01:08:22,587 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 01:08:22,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2088 conditions, 1135 events. 443/1135 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 6244 event pairs, 116 based on Foata normal form. 66/1148 useless extension candidates. Maximal degree in co-relation 2079. Up to 670 conditions per place. [2025-02-08 01:08:22,594 INFO L140 encePairwiseOnDemand]: 58/75 looper letters, 69 selfloop transitions, 15 changer transitions 1/103 dead transitions. [2025-02-08 01:08:22,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 103 transitions, 379 flow [2025-02-08 01:08:22,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 01:08:22,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 01:08:22,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 200 transitions. [2025-02-08 01:08:22,606 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2025-02-08 01:08:22,607 INFO L175 Difference]: Start difference. First operand has 66 places, 65 transitions, 133 flow. Second operand 5 states and 200 transitions. [2025-02-08 01:08:22,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 103 transitions, 379 flow [2025-02-08 01:08:22,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 103 transitions, 378 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 01:08:22,617 INFO L231 Difference]: Finished difference. Result has 73 places, 71 transitions, 226 flow [2025-02-08 01:08:22,619 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=226, PETRI_PLACES=73, PETRI_TRANSITIONS=71} [2025-02-08 01:08:22,622 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 7 predicate places. [2025-02-08 01:08:22,623 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 71 transitions, 226 flow [2025-02-08 01:08:22,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:08:22,623 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:08:22,623 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:08:22,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 01:08:22,623 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-08 01:08:22,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:08:22,624 INFO L85 PathProgramCache]: Analyzing trace with hash 974809701, now seen corresponding path program 1 times [2025-02-08 01:08:22,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:08:22,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030637479] [2025-02-08 01:08:22,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:08:22,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:08:22,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 01:08:22,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 01:08:22,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:08:22,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:08:22,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:08:22,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:08:22,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030637479] [2025-02-08 01:08:22,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030637479] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:08:22,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:08:22,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 01:08:22,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707039684] [2025-02-08 01:08:22,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:08:22,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:08:22,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:08:22,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:08:22,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:08:22,808 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 75 [2025-02-08 01:08:22,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 71 transitions, 226 flow. Second operand has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:08:22,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:08:22,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 75 [2025-02-08 01:08:22,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:08:22,995 INFO L124 PetriNetUnfolderBase]: 198/660 cut-off events. [2025-02-08 01:08:22,995 INFO L125 PetriNetUnfolderBase]: For 104/104 co-relation queries the response was YES. [2025-02-08 01:08:22,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1381 conditions, 660 events. 198/660 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 3516 event pairs, 24 based on Foata normal form. 21/679 useless extension candidates. Maximal degree in co-relation 1367. Up to 317 conditions per place. [2025-02-08 01:08:22,999 INFO L140 encePairwiseOnDemand]: 69/75 looper letters, 62 selfloop transitions, 6 changer transitions 0/96 dead transitions. [2025-02-08 01:08:22,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 96 transitions, 426 flow [2025-02-08 01:08:22,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 01:08:23,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 01:08:23,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 181 transitions. [2025-02-08 01:08:23,001 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6033333333333334 [2025-02-08 01:08:23,001 INFO L175 Difference]: Start difference. First operand has 73 places, 71 transitions, 226 flow. Second operand 4 states and 181 transitions. [2025-02-08 01:08:23,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 96 transitions, 426 flow [2025-02-08 01:08:23,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 96 transitions, 409 flow, removed 4 selfloop flow, removed 1 redundant places. [2025-02-08 01:08:23,007 INFO L231 Difference]: Finished difference. Result has 76 places, 72 transitions, 231 flow [2025-02-08 01:08:23,007 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=231, PETRI_PLACES=76, PETRI_TRANSITIONS=72} [2025-02-08 01:08:23,008 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 10 predicate places. [2025-02-08 01:08:23,008 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 72 transitions, 231 flow [2025-02-08 01:08:23,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:08:23,008 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:08:23,008 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:08:23,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 01:08:23,009 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-08 01:08:23,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:08:23,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1412125791, now seen corresponding path program 1 times [2025-02-08 01:08:23,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:08:23,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675151750] [2025-02-08 01:08:23,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:08:23,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:08:23,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 01:08:23,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 01:08:23,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:08:23,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:08:23,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:08:23,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:08:23,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675151750] [2025-02-08 01:08:23,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675151750] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:08:23,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:08:23,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 01:08:23,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619621427] [2025-02-08 01:08:23,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:08:23,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:08:23,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:08:23,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:08:23,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:08:23,158 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 75 [2025-02-08 01:08:23,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 72 transitions, 231 flow. Second operand has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:08:23,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:08:23,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 75 [2025-02-08 01:08:23,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:08:23,340 INFO L124 PetriNetUnfolderBase]: 251/704 cut-off events. [2025-02-08 01:08:23,340 INFO L125 PetriNetUnfolderBase]: For 123/123 co-relation queries the response was YES. [2025-02-08 01:08:23,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1581 conditions, 704 events. 251/704 cut-off events. For 123/123 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 3532 event pairs, 160 based on Foata normal form. 36/737 useless extension candidates. Maximal degree in co-relation 1565. Up to 434 conditions per place. [2025-02-08 01:08:23,344 INFO L140 encePairwiseOnDemand]: 62/75 looper letters, 48 selfloop transitions, 13 changer transitions 7/84 dead transitions. [2025-02-08 01:08:23,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 84 transitions, 397 flow [2025-02-08 01:08:23,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 01:08:23,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 01:08:23,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 165 transitions. [2025-02-08 01:08:23,347 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44 [2025-02-08 01:08:23,347 INFO L175 Difference]: Start difference. First operand has 76 places, 72 transitions, 231 flow. Second operand 5 states and 165 transitions. [2025-02-08 01:08:23,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 84 transitions, 397 flow [2025-02-08 01:08:23,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 84 transitions, 390 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 01:08:23,351 INFO L231 Difference]: Finished difference. Result has 76 places, 65 transitions, 251 flow [2025-02-08 01:08:23,351 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=251, PETRI_PLACES=76, PETRI_TRANSITIONS=65} [2025-02-08 01:08:23,352 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 10 predicate places. [2025-02-08 01:08:23,352 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 65 transitions, 251 flow [2025-02-08 01:08:23,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:08:23,353 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:08:23,353 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:08:23,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 01:08:23,353 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-08 01:08:23,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:08:23,354 INFO L85 PathProgramCache]: Analyzing trace with hash -421266834, now seen corresponding path program 1 times [2025-02-08 01:08:23,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:08:23,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42932487] [2025-02-08 01:08:23,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:08:23,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:08:23,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 01:08:23,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 01:08:23,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:08:23,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:08:23,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:08:23,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:08:23,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42932487] [2025-02-08 01:08:23,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42932487] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:08:23,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:08:23,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 01:08:23,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844436083] [2025-02-08 01:08:23,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:08:23,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:08:23,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:08:23,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:08:23,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:08:23,468 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 75 [2025-02-08 01:08:23,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 65 transitions, 251 flow. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:08:23,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:08:23,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 75 [2025-02-08 01:08:23,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:08:23,596 INFO L124 PetriNetUnfolderBase]: 194/597 cut-off events. [2025-02-08 01:08:23,596 INFO L125 PetriNetUnfolderBase]: For 285/285 co-relation queries the response was YES. [2025-02-08 01:08:23,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1434 conditions, 597 events. 194/597 cut-off events. For 285/285 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2875 event pairs, 76 based on Foata normal form. 11/605 useless extension candidates. Maximal degree in co-relation 1416. Up to 281 conditions per place. [2025-02-08 01:08:23,599 INFO L140 encePairwiseOnDemand]: 66/75 looper letters, 57 selfloop transitions, 17 changer transitions 1/91 dead transitions. [2025-02-08 01:08:23,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 91 transitions, 493 flow [2025-02-08 01:08:23,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 01:08:23,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 01:08:23,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 175 transitions. [2025-02-08 01:08:23,600 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2025-02-08 01:08:23,601 INFO L175 Difference]: Start difference. First operand has 76 places, 65 transitions, 251 flow. Second operand 5 states and 175 transitions. [2025-02-08 01:08:23,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 91 transitions, 493 flow [2025-02-08 01:08:23,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 91 transitions, 439 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-02-08 01:08:23,604 INFO L231 Difference]: Finished difference. Result has 78 places, 71 transitions, 305 flow [2025-02-08 01:08:23,604 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=305, PETRI_PLACES=78, PETRI_TRANSITIONS=71} [2025-02-08 01:08:23,605 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 12 predicate places. [2025-02-08 01:08:23,605 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 71 transitions, 305 flow [2025-02-08 01:08:23,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:08:23,605 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:08:23,605 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:08:23,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 01:08:23,605 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-08 01:08:23,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:08:23,606 INFO L85 PathProgramCache]: Analyzing trace with hash 862281045, now seen corresponding path program 1 times [2025-02-08 01:08:23,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:08:23,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820890898] [2025-02-08 01:08:23,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:08:23,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:08:23,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-08 01:08:23,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 01:08:23,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:08:23,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:08:23,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:08:23,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:08:23,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820890898] [2025-02-08 01:08:23,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820890898] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:08:23,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:08:23,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 01:08:23,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497565099] [2025-02-08 01:08:23,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:08:23,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:08:23,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:08:23,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:08:23,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:08:23,732 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 75 [2025-02-08 01:08:23,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 71 transitions, 305 flow. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:08:23,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:08:23,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 75 [2025-02-08 01:08:23,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:08:23,862 INFO L124 PetriNetUnfolderBase]: 89/373 cut-off events. [2025-02-08 01:08:23,862 INFO L125 PetriNetUnfolderBase]: For 193/193 co-relation queries the response was YES. [2025-02-08 01:08:23,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 967 conditions, 373 events. 89/373 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1599 event pairs, 23 based on Foata normal form. 41/407 useless extension candidates. Maximal degree in co-relation 947. Up to 168 conditions per place. [2025-02-08 01:08:23,864 INFO L140 encePairwiseOnDemand]: 58/75 looper letters, 41 selfloop transitions, 17 changer transitions 3/86 dead transitions. [2025-02-08 01:08:23,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 86 transitions, 489 flow [2025-02-08 01:08:23,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 01:08:23,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 01:08:23,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 176 transitions. [2025-02-08 01:08:23,865 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5866666666666667 [2025-02-08 01:08:23,867 INFO L175 Difference]: Start difference. First operand has 78 places, 71 transitions, 305 flow. Second operand 4 states and 176 transitions. [2025-02-08 01:08:23,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 86 transitions, 489 flow [2025-02-08 01:08:23,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 86 transitions, 481 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-08 01:08:23,872 INFO L231 Difference]: Finished difference. Result has 81 places, 73 transitions, 360 flow [2025-02-08 01:08:23,873 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=360, PETRI_PLACES=81, PETRI_TRANSITIONS=73} [2025-02-08 01:08:23,874 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 15 predicate places. [2025-02-08 01:08:23,875 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 73 transitions, 360 flow [2025-02-08 01:08:23,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:08:23,875 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:08:23,875 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:08:23,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 01:08:23,875 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-08 01:08:23,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:08:23,878 INFO L85 PathProgramCache]: Analyzing trace with hash 214369662, now seen corresponding path program 1 times [2025-02-08 01:08:23,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:08:23,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138145043] [2025-02-08 01:08:23,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:08:23,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:08:23,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-08 01:08:23,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-08 01:08:23,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:08:23,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:08:24,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:08:24,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:08:24,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138145043] [2025-02-08 01:08:24,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138145043] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:08:24,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:08:24,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 01:08:24,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18488484] [2025-02-08 01:08:24,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:08:24,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:08:24,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:08:24,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:08:24,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:08:24,093 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 75 [2025-02-08 01:08:24,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 73 transitions, 360 flow. Second operand has 5 states, 5 states have (on average 33.8) internal successors, (169), 5 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:08:24,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:08:24,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 75 [2025-02-08 01:08:24,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:08:24,195 INFO L124 PetriNetUnfolderBase]: 85/346 cut-off events. [2025-02-08 01:08:24,195 INFO L125 PetriNetUnfolderBase]: For 311/313 co-relation queries the response was YES. [2025-02-08 01:08:24,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1009 conditions, 346 events. 85/346 cut-off events. For 311/313 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1447 event pairs, 38 based on Foata normal form. 4/347 useless extension candidates. Maximal degree in co-relation 987. Up to 233 conditions per place. [2025-02-08 01:08:24,198 INFO L140 encePairwiseOnDemand]: 71/75 looper letters, 43 selfloop transitions, 4 changer transitions 14/79 dead transitions. [2025-02-08 01:08:24,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 79 transitions, 497 flow [2025-02-08 01:08:24,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 01:08:24,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 01:08:24,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2025-02-08 01:08:24,199 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5433333333333333 [2025-02-08 01:08:24,199 INFO L175 Difference]: Start difference. First operand has 81 places, 73 transitions, 360 flow. Second operand 4 states and 163 transitions. [2025-02-08 01:08:24,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 79 transitions, 497 flow [2025-02-08 01:08:24,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 79 transitions, 481 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 01:08:24,204 INFO L231 Difference]: Finished difference. Result has 79 places, 56 transitions, 261 flow [2025-02-08 01:08:24,204 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=261, PETRI_PLACES=79, PETRI_TRANSITIONS=56} [2025-02-08 01:08:24,204 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 13 predicate places. [2025-02-08 01:08:24,205 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 56 transitions, 261 flow [2025-02-08 01:08:24,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.8) internal successors, (169), 5 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:08:24,205 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:08:24,205 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:08:24,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 01:08:24,205 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-08 01:08:24,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:08:24,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1170000231, now seen corresponding path program 1 times [2025-02-08 01:08:24,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:08:24,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111520244] [2025-02-08 01:08:24,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:08:24,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:08:24,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-08 01:08:24,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-08 01:08:24,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:08:24,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:08:24,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:08:24,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:08:24,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111520244] [2025-02-08 01:08:24,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111520244] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:08:24,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:08:24,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 01:08:24,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933803750] [2025-02-08 01:08:24,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:08:24,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:08:24,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:08:24,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:08:24,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:08:24,439 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 75 [2025-02-08 01:08:24,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 56 transitions, 261 flow. Second operand has 6 states, 6 states have (on average 33.5) internal successors, (201), 6 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:08:24,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:08:24,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 75 [2025-02-08 01:08:24,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:08:24,532 INFO L124 PetriNetUnfolderBase]: 60/244 cut-off events. [2025-02-08 01:08:24,532 INFO L125 PetriNetUnfolderBase]: For 232/232 co-relation queries the response was YES. [2025-02-08 01:08:24,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 689 conditions, 244 events. 60/244 cut-off events. For 232/232 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 753 event pairs, 20 based on Foata normal form. 13/255 useless extension candidates. Maximal degree in co-relation 667. Up to 105 conditions per place. [2025-02-08 01:08:24,534 INFO L140 encePairwiseOnDemand]: 71/75 looper letters, 38 selfloop transitions, 6 changer transitions 2/63 dead transitions. [2025-02-08 01:08:24,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 63 transitions, 388 flow [2025-02-08 01:08:24,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 01:08:24,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 01:08:24,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 157 transitions. [2025-02-08 01:08:24,536 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5233333333333333 [2025-02-08 01:08:24,536 INFO L175 Difference]: Start difference. First operand has 79 places, 56 transitions, 261 flow. Second operand 4 states and 157 transitions. [2025-02-08 01:08:24,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 63 transitions, 388 flow [2025-02-08 01:08:24,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 63 transitions, 331 flow, removed 2 selfloop flow, removed 8 redundant places. [2025-02-08 01:08:24,539 INFO L231 Difference]: Finished difference. Result has 66 places, 53 transitions, 211 flow [2025-02-08 01:08:24,540 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=211, PETRI_PLACES=66, PETRI_TRANSITIONS=53} [2025-02-08 01:08:24,540 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 0 predicate places. [2025-02-08 01:08:24,540 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 53 transitions, 211 flow [2025-02-08 01:08:24,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 33.5) internal successors, (201), 6 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:08:24,540 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:08:24,540 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:08:24,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 01:08:24,541 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-08 01:08:24,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:08:24,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1783841306, now seen corresponding path program 1 times [2025-02-08 01:08:24,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:08:24,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791411561] [2025-02-08 01:08:24,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:08:24,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:08:24,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-08 01:08:24,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 01:08:24,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:08:24,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:08:24,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:08:24,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:08:24,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791411561] [2025-02-08 01:08:24,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791411561] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:08:24,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:08:24,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 01:08:24,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890562384] [2025-02-08 01:08:24,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:08:24,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:08:24,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:08:24,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:08:24,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:08:24,692 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 75 [2025-02-08 01:08:24,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 53 transitions, 211 flow. Second operand has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:08:24,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:08:24,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 75 [2025-02-08 01:08:24,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:08:24,805 INFO L124 PetriNetUnfolderBase]: 67/240 cut-off events. [2025-02-08 01:08:24,806 INFO L125 PetriNetUnfolderBase]: For 180/180 co-relation queries the response was YES. [2025-02-08 01:08:24,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 651 conditions, 240 events. 67/240 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 716 event pairs, 46 based on Foata normal form. 4/241 useless extension candidates. Maximal degree in co-relation 633. Up to 156 conditions per place. [2025-02-08 01:08:24,807 INFO L140 encePairwiseOnDemand]: 66/75 looper letters, 0 selfloop transitions, 0 changer transitions 61/61 dead transitions. [2025-02-08 01:08:24,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 61 transitions, 349 flow [2025-02-08 01:08:24,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:08:24,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 01:08:24,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 171 transitions. [2025-02-08 01:08:24,808 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38 [2025-02-08 01:08:24,808 INFO L175 Difference]: Start difference. First operand has 66 places, 53 transitions, 211 flow. Second operand 6 states and 171 transitions. [2025-02-08 01:08:24,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 61 transitions, 349 flow [2025-02-08 01:08:24,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 61 transitions, 335 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-02-08 01:08:24,809 INFO L231 Difference]: Finished difference. Result has 66 places, 0 transitions, 0 flow [2025-02-08 01:08:24,810 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=66, PETRI_TRANSITIONS=0} [2025-02-08 01:08:24,810 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 0 predicate places. [2025-02-08 01:08:24,810 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 0 transitions, 0 flow [2025-02-08 01:08:24,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:08:24,813 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2025-02-08 01:08:24,813 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-02-08 01:08:24,813 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-02-08 01:08:24,813 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-02-08 01:08:24,813 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2025-02-08 01:08:24,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 01:08:24,814 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:08:24,816 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 01:08:24,816 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 01:08:24,821 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 01:08:24 BasicIcfg [2025-02-08 01:08:24,821 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 01:08:24,823 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 01:08:24,823 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 01:08:24,823 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 01:08:24,824 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:08:21" (3/4) ... [2025-02-08 01:08:24,826 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 01:08:24,828 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t_fun [2025-02-08 01:08:24,831 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2025-02-08 01:08:24,831 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-02-08 01:08:24,831 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-02-08 01:08:24,831 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 01:08:24,883 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 01:08:24,884 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 01:08:24,884 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 01:08:24,884 INFO L158 Benchmark]: Toolchain (without parser) took 4045.74ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 123.4MB in the beginning and 151.8MB in the end (delta: -28.4MB). Peak memory consumption was 140.5MB. Max. memory is 16.1GB. [2025-02-08 01:08:24,884 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 201.3MB. Free memory is still 117.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 01:08:24,885 INFO L158 Benchmark]: CACSL2BoogieTranslator took 350.06ms. Allocated memory is still 167.8MB. Free memory was 123.4MB in the beginning and 103.6MB in the end (delta: 19.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 01:08:24,885 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.14ms. Allocated memory is still 167.8MB. Free memory was 103.6MB in the beginning and 101.2MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 01:08:24,885 INFO L158 Benchmark]: Boogie Preprocessor took 42.33ms. Allocated memory is still 167.8MB. Free memory was 101.2MB in the beginning and 99.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 01:08:24,885 INFO L158 Benchmark]: IcfgBuilder took 483.11ms. Allocated memory is still 167.8MB. Free memory was 99.7MB in the beginning and 63.2MB in the end (delta: 36.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-08 01:08:24,885 INFO L158 Benchmark]: TraceAbstraction took 3069.20ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 62.4MB in the beginning and 158.5MB in the end (delta: -96.1MB). Peak memory consumption was 73.4MB. Max. memory is 16.1GB. [2025-02-08 01:08:24,886 INFO L158 Benchmark]: Witness Printer took 60.86ms. Allocated memory is still 335.5MB. Free memory was 158.5MB in the beginning and 151.8MB in the end (delta: 6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 01:08:24,887 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.31ms. Allocated memory is still 201.3MB. Free memory is still 117.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 350.06ms. Allocated memory is still 167.8MB. Free memory was 123.4MB in the beginning and 103.6MB in the end (delta: 19.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.14ms. Allocated memory is still 167.8MB. Free memory was 103.6MB in the beginning and 101.2MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.33ms. Allocated memory is still 167.8MB. Free memory was 101.2MB in the beginning and 99.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 483.11ms. Allocated memory is still 167.8MB. Free memory was 99.7MB in the beginning and 63.2MB in the end (delta: 36.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3069.20ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 62.4MB in the beginning and 158.5MB in the end (delta: -96.1MB). Peak memory consumption was 73.4MB. Max. memory is 16.1GB. * Witness Printer took 60.86ms. Allocated memory is still 335.5MB. Free memory was 158.5MB in the beginning and 151.8MB in the end (delta: 6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 19]: 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 3 procedures, 99 locations, 5 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: 3.0s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 332 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 310 mSDsluCounter, 51 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 32 mSDsCounter, 126 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 815 IncrementalHoareTripleChecker+Invalid, 941 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 126 mSolverCounterUnsat, 19 mSDtfsCounter, 815 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=360occurred in iteration=5, InterpolantAutomatonStates: 37, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 228 NumberOfCodeBlocks, 228 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 220 ConstructedInterpolants, 0 QuantifiedInterpolants, 1224 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 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 4 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 01:08:24,900 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