./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-races/race-2_2-container_of.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f8ab0bd5 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-races/race-2_2-container_of.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6053c0f6a5de5dc1a7614e5acfd1de5bdb570ebc833d8c4c70a1e68bd98ac1b0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 21:35:58,580 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 21:35:58,635 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-13 21:35:58,639 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 21:35:58,640 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 21:35:58,662 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 21:35:58,663 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 21:35:58,663 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 21:35:58,663 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-13 21:35:58,663 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-13 21:35:58,663 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 21:35:58,663 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 21:35:58,663 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 21:35:58,664 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 21:35:58,664 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 21:35:58,664 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 21:35:58,664 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 21:35:58,664 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 21:35:58,664 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 21:35:58,664 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 21:35:58,664 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 21:35:58,664 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 21:35:58,664 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 21:35:58,664 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 21:35:58,664 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 21:35:58,664 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 21:35:58,664 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 21:35:58,664 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 21:35:58,664 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 21:35:58,664 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 21:35:58,665 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-13 21:35:58,665 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 21:35:58,665 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:35:58,665 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 21:35:58,665 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 21:35:58,665 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 21:35:58,665 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 21:35:58,665 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 21:35:58,665 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 21:35:58,665 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 21:35:58,665 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 21:35:58,665 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 21:35:58,665 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 21:35:58,665 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6053c0f6a5de5dc1a7614e5acfd1de5bdb570ebc833d8c4c70a1e68bd98ac1b0 [2025-03-13 21:35:58,878 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 21:35:58,883 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 21:35:58,885 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 21:35:58,886 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 21:35:58,886 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 21:35:58,887 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-races/race-2_2-container_of.i [2025-03-13 21:36:00,027 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be688f6fd/7a34c5030dd444daa2aa78bd701a57f4/FLAGca9cf5189 [2025-03-13 21:36:00,375 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 21:36:00,375 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_2-container_of.i [2025-03-13 21:36:00,403 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be688f6fd/7a34c5030dd444daa2aa78bd701a57f4/FLAGca9cf5189 [2025-03-13 21:36:00,418 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be688f6fd/7a34c5030dd444daa2aa78bd701a57f4 [2025-03-13 21:36:00,420 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 21:36:00,421 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 21:36:00,423 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 21:36:00,423 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 21:36:00,426 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 21:36:00,427 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:36:00" (1/1) ... [2025-03-13 21:36:00,427 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58c76f3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:36:00, skipping insertion in model container [2025-03-13 21:36:00,427 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:36:00" (1/1) ... [2025-03-13 21:36:00,463 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 21:36:00,685 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_2-container_of.i[186287,186300] [2025-03-13 21:36:00,718 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:36:00,729 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 21:36:00,775 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_2-container_of.i[186287,186300] [2025-03-13 21:36:00,791 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:36:00,825 INFO L204 MainTranslator]: Completed translation [2025-03-13 21:36:00,826 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:36:00 WrapperNode [2025-03-13 21:36:00,826 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 21:36:00,827 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 21:36:00,827 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 21:36:00,827 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 21:36:00,831 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:36:00" (1/1) ... [2025-03-13 21:36:00,841 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:36:00" (1/1) ... [2025-03-13 21:36:00,855 INFO L138 Inliner]: procedures = 246, calls = 39, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 108 [2025-03-13 21:36:00,855 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 21:36:00,857 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 21:36:00,857 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 21:36:00,857 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 21:36:00,862 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:36:00" (1/1) ... [2025-03-13 21:36:00,862 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:36:00" (1/1) ... [2025-03-13 21:36:00,868 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:36:00" (1/1) ... [2025-03-13 21:36:00,878 INFO L175 MemorySlicer]: Split 15 memory accesses to 3 slices as follows [2, 2, 11]. 73 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 8 writes are split as follows [0, 2, 6]. [2025-03-13 21:36:00,879 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:36:00" (1/1) ... [2025-03-13 21:36:00,879 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:36:00" (1/1) ... [2025-03-13 21:36:00,887 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:36:00" (1/1) ... [2025-03-13 21:36:00,888 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:36:00" (1/1) ... [2025-03-13 21:36:00,894 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:36:00" (1/1) ... [2025-03-13 21:36:00,895 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:36:00" (1/1) ... [2025-03-13 21:36:00,898 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 21:36:00,900 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 21:36:00,902 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 21:36:00,902 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 21:36:00,903 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:36:00" (1/1) ... [2025-03-13 21:36:00,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:36:00,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:36:00,929 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-13 21:36:00,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-13 21:36:00,950 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2025-03-13 21:36:00,951 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2025-03-13 21:36:00,951 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-13 21:36:00,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-13 21:36:00,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-13 21:36:00,952 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-13 21:36:00,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-13 21:36:00,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-13 21:36:00,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-13 21:36:00,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-13 21:36:00,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-13 21:36:00,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-13 21:36:00,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 21:36:00,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-13 21:36:00,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-13 21:36:00,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-13 21:36:00,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-13 21:36:00,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-13 21:36:00,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-13 21:36:00,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 21:36:00,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 21:36:00,955 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 21:36:01,182 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 21:36:01,184 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 21:36:01,342 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 21:36:01,343 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 21:36:01,343 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 21:36:01,446 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 21:36:01,446 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:36:01 BoogieIcfgContainer [2025-03-13 21:36:01,446 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 21:36:01,448 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 21:36:01,448 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 21:36:01,453 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 21:36:01,453 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 09:36:00" (1/3) ... [2025-03-13 21:36:01,454 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f06ea44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:36:01, skipping insertion in model container [2025-03-13 21:36:01,454 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:36:00" (2/3) ... [2025-03-13 21:36:01,454 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f06ea44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:36:01, skipping insertion in model container [2025-03-13 21:36:01,454 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:36:01" (3/3) ... [2025-03-13 21:36:01,455 INFO L128 eAbstractionObserver]: Analyzing ICFG race-2_2-container_of.i [2025-03-13 21:36:01,467 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 21:36:01,470 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG race-2_2-container_of.i that has 2 procedures, 38 locations, 1 initial locations, 0 loop locations, and 4 error locations. [2025-03-13 21:36:01,470 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 21:36:01,515 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-13 21:36:01,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 50 transitions, 114 flow [2025-03-13 21:36:01,573 INFO L124 PetriNetUnfolderBase]: 8/63 cut-off events. [2025-03-13 21:36:01,575 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 21:36:01,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72 conditions, 63 events. 8/63 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 135 event pairs, 0 based on Foata normal form. 0/47 useless extension candidates. Maximal degree in co-relation 30. Up to 4 conditions per place. [2025-03-13 21:36:01,578 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 50 transitions, 114 flow [2025-03-13 21:36:01,581 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 43 transitions, 98 flow [2025-03-13 21:36:01,589 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:36:01,601 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;@2ba3cc3a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:36:01,601 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-13 21:36:01,606 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:36:01,606 INFO L124 PetriNetUnfolderBase]: 1/19 cut-off events. [2025-03-13 21:36:01,606 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:36:01,607 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:36:01,607 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:36:01,607 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-13 21:36:01,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:36:01,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1381462125, now seen corresponding path program 1 times [2025-03-13 21:36:01,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:36:01,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872409462] [2025-03-13 21:36:01,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:36:01,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:36:01,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-13 21:36:01,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-13 21:36:01,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:36:01,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:36:02,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:36:02,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:36:02,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872409462] [2025-03-13 21:36:02,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872409462] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:36:02,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:36:02,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:36:02,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042698437] [2025-03-13 21:36:02,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:36:02,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:36:02,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:36:02,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:36:02,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:36:02,224 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2025-03-13 21:36:02,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 43 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:36:02,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:36:02,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2025-03-13 21:36:02,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:36:02,467 INFO L124 PetriNetUnfolderBase]: 466/817 cut-off events. [2025-03-13 21:36:02,467 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-13 21:36:02,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1637 conditions, 817 events. 466/817 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3413 event pairs, 345 based on Foata normal form. 2/816 useless extension candidates. Maximal degree in co-relation 1538. Up to 600 conditions per place. [2025-03-13 21:36:02,476 INFO L140 encePairwiseOnDemand]: 41/50 looper letters, 38 selfloop transitions, 6 changer transitions 0/48 dead transitions. [2025-03-13 21:36:02,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 48 transitions, 196 flow [2025-03-13 21:36:02,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:36:02,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:36:02,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2025-03-13 21:36:02,488 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47333333333333333 [2025-03-13 21:36:02,490 INFO L175 Difference]: Start difference. First operand has 45 places, 43 transitions, 98 flow. Second operand 3 states and 71 transitions. [2025-03-13 21:36:02,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 48 transitions, 196 flow [2025-03-13 21:36:02,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 48 transitions, 188 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-13 21:36:02,498 INFO L231 Difference]: Finished difference. Result has 41 places, 38 transitions, 92 flow [2025-03-13 21:36:02,500 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=41, PETRI_TRANSITIONS=38} [2025-03-13 21:36:02,505 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, -4 predicate places. [2025-03-13 21:36:02,506 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 38 transitions, 92 flow [2025-03-13 21:36:02,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:36:02,506 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:36:02,506 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:36:02,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 21:36:02,506 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-13 21:36:02,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:36:02,508 INFO L85 PathProgramCache]: Analyzing trace with hash -440158717, now seen corresponding path program 1 times [2025-03-13 21:36:02,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:36:02,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436902751] [2025-03-13 21:36:02,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:36:02,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:36:02,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-13 21:36:02,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-13 21:36:02,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:36:02,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:36:02,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:36:02,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:36:02,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436902751] [2025-03-13 21:36:02,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436902751] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:36:02,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:36:02,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:36:02,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111026477] [2025-03-13 21:36:02,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:36:02,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:36:02,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:36:02,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:36:02,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:36:02,796 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2025-03-13 21:36:02,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 38 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:36:02,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:36:02,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2025-03-13 21:36:02,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:36:02,990 INFO L124 PetriNetUnfolderBase]: 602/1092 cut-off events. [2025-03-13 21:36:02,990 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2025-03-13 21:36:02,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2266 conditions, 1092 events. 602/1092 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 5236 event pairs, 289 based on Foata normal form. 69/1160 useless extension candidates. Maximal degree in co-relation 816. Up to 574 conditions per place. [2025-03-13 21:36:02,996 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 44 selfloop transitions, 8 changer transitions 4/60 dead transitions. [2025-03-13 21:36:02,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 60 transitions, 250 flow [2025-03-13 21:36:02,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-13 21:36:02,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-13 21:36:02,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2025-03-13 21:36:02,997 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45 [2025-03-13 21:36:02,997 INFO L175 Difference]: Start difference. First operand has 41 places, 38 transitions, 92 flow. Second operand 4 states and 90 transitions. [2025-03-13 21:36:02,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 60 transitions, 250 flow [2025-03-13 21:36:02,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 60 transitions, 236 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:36:03,000 INFO L231 Difference]: Finished difference. Result has 44 places, 39 transitions, 122 flow [2025-03-13 21:36:03,000 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=122, PETRI_PLACES=44, PETRI_TRANSITIONS=39} [2025-03-13 21:36:03,000 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, -1 predicate places. [2025-03-13 21:36:03,000 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 39 transitions, 122 flow [2025-03-13 21:36:03,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:36:03,001 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:36:03,001 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:36:03,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 21:36:03,001 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-13 21:36:03,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:36:03,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1632078642, now seen corresponding path program 1 times [2025-03-13 21:36:03,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:36:03,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23528696] [2025-03-13 21:36:03,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:36:03,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:36:03,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-13 21:36:03,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-13 21:36:03,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:36:03,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:36:03,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:36:03,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:36:03,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23528696] [2025-03-13 21:36:03,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23528696] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:36:03,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:36:03,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-13 21:36:03,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337017995] [2025-03-13 21:36:03,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:36:03,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-13 21:36:03,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:36:03,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-13 21:36:03,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-13 21:36:03,531 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2025-03-13 21:36:03,531 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 39 transitions, 122 flow. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:36:03,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:36:03,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2025-03-13 21:36:03,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:36:03,911 INFO L124 PetriNetUnfolderBase]: 557/1040 cut-off events. [2025-03-13 21:36:03,911 INFO L125 PetriNetUnfolderBase]: For 413/413 co-relation queries the response was YES. [2025-03-13 21:36:03,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2505 conditions, 1040 events. 557/1040 cut-off events. For 413/413 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 5171 event pairs, 37 based on Foata normal form. 32/1072 useless extension candidates. Maximal degree in co-relation 1270. Up to 327 conditions per place. [2025-03-13 21:36:03,916 INFO L140 encePairwiseOnDemand]: 38/50 looper letters, 71 selfloop transitions, 22 changer transitions 1/98 dead transitions. [2025-03-13 21:36:03,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 98 transitions, 482 flow [2025-03-13 21:36:03,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-13 21:36:03,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-13 21:36:03,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 181 transitions. [2025-03-13 21:36:03,918 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3290909090909091 [2025-03-13 21:36:03,918 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 122 flow. Second operand 11 states and 181 transitions. [2025-03-13 21:36:03,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 98 transitions, 482 flow [2025-03-13 21:36:03,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 98 transitions, 460 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-13 21:36:03,921 INFO L231 Difference]: Finished difference. Result has 53 places, 50 transitions, 218 flow [2025-03-13 21:36:03,922 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=218, PETRI_PLACES=53, PETRI_TRANSITIONS=50} [2025-03-13 21:36:03,922 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 8 predicate places. [2025-03-13 21:36:03,922 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 50 transitions, 218 flow [2025-03-13 21:36:03,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:36:03,922 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:36:03,922 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:36:03,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 21:36:03,923 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-13 21:36:03,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:36:03,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1008544854, now seen corresponding path program 1 times [2025-03-13 21:36:03,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:36:03,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560133770] [2025-03-13 21:36:03,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:36:03,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:36:03,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-13 21:36:03,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-13 21:36:03,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:36:03,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:36:04,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:36:04,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:36:04,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560133770] [2025-03-13 21:36:04,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560133770] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:36:04,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:36:04,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-13 21:36:04,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372333569] [2025-03-13 21:36:04,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:36:04,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-13 21:36:04,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:36:04,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-13 21:36:04,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-13 21:36:04,354 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2025-03-13 21:36:04,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 50 transitions, 218 flow. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:36:04,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:36:04,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2025-03-13 21:36:04,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:36:04,773 INFO L124 PetriNetUnfolderBase]: 561/1048 cut-off events. [2025-03-13 21:36:04,773 INFO L125 PetriNetUnfolderBase]: For 1040/1040 co-relation queries the response was YES. [2025-03-13 21:36:04,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2921 conditions, 1048 events. 561/1048 cut-off events. For 1040/1040 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5144 event pairs, 38 based on Foata normal form. 32/1080 useless extension candidates. Maximal degree in co-relation 1664. Up to 309 conditions per place. [2025-03-13 21:36:04,778 INFO L140 encePairwiseOnDemand]: 38/50 looper letters, 81 selfloop transitions, 28 changer transitions 4/117 dead transitions. [2025-03-13 21:36:04,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 117 transitions, 697 flow [2025-03-13 21:36:04,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-13 21:36:04,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-13 21:36:04,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 186 transitions. [2025-03-13 21:36:04,780 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3381818181818182 [2025-03-13 21:36:04,780 INFO L175 Difference]: Start difference. First operand has 53 places, 50 transitions, 218 flow. Second operand 11 states and 186 transitions. [2025-03-13 21:36:04,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 117 transitions, 697 flow [2025-03-13 21:36:04,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 117 transitions, 648 flow, removed 2 selfloop flow, removed 5 redundant places. [2025-03-13 21:36:04,785 INFO L231 Difference]: Finished difference. Result has 60 places, 63 transitions, 334 flow [2025-03-13 21:36:04,785 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=334, PETRI_PLACES=60, PETRI_TRANSITIONS=63} [2025-03-13 21:36:04,786 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 15 predicate places. [2025-03-13 21:36:04,786 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 63 transitions, 334 flow [2025-03-13 21:36:04,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:36:04,786 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:36:04,786 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:36:04,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 21:36:04,787 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-13 21:36:04,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:36:04,787 INFO L85 PathProgramCache]: Analyzing trace with hash 751798221, now seen corresponding path program 1 times [2025-03-13 21:36:04,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:36:04,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688785647] [2025-03-13 21:36:04,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:36:04,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:36:04,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-13 21:36:04,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-13 21:36:04,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:36:04,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:36:04,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:36:04,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:36:04,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688785647] [2025-03-13 21:36:04,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688785647] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:36:04,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:36:04,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:36:04,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345719707] [2025-03-13 21:36:04,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:36:04,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:36:04,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:36:04,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:36:04,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:36:04,889 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 50 [2025-03-13 21:36:04,890 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 63 transitions, 334 flow. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:36:04,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:36:04,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 50 [2025-03-13 21:36:04,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:36:04,988 INFO L124 PetriNetUnfolderBase]: 225/404 cut-off events. [2025-03-13 21:36:04,988 INFO L125 PetriNetUnfolderBase]: For 474/474 co-relation queries the response was YES. [2025-03-13 21:36:04,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1213 conditions, 404 events. 225/404 cut-off events. For 474/474 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1472 event pairs, 35 based on Foata normal form. 0/404 useless extension candidates. Maximal degree in co-relation 1196. Up to 217 conditions per place. [2025-03-13 21:36:04,991 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 42 selfloop transitions, 5 changer transitions 0/52 dead transitions. [2025-03-13 21:36:04,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 52 transitions, 301 flow [2025-03-13 21:36:04,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-13 21:36:04,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-13 21:36:04,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 105 transitions. [2025-03-13 21:36:04,995 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.525 [2025-03-13 21:36:04,995 INFO L175 Difference]: Start difference. First operand has 60 places, 63 transitions, 334 flow. Second operand 4 states and 105 transitions. [2025-03-13 21:36:04,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 52 transitions, 301 flow [2025-03-13 21:36:04,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 52 transitions, 242 flow, removed 18 selfloop flow, removed 10 redundant places. [2025-03-13 21:36:04,998 INFO L231 Difference]: Finished difference. Result has 40 places, 34 transitions, 104 flow [2025-03-13 21:36:04,999 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=104, PETRI_PLACES=40, PETRI_TRANSITIONS=34} [2025-03-13 21:36:04,999 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, -5 predicate places. [2025-03-13 21:36:04,999 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 34 transitions, 104 flow [2025-03-13 21:36:05,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:36:05,000 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:36:05,000 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:36:05,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 21:36:05,000 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-13 21:36:05,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:36:05,002 INFO L85 PathProgramCache]: Analyzing trace with hash 104128071, now seen corresponding path program 1 times [2025-03-13 21:36:05,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:36:05,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981517519] [2025-03-13 21:36:05,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:36:05,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:36:05,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-13 21:36:05,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-13 21:36:05,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:36:05,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:36:05,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:36:05,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:36:05,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981517519] [2025-03-13 21:36:05,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981517519] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:36:05,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:36:05,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-13 21:36:05,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054435736] [2025-03-13 21:36:05,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:36:05,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-13 21:36:05,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:36:05,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-13 21:36:05,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-13 21:36:05,605 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2025-03-13 21:36:05,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 104 flow. Second operand has 11 states, 11 states have (on average 10.181818181818182) internal successors, (112), 11 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:36:05,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:36:05,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2025-03-13 21:36:05,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:36:06,156 INFO L124 PetriNetUnfolderBase]: 401/718 cut-off events. [2025-03-13 21:36:06,156 INFO L125 PetriNetUnfolderBase]: For 517/517 co-relation queries the response was YES. [2025-03-13 21:36:06,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1825 conditions, 718 events. 401/718 cut-off events. For 517/517 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3145 event pairs, 5 based on Foata normal form. 0/717 useless extension candidates. Maximal degree in co-relation 365. Up to 221 conditions per place. [2025-03-13 21:36:06,159 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 83 selfloop transitions, 19 changer transitions 0/104 dead transitions. [2025-03-13 21:36:06,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 104 transitions, 520 flow [2025-03-13 21:36:06,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-13 21:36:06,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-13 21:36:06,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 205 transitions. [2025-03-13 21:36:06,161 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3153846153846154 [2025-03-13 21:36:06,161 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 104 flow. Second operand 13 states and 205 transitions. [2025-03-13 21:36:06,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 104 transitions, 520 flow [2025-03-13 21:36:06,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 104 transitions, 503 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:36:06,163 INFO L231 Difference]: Finished difference. Result has 58 places, 45 transitions, 218 flow [2025-03-13 21:36:06,163 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=218, PETRI_PLACES=58, PETRI_TRANSITIONS=45} [2025-03-13 21:36:06,163 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 13 predicate places. [2025-03-13 21:36:06,163 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 45 transitions, 218 flow [2025-03-13 21:36:06,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.181818181818182) internal successors, (112), 11 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:36:06,164 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:36:06,164 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:36:06,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 21:36:06,164 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-13 21:36:06,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:36:06,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1786758473, now seen corresponding path program 2 times [2025-03-13 21:36:06,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:36:06,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151909496] [2025-03-13 21:36:06,165 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:36:06,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:36:06,180 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 1 equivalence classes. [2025-03-13 21:36:06,189 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-13 21:36:06,189 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:36:06,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:36:06,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:36:06,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:36:06,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151909496] [2025-03-13 21:36:06,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151909496] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:36:06,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:36:06,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-13 21:36:06,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035046494] [2025-03-13 21:36:06,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:36:06,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-13 21:36:06,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:36:06,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-13 21:36:06,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-13 21:36:06,570 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2025-03-13 21:36:06,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 45 transitions, 218 flow. Second operand has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:36:06,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:36:06,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2025-03-13 21:36:06,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:36:06,856 INFO L124 PetriNetUnfolderBase]: 469/870 cut-off events. [2025-03-13 21:36:06,857 INFO L125 PetriNetUnfolderBase]: For 1191/1191 co-relation queries the response was YES. [2025-03-13 21:36:06,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2443 conditions, 870 events. 469/870 cut-off events. For 1191/1191 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4137 event pairs, 18 based on Foata normal form. 1/871 useless extension candidates. Maximal degree in co-relation 2400. Up to 302 conditions per place. [2025-03-13 21:36:06,860 INFO L140 encePairwiseOnDemand]: 40/50 looper letters, 75 selfloop transitions, 28 changer transitions 0/105 dead transitions. [2025-03-13 21:36:06,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 105 transitions, 683 flow [2025-03-13 21:36:06,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-13 21:36:06,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-13 21:36:06,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 169 transitions. [2025-03-13 21:36:06,861 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.30727272727272725 [2025-03-13 21:36:06,862 INFO L175 Difference]: Start difference. First operand has 58 places, 45 transitions, 218 flow. Second operand 11 states and 169 transitions. [2025-03-13 21:36:06,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 105 transitions, 683 flow [2025-03-13 21:36:06,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 105 transitions, 666 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-13 21:36:06,864 INFO L231 Difference]: Finished difference. Result has 69 places, 59 transitions, 393 flow [2025-03-13 21:36:06,864 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=393, PETRI_PLACES=69, PETRI_TRANSITIONS=59} [2025-03-13 21:36:06,865 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 24 predicate places. [2025-03-13 21:36:06,865 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 59 transitions, 393 flow [2025-03-13 21:36:06,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:36:06,865 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:36:06,865 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:36:06,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 21:36:06,866 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-13 21:36:06,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:36:06,866 INFO L85 PathProgramCache]: Analyzing trace with hash -663545671, now seen corresponding path program 3 times [2025-03-13 21:36:06,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:36:06,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373092024] [2025-03-13 21:36:06,866 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:36:06,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:36:06,880 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 1 equivalence classes. [2025-03-13 21:36:06,888 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-13 21:36:06,889 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-13 21:36:06,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:36:07,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:36:07,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:36:07,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373092024] [2025-03-13 21:36:07,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373092024] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:36:07,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:36:07,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-13 21:36:07,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949020665] [2025-03-13 21:36:07,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:36:07,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-13 21:36:07,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:36:07,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-13 21:36:07,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-13 21:36:07,608 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2025-03-13 21:36:07,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 59 transitions, 393 flow. Second operand has 12 states, 12 states have (on average 10.0) internal successors, (120), 12 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-03-13 21:36:07,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:36:07,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2025-03-13 21:36:07,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:36:08,261 INFO L124 PetriNetUnfolderBase]: 689/1318 cut-off events. [2025-03-13 21:36:08,261 INFO L125 PetriNetUnfolderBase]: For 2596/2596 co-relation queries the response was YES. [2025-03-13 21:36:08,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4087 conditions, 1318 events. 689/1318 cut-off events. For 2596/2596 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 7050 event pairs, 36 based on Foata normal form. 2/1320 useless extension candidates. Maximal degree in co-relation 4011. Up to 295 conditions per place. [2025-03-13 21:36:08,269 INFO L140 encePairwiseOnDemand]: 38/50 looper letters, 95 selfloop transitions, 51 changer transitions 0/148 dead transitions. [2025-03-13 21:36:08,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 148 transitions, 1117 flow [2025-03-13 21:36:08,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-13 21:36:08,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-13 21:36:08,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 229 transitions. [2025-03-13 21:36:08,271 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.30533333333333335 [2025-03-13 21:36:08,271 INFO L175 Difference]: Start difference. First operand has 69 places, 59 transitions, 393 flow. Second operand 15 states and 229 transitions. [2025-03-13 21:36:08,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 148 transitions, 1117 flow [2025-03-13 21:36:08,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 148 transitions, 1100 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-13 21:36:08,279 INFO L231 Difference]: Finished difference. Result has 85 places, 82 transitions, 750 flow [2025-03-13 21:36:08,279 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=383, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=750, PETRI_PLACES=85, PETRI_TRANSITIONS=82} [2025-03-13 21:36:08,280 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 40 predicate places. [2025-03-13 21:36:08,280 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 82 transitions, 750 flow [2025-03-13 21:36:08,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.0) internal successors, (120), 12 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-03-13 21:36:08,280 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:36:08,280 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:36:08,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 21:36:08,280 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-13 21:36:08,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:36:08,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1931457231, now seen corresponding path program 4 times [2025-03-13 21:36:08,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:36:08,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851696362] [2025-03-13 21:36:08,281 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:36:08,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:36:08,301 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-03-13 21:36:08,312 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-13 21:36:08,312 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:36:08,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:36:08,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:36:08,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:36:08,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851696362] [2025-03-13 21:36:08,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851696362] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:36:08,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:36:08,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-13 21:36:08,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443896536] [2025-03-13 21:36:08,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:36:08,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-13 21:36:08,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:36:08,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-13 21:36:08,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-13 21:36:08,725 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2025-03-13 21:36:08,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 82 transitions, 750 flow. Second operand has 11 states, 11 states have (on average 10.181818181818182) internal successors, (112), 11 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:36:08,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:36:08,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2025-03-13 21:36:08,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:36:09,341 INFO L124 PetriNetUnfolderBase]: 904/1737 cut-off events. [2025-03-13 21:36:09,342 INFO L125 PetriNetUnfolderBase]: For 6126/6126 co-relation queries the response was YES. [2025-03-13 21:36:09,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6108 conditions, 1737 events. 904/1737 cut-off events. For 6126/6126 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 10097 event pairs, 161 based on Foata normal form. 1/1738 useless extension candidates. Maximal degree in co-relation 6034. Up to 451 conditions per place. [2025-03-13 21:36:09,350 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 112 selfloop transitions, 58 changer transitions 0/172 dead transitions. [2025-03-13 21:36:09,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 172 transitions, 1629 flow [2025-03-13 21:36:09,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-13 21:36:09,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-13 21:36:09,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 230 transitions. [2025-03-13 21:36:09,352 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.30666666666666664 [2025-03-13 21:36:09,352 INFO L175 Difference]: Start difference. First operand has 85 places, 82 transitions, 750 flow. Second operand 15 states and 230 transitions. [2025-03-13 21:36:09,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 172 transitions, 1629 flow [2025-03-13 21:36:09,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 172 transitions, 1545 flow, removed 8 selfloop flow, removed 7 redundant places. [2025-03-13 21:36:09,368 INFO L231 Difference]: Finished difference. Result has 99 places, 102 transitions, 1108 flow [2025-03-13 21:36:09,369 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=689, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1108, PETRI_PLACES=99, PETRI_TRANSITIONS=102} [2025-03-13 21:36:09,369 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 54 predicate places. [2025-03-13 21:36:09,369 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 102 transitions, 1108 flow [2025-03-13 21:36:09,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.181818181818182) internal successors, (112), 11 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:36:09,369 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:36:09,369 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:36:09,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 21:36:09,369 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-13 21:36:09,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:36:09,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1933772879, now seen corresponding path program 5 times [2025-03-13 21:36:09,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:36:09,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890781574] [2025-03-13 21:36:09,370 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:36:09,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:36:09,386 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 1 equivalence classes. [2025-03-13 21:36:09,397 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-13 21:36:09,398 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:36:09,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:36:09,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:36:09,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:36:09,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890781574] [2025-03-13 21:36:09,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890781574] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:36:09,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:36:09,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-13 21:36:09,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360330819] [2025-03-13 21:36:09,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:36:09,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-13 21:36:09,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:36:09,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-13 21:36:09,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-13 21:36:09,808 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2025-03-13 21:36:09,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 102 transitions, 1108 flow. Second operand has 11 states, 11 states have (on average 10.181818181818182) internal successors, (112), 11 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:36:09,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:36:09,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2025-03-13 21:36:09,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:36:10,526 INFO L124 PetriNetUnfolderBase]: 904/1735 cut-off events. [2025-03-13 21:36:10,526 INFO L125 PetriNetUnfolderBase]: For 7208/7208 co-relation queries the response was YES. [2025-03-13 21:36:10,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6507 conditions, 1735 events. 904/1735 cut-off events. For 7208/7208 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 9996 event pairs, 70 based on Foata normal form. 1/1736 useless extension candidates. Maximal degree in co-relation 6431. Up to 401 conditions per place. [2025-03-13 21:36:10,537 INFO L140 encePairwiseOnDemand]: 38/50 looper letters, 108 selfloop transitions, 73 changer transitions 0/182 dead transitions. [2025-03-13 21:36:10,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 182 transitions, 1840 flow [2025-03-13 21:36:10,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-13 21:36:10,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-13 21:36:10,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 258 transitions. [2025-03-13 21:36:10,539 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3035294117647059 [2025-03-13 21:36:10,539 INFO L175 Difference]: Start difference. First operand has 99 places, 102 transitions, 1108 flow. Second operand 17 states and 258 transitions. [2025-03-13 21:36:10,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 182 transitions, 1840 flow [2025-03-13 21:36:10,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 182 transitions, 1782 flow, removed 8 selfloop flow, removed 9 redundant places. [2025-03-13 21:36:10,559 INFO L231 Difference]: Finished difference. Result has 108 places, 108 transitions, 1349 flow [2025-03-13 21:36:10,559 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1036, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1349, PETRI_PLACES=108, PETRI_TRANSITIONS=108} [2025-03-13 21:36:10,560 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 63 predicate places. [2025-03-13 21:36:10,561 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 108 transitions, 1349 flow [2025-03-13 21:36:10,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.181818181818182) internal successors, (112), 11 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:36:10,561 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:36:10,561 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:36:10,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 21:36:10,562 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-13 21:36:10,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:36:10,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1487149528, now seen corresponding path program 1 times [2025-03-13 21:36:10,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:36:10,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699135831] [2025-03-13 21:36:10,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:36:10,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:36:10,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-13 21:36:10,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-13 21:36:10,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:36:10,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:36:11,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:36:11,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:36:11,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699135831] [2025-03-13 21:36:11,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699135831] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:36:11,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:36:11,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-13 21:36:11,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998316852] [2025-03-13 21:36:11,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:36:11,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-13 21:36:11,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:36:11,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-13 21:36:11,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-03-13 21:36:11,414 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2025-03-13 21:36:11,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 108 transitions, 1349 flow. Second operand has 14 states, 14 states have (on average 9.857142857142858) internal successors, (138), 14 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:36:11,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:36:11,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2025-03-13 21:36:11,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:36:12,287 INFO L124 PetriNetUnfolderBase]: 1026/1957 cut-off events. [2025-03-13 21:36:12,287 INFO L125 PetriNetUnfolderBase]: For 12009/12009 co-relation queries the response was YES. [2025-03-13 21:36:12,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8045 conditions, 1957 events. 1026/1957 cut-off events. For 12009/12009 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 11422 event pairs, 339 based on Foata normal form. 1/1958 useless extension candidates. Maximal degree in co-relation 7767. Up to 1578 conditions per place. [2025-03-13 21:36:12,298 INFO L140 encePairwiseOnDemand]: 35/50 looper letters, 88 selfloop transitions, 74 changer transitions 45/208 dead transitions. [2025-03-13 21:36:12,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 208 transitions, 2711 flow [2025-03-13 21:36:12,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-13 21:36:12,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-13 21:36:12,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 261 transitions. [2025-03-13 21:36:12,301 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.27473684210526317 [2025-03-13 21:36:12,301 INFO L175 Difference]: Start difference. First operand has 108 places, 108 transitions, 1349 flow. Second operand 19 states and 261 transitions. [2025-03-13 21:36:12,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 208 transitions, 2711 flow [2025-03-13 21:36:12,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 208 transitions, 2583 flow, removed 18 selfloop flow, removed 8 redundant places. [2025-03-13 21:36:12,322 INFO L231 Difference]: Finished difference. Result has 130 places, 143 transitions, 2056 flow [2025-03-13 21:36:12,322 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1269, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=2056, PETRI_PLACES=130, PETRI_TRANSITIONS=143} [2025-03-13 21:36:12,323 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 85 predicate places. [2025-03-13 21:36:12,323 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 143 transitions, 2056 flow [2025-03-13 21:36:12,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.857142857142858) internal successors, (138), 14 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:36:12,323 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:36:12,323 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:36:12,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-13 21:36:12,323 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-13 21:36:12,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:36:12,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1437198564, now seen corresponding path program 2 times [2025-03-13 21:36:12,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:36:12,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757686378] [2025-03-13 21:36:12,324 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:36:12,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:36:12,336 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 1 equivalence classes. [2025-03-13 21:36:12,345 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-13 21:36:12,345 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:36:12,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:36:12,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:36:12,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:36:12,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757686378] [2025-03-13 21:36:12,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757686378] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:36:12,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:36:12,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-13 21:36:12,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172015370] [2025-03-13 21:36:12,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:36:12,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-13 21:36:12,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:36:12,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-13 21:36:12,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-13 21:36:12,980 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2025-03-13 21:36:12,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 143 transitions, 2056 flow. Second operand has 12 states, 12 states have (on average 10.166666666666666) internal successors, (122), 12 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:36:12,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:36:12,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2025-03-13 21:36:12,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:36:13,880 INFO L124 PetriNetUnfolderBase]: 1127/2178 cut-off events. [2025-03-13 21:36:13,880 INFO L125 PetriNetUnfolderBase]: For 14145/14145 co-relation queries the response was YES. [2025-03-13 21:36:13,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10002 conditions, 2178 events. 1127/2178 cut-off events. For 14145/14145 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 13320 event pairs, 424 based on Foata normal form. 2/2180 useless extension candidates. Maximal degree in co-relation 9912. Up to 1620 conditions per place. [2025-03-13 21:36:13,893 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 136 selfloop transitions, 89 changer transitions 34/260 dead transitions. [2025-03-13 21:36:13,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 260 transitions, 3679 flow [2025-03-13 21:36:13,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-13 21:36:13,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-13 21:36:13,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 277 transitions. [2025-03-13 21:36:13,897 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.29157894736842105 [2025-03-13 21:36:13,897 INFO L175 Difference]: Start difference. First operand has 130 places, 143 transitions, 2056 flow. Second operand 19 states and 277 transitions. [2025-03-13 21:36:13,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 260 transitions, 3679 flow [2025-03-13 21:36:13,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 260 transitions, 3478 flow, removed 73 selfloop flow, removed 11 redundant places. [2025-03-13 21:36:13,930 INFO L231 Difference]: Finished difference. Result has 135 places, 179 transitions, 2622 flow [2025-03-13 21:36:13,930 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1949, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=2622, PETRI_PLACES=135, PETRI_TRANSITIONS=179} [2025-03-13 21:36:13,932 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 90 predicate places. [2025-03-13 21:36:13,932 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 179 transitions, 2622 flow [2025-03-13 21:36:13,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.166666666666666) internal successors, (122), 12 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:36:13,932 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:36:13,932 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:36:13,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-13 21:36:13,932 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-13 21:36:13,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:36:13,933 INFO L85 PathProgramCache]: Analyzing trace with hash -978636602, now seen corresponding path program 3 times [2025-03-13 21:36:13,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:36:13,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176220356] [2025-03-13 21:36:13,933 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:36:13,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:36:13,949 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 1 equivalence classes. [2025-03-13 21:36:13,960 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-13 21:36:13,960 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-13 21:36:13,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:36:14,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:36:14,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:36:14,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176220356] [2025-03-13 21:36:14,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176220356] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:36:14,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:36:14,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-13 21:36:14,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324296612] [2025-03-13 21:36:14,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:36:14,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-13 21:36:14,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:36:14,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-13 21:36:14,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-13 21:36:14,540 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2025-03-13 21:36:14,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 179 transitions, 2622 flow. Second operand has 12 states, 12 states have (on average 10.166666666666666) internal successors, (122), 12 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:36:14,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:36:14,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2025-03-13 21:36:14,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:36:15,473 INFO L124 PetriNetUnfolderBase]: 1319/2584 cut-off events. [2025-03-13 21:36:15,473 INFO L125 PetriNetUnfolderBase]: For 18075/18075 co-relation queries the response was YES. [2025-03-13 21:36:15,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12152 conditions, 2584 events. 1319/2584 cut-off events. For 18075/18075 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 16600 event pairs, 465 based on Foata normal form. 2/2586 useless extension candidates. Maximal degree in co-relation 12051. Up to 1668 conditions per place. [2025-03-13 21:36:15,493 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 156 selfloop transitions, 113 changer transitions 36/306 dead transitions. [2025-03-13 21:36:15,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 306 transitions, 4435 flow [2025-03-13 21:36:15,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-13 21:36:15,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-03-13 21:36:15,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 325 transitions. [2025-03-13 21:36:15,495 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2826086956521739 [2025-03-13 21:36:15,495 INFO L175 Difference]: Start difference. First operand has 135 places, 179 transitions, 2622 flow. Second operand 23 states and 325 transitions. [2025-03-13 21:36:15,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 306 transitions, 4435 flow [2025-03-13 21:36:15,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 306 transitions, 4301 flow, removed 34 selfloop flow, removed 6 redundant places. [2025-03-13 21:36:15,545 INFO L231 Difference]: Finished difference. Result has 161 places, 215 transitions, 3492 flow [2025-03-13 21:36:15,545 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=2524, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=3492, PETRI_PLACES=161, PETRI_TRANSITIONS=215} [2025-03-13 21:36:15,545 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 116 predicate places. [2025-03-13 21:36:15,545 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 215 transitions, 3492 flow [2025-03-13 21:36:15,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.166666666666666) internal successors, (122), 12 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:36:15,546 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:36:15,546 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:36:15,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-13 21:36:15,546 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-13 21:36:15,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:36:15,546 INFO L85 PathProgramCache]: Analyzing trace with hash 400293650, now seen corresponding path program 4 times [2025-03-13 21:36:15,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:36:15,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780810632] [2025-03-13 21:36:15,546 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:36:15,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:36:15,557 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-03-13 21:36:15,564 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-13 21:36:15,565 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:36:15,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:36:16,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:36:16,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:36:16,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780810632] [2025-03-13 21:36:16,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780810632] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:36:16,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:36:16,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-13 21:36:16,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850320047] [2025-03-13 21:36:16,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:36:16,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-13 21:36:16,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:36:16,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-13 21:36:16,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-13 21:36:16,104 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2025-03-13 21:36:16,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 215 transitions, 3492 flow. Second operand has 12 states, 12 states have (on average 10.166666666666666) internal successors, (122), 12 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:36:16,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:36:16,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2025-03-13 21:36:16,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:36:16,929 INFO L124 PetriNetUnfolderBase]: 1357/2726 cut-off events. [2025-03-13 21:36:16,930 INFO L125 PetriNetUnfolderBase]: For 21202/21202 co-relation queries the response was YES. [2025-03-13 21:36:16,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13622 conditions, 2726 events. 1357/2726 cut-off events. For 21202/21202 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 18419 event pairs, 594 based on Foata normal form. 2/2728 useless extension candidates. Maximal degree in co-relation 13494. Up to 1960 conditions per place. [2025-03-13 21:36:16,944 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 191 selfloop transitions, 101 changer transitions 32/325 dead transitions. [2025-03-13 21:36:16,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 325 transitions, 5183 flow [2025-03-13 21:36:16,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-13 21:36:16,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-13 21:36:16,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 308 transitions. [2025-03-13 21:36:16,948 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.29333333333333333 [2025-03-13 21:36:16,948 INFO L175 Difference]: Start difference. First operand has 161 places, 215 transitions, 3492 flow. Second operand 21 states and 308 transitions. [2025-03-13 21:36:16,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 325 transitions, 5183 flow [2025-03-13 21:36:17,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 325 transitions, 5106 flow, removed 23 selfloop flow, removed 6 redundant places. [2025-03-13 21:36:17,011 INFO L231 Difference]: Finished difference. Result has 179 places, 235 transitions, 4031 flow [2025-03-13 21:36:17,012 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=3434, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=4031, PETRI_PLACES=179, PETRI_TRANSITIONS=235} [2025-03-13 21:36:17,012 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 134 predicate places. [2025-03-13 21:36:17,013 INFO L471 AbstractCegarLoop]: Abstraction has has 179 places, 235 transitions, 4031 flow [2025-03-13 21:36:17,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.166666666666666) internal successors, (122), 12 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:36:17,013 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:36:17,013 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:36:17,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-13 21:36:17,013 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-13 21:36:17,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:36:17,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1526275524, now seen corresponding path program 5 times [2025-03-13 21:36:17,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:36:17,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391542064] [2025-03-13 21:36:17,014 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:36:17,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:36:17,025 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 1 equivalence classes. [2025-03-13 21:36:17,033 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-13 21:36:17,033 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:36:17,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:36:17,033 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 21:36:17,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-13 21:36:17,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-13 21:36:17,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:36:17,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:36:17,066 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 21:36:17,066 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 21:36:17,067 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2025-03-13 21:36:17,068 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-03-13 21:36:17,068 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2025-03-13 21:36:17,068 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-03-13 21:36:17,069 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2025-03-13 21:36:17,069 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2025-03-13 21:36:17,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-13 21:36:17,069 INFO L422 BasicCegarLoop]: Path program histogram: [5, 5, 1, 1, 1, 1, 1] [2025-03-13 21:36:17,106 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-13 21:36:17,106 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-13 21:36:17,111 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.03 09:36:17 BasicIcfg [2025-03-13 21:36:17,111 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-13 21:36:17,111 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-13 21:36:17,111 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-13 21:36:17,111 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-13 21:36:17,112 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:36:01" (3/4) ... [2025-03-13 21:36:17,113 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-13 21:36:17,171 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 15. [2025-03-13 21:36:17,210 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-13 21:36:17,211 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-13 21:36:17,211 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-13 21:36:17,212 INFO L158 Benchmark]: Toolchain (without parser) took 16790.63ms. Allocated memory was 201.3MB in the beginning and 520.1MB in the end (delta: 318.8MB). Free memory was 157.2MB in the beginning and 363.7MB in the end (delta: -206.5MB). Peak memory consumption was 113.0MB. Max. memory is 16.1GB. [2025-03-13 21:36:17,212 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 115.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 21:36:17,212 INFO L158 Benchmark]: CACSL2BoogieTranslator took 403.02ms. Allocated memory is still 201.3MB. Free memory was 156.9MB in the beginning and 126.4MB in the end (delta: 30.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-13 21:36:17,213 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.46ms. Allocated memory is still 201.3MB. Free memory was 126.4MB in the beginning and 123.9MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 21:36:17,213 INFO L158 Benchmark]: Boogie Preprocessor took 43.08ms. Allocated memory is still 201.3MB. Free memory was 123.9MB in the beginning and 120.8MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 21:36:17,213 INFO L158 Benchmark]: IcfgBuilder took 545.72ms. Allocated memory is still 201.3MB. Free memory was 120.8MB in the beginning and 81.1MB in the end (delta: 39.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-13 21:36:17,214 INFO L158 Benchmark]: TraceAbstraction took 15662.49ms. Allocated memory was 201.3MB in the beginning and 520.1MB in the end (delta: 318.8MB). Free memory was 80.5MB in the beginning and 376.6MB in the end (delta: -296.1MB). Peak memory consumption was 20.7MB. Max. memory is 16.1GB. [2025-03-13 21:36:17,214 INFO L158 Benchmark]: Witness Printer took 99.83ms. Allocated memory is still 520.1MB. Free memory was 376.6MB in the beginning and 363.7MB in the end (delta: 13.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-13 21:36:17,215 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.21ms. Allocated memory is still 201.3MB. Free memory is still 115.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 403.02ms. Allocated memory is still 201.3MB. Free memory was 156.9MB in the beginning and 126.4MB in the end (delta: 30.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.46ms. Allocated memory is still 201.3MB. Free memory was 126.4MB in the beginning and 123.9MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 43.08ms. Allocated memory is still 201.3MB. Free memory was 123.9MB in the beginning and 120.8MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 545.72ms. Allocated memory is still 201.3MB. Free memory was 120.8MB in the beginning and 81.1MB in the end (delta: 39.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 15662.49ms. Allocated memory was 201.3MB in the beginning and 520.1MB in the end (delta: 318.8MB). Free memory was 80.5MB in the beginning and 376.6MB in the end (delta: -296.1MB). Peak memory consumption was 20.7MB. Max. memory is 16.1GB. * Witness Printer took 99.83ms. Allocated memory is still 520.1MB. Free memory was 376.6MB in the beginning and 363.7MB in the end (delta: 13.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 3887]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L3888] 0 pthread_t t1,t2; [L3950] CALL, EXPR 0 my_drv_init() [L3944] 0 return 0; [L3950] RET, EXPR 0 my_drv_init() [L3950] 0 int ret = my_drv_init(); [L3951] COND TRUE 0 ret==0 [L3952] 0 int probe_ret; [L3953] 0 struct my_data data; [L3954] CALL, EXPR 0 my_drv_probe(&data) [L3920] 0 struct device *d = &data->dev; [L3924] 0 data->shared.a = 0 [L3925] 0 data->shared.b = 0 [L3926] 0 int res = __VERIFIER_nondet_int(); [L3927] COND FALSE 0 !(\read(res)) [L3930] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, (void *)d) VAL [\old(arg)={5:24}, \old(data)={5:0}, d={5:24}, data={5:0}, res=0, t1=-1, t2=0] [L3902] 1 struct device *dev = (struct device*)arg; [L3903] 1 struct my_data *data; [L3904] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); [L3904] 1 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );} [L3904] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );}) [L3908] 1 data->shared.a = 1 VAL [\old(arg)={5:24}, arg={5:24}, data={5:0}, dev={5:24}, t1=-1, t2=0] [L3931] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, (void *)d) VAL [\old(arg)={5:24}, \old(data)={5:0}, arg={5:24}, d={5:24}, data={5:0}, data={5:0}, dev={5:24}, res=0, t1=-1, t2=0] [L3932] 0 return 0; VAL [\old(arg)={5:24}, \old(data)={5:0}, \result=0, arg={5:24}, d={5:24}, data={5:0}, data={5:0}, dev={5:24}, res=0, t1=-1, t2=0] [L3902] 2 struct device *dev = (struct device*)arg; [L3903] 2 struct my_data *data; [L3904] 2 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); [L3904] 2 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );} [L3904] 2 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );}) [L3908] 2 data->shared.a = 1 VAL [\old(arg)={5:24}, arg={5:24}, data={5:0}, dev={5:24}, t1=-1, t2=0] [L3911] EXPR 2 data->shared.b [L3911] 2 int lb = data->shared.b; [L3911] EXPR 1 data->shared.b [L3911] 1 int lb = data->shared.b; [L3914] 1 data->shared.b = lb + 1 VAL [\old(arg)={5:24}, arg={5:24}, data={5:0}, dev={5:24}, lb=0, t1=-1, t2=0] [L3917] 1 return 0; [L3954] RET, EXPR 0 my_drv_probe(&data) [L3954] 0 probe_ret = my_drv_probe(&data) [L3955] COND TRUE 0 probe_ret==0 [L3956] CALL 0 my_drv_disconnect(&data) [L3938] 0 void *status; VAL [\old(arg)={5:24}, \old(data)={5:0}, \result={0:0}, arg={5:24}, data={5:0}, data={5:0}, dev={5:24}, lb=0, status={3:0}, t1=-1, t2=0] [L3939] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\old(arg)={5:24}, \old(data)={5:0}, \result={0:0}, arg={5:24}, data={5:0}, data={5:0}, dev={5:24}, lb=0, status={3:0}, t1=-1, t2=0] [L3914] 2 data->shared.b = lb + 1 VAL [\old(arg)={5:24}, \result={0:0}, arg={5:24}, data={5:0}, dev={5:24}, lb=0, t1=-1, t2=0] [L3917] 2 return 0; [L3940] FCALL, JOIN 2 pthread_join(t2, &status) VAL [\old(arg)={5:24}, \old(data)={5:0}, \result={0:0}, arg={5:24}, data={5:0}, data={5:0}, dev={5:24}, lb=0, status={3:0}, t1=-1, t2=0] [L3956] RET 0 my_drv_disconnect(&data) [L3957] EXPR 0 data.shared.a [L3957] CALL 0 ldv_assert(data.shared.a==1) [L3887] COND FALSE 0 !(!expression) VAL [\old(arg)={5:24}, \old(expression)=1, \result={0:0}, arg={5:24}, data={5:0}, dev={5:24}, expression=1, lb=0, t1=-1, t2=0] [L3957] RET 0 ldv_assert(data.shared.a==1) [L3958] EXPR 0 data.shared.b [L3958] CALL 0 ldv_assert(data.shared.b==2) [L3887] COND TRUE 0 !expression VAL [\old(arg)={5:24}, \old(expression)=0, \result={0:0}, arg={5:24}, data={5:0}, dev={5:24}, expression=0, lb=0, t1=-1, t2=0] [L3887] 0 reach_error() VAL [\old(arg)={5:24}, \old(expression)=0, \result={0:0}, arg={5:24}, data={5:0}, dev={5:24}, expression=0, lb=0, t1=-1, t2=0] - UnprovableResult [Line: 3887]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 3887]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 3887]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 3930]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 3931]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 4 procedures, 52 locations, 6 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: 15.5s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 8.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1675 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1617 mSDsluCounter, 1462 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1387 mSDsCounter, 208 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5844 IncrementalHoareTripleChecker+Invalid, 6052 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 208 mSolverCounterUnsat, 75 mSDtfsCounter, 5844 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 257 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 737 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4031occurred in iteration=14, InterpolantAutomatonStates: 186, 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.2s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 328 NumberOfCodeBlocks, 328 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 287 ConstructedInterpolants, 0 QuantifiedInterpolants, 3306 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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 RESULT: Ultimate proved your program to be incorrect! [2025-03-13 21:36:17,231 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE