./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-races/race-3_1-container_of-global.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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-3_1-container_of-global.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 75716fdd637a22328d600b3257cf24f40a7920b464397c315485c5ed90fb6ece --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:12:08,791 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:12:08,849 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 02:12:08,853 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:12:08,853 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:12:08,876 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:12:08,877 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:12:08,877 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:12:08,878 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:12:08,878 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:12:08,878 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:12:08,879 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:12:08,879 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:12:08,879 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:12:08,879 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:12:08,879 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:12:08,880 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:12:08,880 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 02:12:08,880 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:12:08,880 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 02:12:08,880 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:12:08,880 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:12:08,880 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:12:08,880 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:12:08,880 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 02:12:08,880 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:12:08,880 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:12:08,881 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:12:08,881 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:12:08,881 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:12:08,881 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:12:08,881 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:12:08,881 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:12:08,882 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:12:08,882 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:12:08,882 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:12:08,882 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:12:08,882 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:12:08,882 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:12:08,882 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:12:08,882 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:12:08,882 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:12:08,882 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:12:08,882 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/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 -> 75716fdd637a22328d600b3257cf24f40a7920b464397c315485c5ed90fb6ece [2025-03-04 02:12:09,124 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:12:09,134 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:12:09,137 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:12:09,138 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:12:09,138 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:12:09,140 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-races/race-3_1-container_of-global.i [2025-03-04 02:12:10,357 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1725b08e/317204052a6440b7a38bc3fdd6cae395/FLAG2dc581f8d [2025-03-04 02:12:10,702 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:12:10,703 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-3_1-container_of-global.i [2025-03-04 02:12:10,728 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1725b08e/317204052a6440b7a38bc3fdd6cae395/FLAG2dc581f8d [2025-03-04 02:12:10,742 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1725b08e/317204052a6440b7a38bc3fdd6cae395 [2025-03-04 02:12:10,744 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:12:10,746 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:12:10,747 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:12:10,747 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:12:10,751 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:12:10,752 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:12:10" (1/1) ... [2025-03-04 02:12:10,753 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77b13c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:12:10, skipping insertion in model container [2025-03-04 02:12:10,754 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:12:10" (1/1) ... [2025-03-04 02:12:10,799 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:12:11,084 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-3_1-container_of-global.i[186210,186223] [2025-03-04 02:12:11,115 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:12:11,124 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:12:11,174 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-3_1-container_of-global.i[186210,186223] [2025-03-04 02:12:11,187 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:12:11,219 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:12:11,220 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:12:11 WrapperNode [2025-03-04 02:12:11,220 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:12:11,221 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:12:11,221 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:12:11,221 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:12:11,225 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:12:11" (1/1) ... [2025-03-04 02:12:11,239 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:12:11" (1/1) ... [2025-03-04 02:12:11,256 INFO L138 Inliner]: procedures = 246, calls = 39, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 127 [2025-03-04 02:12:11,256 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:12:11,257 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:12:11,257 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:12:11,257 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:12:11,263 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:12:11" (1/1) ... [2025-03-04 02:12:11,263 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:12:11" (1/1) ... [2025-03-04 02:12:11,271 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:12:11" (1/1) ... [2025-03-04 02:12:11,290 INFO L175 MemorySlicer]: Split 17 memory accesses to 3 slices as follows [2, 13, 2]. 76 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, 6, 2]. [2025-03-04 02:12:11,291 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:12:11" (1/1) ... [2025-03-04 02:12:11,291 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:12:11" (1/1) ... [2025-03-04 02:12:11,306 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:12:11" (1/1) ... [2025-03-04 02:12:11,306 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:12:11" (1/1) ... [2025-03-04 02:12:11,309 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:12:11" (1/1) ... [2025-03-04 02:12:11,310 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:12:11" (1/1) ... [2025-03-04 02:12:11,320 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:12:11,321 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:12:11,321 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:12:11,321 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:12:11,322 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:12:11" (1/1) ... [2025-03-04 02:12:11,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:12:11,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:12:11,351 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-04 02:12:11,353 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-04 02:12:11,375 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2025-03-04 02:12:11,375 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2025-03-04 02:12:11,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 02:12:11,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 02:12:11,375 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 02:12:11,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 02:12:11,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 02:12:11,376 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 02:12:11,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 02:12:11,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 02:12:11,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 02:12:11,376 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 02:12:11,376 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:12:11,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 02:12:11,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 02:12:11,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 02:12:11,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:12:11,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 02:12:11,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 02:12:11,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:12:11,376 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:12:11,377 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 02:12:11,590 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:12:11,592 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:12:11,817 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 02:12:11,817 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:12:11,926 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:12:11,926 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:12:11,927 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:12:11 BoogieIcfgContainer [2025-03-04 02:12:11,927 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:12:11,929 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:12:11,929 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:12:11,932 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:12:11,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:12:10" (1/3) ... [2025-03-04 02:12:11,933 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27f96895 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:12:11, skipping insertion in model container [2025-03-04 02:12:11,933 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:12:11" (2/3) ... [2025-03-04 02:12:11,933 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27f96895 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:12:11, skipping insertion in model container [2025-03-04 02:12:11,933 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:12:11" (3/3) ... [2025-03-04 02:12:11,934 INFO L128 eAbstractionObserver]: Analyzing ICFG race-3_1-container_of-global.i [2025-03-04 02:12:11,944 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:12:11,945 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG race-3_1-container_of-global.i that has 2 procedures, 46 locations, 1 initial locations, 0 loop locations, and 6 error locations. [2025-03-04 02:12:11,945 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 02:12:11,991 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 02:12:12,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 60 transitions, 134 flow [2025-03-04 02:12:12,071 INFO L124 PetriNetUnfolderBase]: 10/73 cut-off events. [2025-03-04 02:12:12,073 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 02:12:12,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82 conditions, 73 events. 10/73 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 146 event pairs, 0 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 39. Up to 4 conditions per place. [2025-03-04 02:12:12,078 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 60 transitions, 134 flow [2025-03-04 02:12:12,081 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 53 transitions, 118 flow [2025-03-04 02:12:12,091 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:12:12,101 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;@515b2597, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:12:12,102 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-04 02:12:12,106 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:12:12,109 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-03-04 02:12:12,110 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 02:12:12,110 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:12:12,110 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-04 02:12:12,110 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-04 02:12:12,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:12:12,116 INFO L85 PathProgramCache]: Analyzing trace with hash 11437230, now seen corresponding path program 1 times [2025-03-04 02:12:12,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:12:12,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402319559] [2025-03-04 02:12:12,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:12:12,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:12:12,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 02:12:12,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 02:12:12,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:12:12,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:12:12,536 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-04 02:12:12,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:12:12,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402319559] [2025-03-04 02:12:12,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402319559] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:12:12,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:12:12,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:12:12,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978137298] [2025-03-04 02:12:12,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:12:12,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:12:12,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:12:12,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:12:12,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:12:12,598 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-03-04 02:12:12,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 53 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-04 02:12:12,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:12:12,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-03-04 02:12:12,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:12:12,883 INFO L124 PetriNetUnfolderBase]: 466/826 cut-off events. [2025-03-04 02:12:12,883 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-04 02:12:12,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1651 conditions, 826 events. 466/826 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3463 event pairs, 345 based on Foata normal form. 3/825 useless extension candidates. Maximal degree in co-relation 1541. Up to 602 conditions per place. [2025-03-04 02:12:12,892 INFO L140 encePairwiseOnDemand]: 45/60 looper letters, 39 selfloop transitions, 10 changer transitions 0/54 dead transitions. [2025-03-04 02:12:12,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 54 transitions, 218 flow [2025-03-04 02:12:12,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:12:12,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:12:12,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2025-03-04 02:12:12,903 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2025-03-04 02:12:12,905 INFO L175 Difference]: Start difference. First operand has 53 places, 53 transitions, 118 flow. Second operand 3 states and 84 transitions. [2025-03-04 02:12:12,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 54 transitions, 218 flow [2025-03-04 02:12:12,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 54 transitions, 210 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 02:12:12,911 INFO L231 Difference]: Finished difference. Result has 47 places, 44 transitions, 112 flow [2025-03-04 02:12:12,914 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=47, PETRI_TRANSITIONS=44} [2025-03-04 02:12:12,918 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -6 predicate places. [2025-03-04 02:12:12,919 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 44 transitions, 112 flow [2025-03-04 02:12:12,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-04 02:12:12,919 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:12:12,919 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 02:12:12,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:12:12,919 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-04 02:12:12,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:12:12,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1893666241, now seen corresponding path program 1 times [2025-03-04 02:12:12,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:12:12,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547315209] [2025-03-04 02:12:12,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:12:12,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:12:12,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 02:12:12,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 02:12:12,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:12:12,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:12:13,082 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-04 02:12:13,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:12:13,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547315209] [2025-03-04 02:12:13,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547315209] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:12:13,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:12:13,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:12:13,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210663929] [2025-03-04 02:12:13,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:12:13,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:12:13,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:12:13,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:12:13,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:12:13,107 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-03-04 02:12:13,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 44 transitions, 112 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:12:13,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:12:13,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-03-04 02:12:13,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:12:13,298 INFO L124 PetriNetUnfolderBase]: 466/821 cut-off events. [2025-03-04 02:12:13,298 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2025-03-04 02:12:13,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1712 conditions, 821 events. 466/821 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3455 event pairs, 155 based on Foata normal form. 1/821 useless extension candidates. Maximal degree in co-relation 818. Up to 553 conditions per place. [2025-03-04 02:12:13,306 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 47 selfloop transitions, 11 changer transitions 0/62 dead transitions. [2025-03-04 02:12:13,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 62 transitions, 265 flow [2025-03-04 02:12:13,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:12:13,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:12:13,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 109 transitions. [2025-03-04 02:12:13,310 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36333333333333334 [2025-03-04 02:12:13,311 INFO L175 Difference]: Start difference. First operand has 47 places, 44 transitions, 112 flow. Second operand 5 states and 109 transitions. [2025-03-04 02:12:13,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 62 transitions, 265 flow [2025-03-04 02:12:13,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 62 transitions, 245 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 02:12:13,313 INFO L231 Difference]: Finished difference. Result has 48 places, 45 transitions, 126 flow [2025-03-04 02:12:13,315 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=126, PETRI_PLACES=48, PETRI_TRANSITIONS=45} [2025-03-04 02:12:13,317 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -5 predicate places. [2025-03-04 02:12:13,317 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 45 transitions, 126 flow [2025-03-04 02:12:13,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:12:13,317 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:12:13,318 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:12:13,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:12:13,318 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-04 02:12:13,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:12:13,319 INFO L85 PathProgramCache]: Analyzing trace with hash 2123878069, now seen corresponding path program 1 times [2025-03-04 02:12:13,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:12:13,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550018331] [2025-03-04 02:12:13,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:12:13,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:12:13,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 02:12:13,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 02:12:13,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:12:13,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:12:13,563 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-04 02:12:13,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:12:13,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550018331] [2025-03-04 02:12:13,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550018331] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:12:13,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:12:13,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:12:13,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319771882] [2025-03-04 02:12:13,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:12:13,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:12:13,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:12:13,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:12:13,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:12:13,583 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-03-04 02:12:13,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 45 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-04 02:12:13,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:12:13,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-03-04 02:12:13,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:12:13,793 INFO L124 PetriNetUnfolderBase]: 562/1029 cut-off events. [2025-03-04 02:12:13,793 INFO L125 PetriNetUnfolderBase]: For 176/176 co-relation queries the response was YES. [2025-03-04 02:12:13,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2319 conditions, 1029 events. 562/1029 cut-off events. For 176/176 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4892 event pairs, 252 based on Foata normal form. 64/1092 useless extension candidates. Maximal degree in co-relation 228. Up to 545 conditions per place. [2025-03-04 02:12:13,799 INFO L140 encePairwiseOnDemand]: 47/60 looper letters, 49 selfloop transitions, 10 changer transitions 4/67 dead transitions. [2025-03-04 02:12:13,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 67 transitions, 306 flow [2025-03-04 02:12:13,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:12:13,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:12:13,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2025-03-04 02:12:13,802 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.425 [2025-03-04 02:12:13,803 INFO L175 Difference]: Start difference. First operand has 48 places, 45 transitions, 126 flow. Second operand 4 states and 102 transitions. [2025-03-04 02:12:13,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 67 transitions, 306 flow [2025-03-04 02:12:13,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 67 transitions, 286 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 02:12:13,805 INFO L231 Difference]: Finished difference. Result has 50 places, 44 transitions, 150 flow [2025-03-04 02:12:13,805 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=150, PETRI_PLACES=50, PETRI_TRANSITIONS=44} [2025-03-04 02:12:13,805 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -3 predicate places. [2025-03-04 02:12:13,805 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 44 transitions, 150 flow [2025-03-04 02:12:13,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-04 02:12:13,806 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:12:13,807 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:12:13,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:12:13,807 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-04 02:12:13,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:12:13,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1145379758, now seen corresponding path program 1 times [2025-03-04 02:12:13,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:12:13,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971896548] [2025-03-04 02:12:13,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:12:13,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:12:13,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 02:12:13,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:12:13,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:12:13,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:12:13,898 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-04 02:12:13,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:12:13,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971896548] [2025-03-04 02:12:13,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971896548] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:12:13,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:12:13,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:12:13,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506831704] [2025-03-04 02:12:13,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:12:13,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:12:13,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:12:13,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:12:13,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:12:13,902 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 60 [2025-03-04 02:12:13,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 44 transitions, 150 flow. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 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-04 02:12:13,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:12:13,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 60 [2025-03-04 02:12:13,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:12:14,044 INFO L124 PetriNetUnfolderBase]: 225/408 cut-off events. [2025-03-04 02:12:14,045 INFO L125 PetriNetUnfolderBase]: For 99/99 co-relation queries the response was YES. [2025-03-04 02:12:14,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 958 conditions, 408 events. 225/408 cut-off events. For 99/99 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1439 event pairs, 46 based on Foata normal form. 0/408 useless extension candidates. Maximal degree in co-relation 927. Up to 217 conditions per place. [2025-03-04 02:12:14,047 INFO L140 encePairwiseOnDemand]: 57/60 looper letters, 48 selfloop transitions, 3 changer transitions 0/58 dead transitions. [2025-03-04 02:12:14,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 58 transitions, 278 flow [2025-03-04 02:12:14,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:12:14,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:12:14,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2025-03-04 02:12:14,050 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5458333333333333 [2025-03-04 02:12:14,050 INFO L175 Difference]: Start difference. First operand has 50 places, 44 transitions, 150 flow. Second operand 4 states and 131 transitions. [2025-03-04 02:12:14,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 58 transitions, 278 flow [2025-03-04 02:12:14,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 58 transitions, 248 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-03-04 02:12:14,052 INFO L231 Difference]: Finished difference. Result has 41 places, 36 transitions, 96 flow [2025-03-04 02:12:14,052 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=96, PETRI_PLACES=41, PETRI_TRANSITIONS=36} [2025-03-04 02:12:14,053 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -12 predicate places. [2025-03-04 02:12:14,053 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 36 transitions, 96 flow [2025-03-04 02:12:14,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 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-04 02:12:14,053 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:12:14,053 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:12:14,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:12:14,053 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-04 02:12:14,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:12:14,054 INFO L85 PathProgramCache]: Analyzing trace with hash 767607192, now seen corresponding path program 1 times [2025-03-04 02:12:14,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:12:14,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060324069] [2025-03-04 02:12:14,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:12:14,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:12:14,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 02:12:14,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 02:12:14,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:12:14,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:12:14,482 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-04 02:12:14,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:12:14,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060324069] [2025-03-04 02:12:14,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060324069] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:12:14,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:12:14,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:12:14,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218680087] [2025-03-04 02:12:14,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:12:14,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:12:14,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:12:14,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:12:14,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:12:14,486 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 60 [2025-03-04 02:12:14,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 36 transitions, 96 flow. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:12:14,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:12:14,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 60 [2025-03-04 02:12:14,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:12:14,681 INFO L124 PetriNetUnfolderBase]: 251/458 cut-off events. [2025-03-04 02:12:14,681 INFO L125 PetriNetUnfolderBase]: For 182/182 co-relation queries the response was YES. [2025-03-04 02:12:14,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1111 conditions, 458 events. 251/458 cut-off events. For 182/182 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1789 event pairs, 35 based on Foata normal form. 8/465 useless extension candidates. Maximal degree in co-relation 219. Up to 271 conditions per place. [2025-03-04 02:12:14,684 INFO L140 encePairwiseOnDemand]: 54/60 looper letters, 56 selfloop transitions, 6 changer transitions 0/69 dead transitions. [2025-03-04 02:12:14,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 69 transitions, 332 flow [2025-03-04 02:12:14,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:12:14,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:12:14,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 164 transitions. [2025-03-04 02:12:14,685 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5466666666666666 [2025-03-04 02:12:14,686 INFO L175 Difference]: Start difference. First operand has 41 places, 36 transitions, 96 flow. Second operand 5 states and 164 transitions. [2025-03-04 02:12:14,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 69 transitions, 332 flow [2025-03-04 02:12:14,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 69 transitions, 316 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 02:12:14,687 INFO L231 Difference]: Finished difference. Result has 45 places, 40 transitions, 126 flow [2025-03-04 02:12:14,687 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=126, PETRI_PLACES=45, PETRI_TRANSITIONS=40} [2025-03-04 02:12:14,688 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -8 predicate places. [2025-03-04 02:12:14,688 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 126 flow [2025-03-04 02:12:14,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:12:14,688 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:12:14,688 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:12:14,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 02:12:14,689 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-04 02:12:14,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:12:14,689 INFO L85 PathProgramCache]: Analyzing trace with hash 24889744, now seen corresponding path program 2 times [2025-03-04 02:12:14,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:12:14,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190211428] [2025-03-04 02:12:14,690 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:12:14,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:12:14,719 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 1 equivalence classes. [2025-03-04 02:12:14,737 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 02:12:14,737 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:12:14,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:12:15,143 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-04 02:12:15,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:12:15,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190211428] [2025-03-04 02:12:15,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190211428] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:12:15,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:12:15,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:12:15,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552958981] [2025-03-04 02:12:15,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:12:15,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:12:15,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:12:15,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:12:15,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:12:15,145 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 60 [2025-03-04 02:12:15,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 126 flow. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:12:15,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:12:15,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 60 [2025-03-04 02:12:15,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:12:15,330 INFO L124 PetriNetUnfolderBase]: 281/516 cut-off events. [2025-03-04 02:12:15,330 INFO L125 PetriNetUnfolderBase]: For 225/225 co-relation queries the response was YES. [2025-03-04 02:12:15,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1441 conditions, 516 events. 281/516 cut-off events. For 225/225 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2030 event pairs, 37 based on Foata normal form. 8/523 useless extension candidates. Maximal degree in co-relation 354. Up to 307 conditions per place. [2025-03-04 02:12:15,333 INFO L140 encePairwiseOnDemand]: 54/60 looper letters, 58 selfloop transitions, 8 changer transitions 0/73 dead transitions. [2025-03-04 02:12:15,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 73 transitions, 378 flow [2025-03-04 02:12:15,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:12:15,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:12:15,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 164 transitions. [2025-03-04 02:12:15,335 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5466666666666666 [2025-03-04 02:12:15,335 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 126 flow. Second operand 5 states and 164 transitions. [2025-03-04 02:12:15,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 73 transitions, 378 flow [2025-03-04 02:12:15,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 73 transitions, 375 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:12:15,336 INFO L231 Difference]: Finished difference. Result has 50 places, 44 transitions, 172 flow [2025-03-04 02:12:15,337 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=172, PETRI_PLACES=50, PETRI_TRANSITIONS=44} [2025-03-04 02:12:15,337 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -3 predicate places. [2025-03-04 02:12:15,337 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 44 transitions, 172 flow [2025-03-04 02:12:15,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:12:15,337 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:12:15,338 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:12:15,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 02:12:15,338 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-04 02:12:15,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:12:15,338 INFO L85 PathProgramCache]: Analyzing trace with hash 951724394, now seen corresponding path program 3 times [2025-03-04 02:12:15,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:12:15,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126014367] [2025-03-04 02:12:15,339 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:12:15,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:12:15,357 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 1 equivalence classes. [2025-03-04 02:12:15,368 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 02:12:15,368 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 02:12:15,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:12:15,707 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-04 02:12:15,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:12:15,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126014367] [2025-03-04 02:12:15,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126014367] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:12:15,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:12:15,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 02:12:15,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591363329] [2025-03-04 02:12:15,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:12:15,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:12:15,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:12:15,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:12:15,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:12:15,723 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-03-04 02:12:15,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 44 transitions, 172 flow. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 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-04 02:12:15,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:12:15,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-03-04 02:12:15,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:12:16,046 INFO L124 PetriNetUnfolderBase]: 324/607 cut-off events. [2025-03-04 02:12:16,046 INFO L125 PetriNetUnfolderBase]: For 577/577 co-relation queries the response was YES. [2025-03-04 02:12:16,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1923 conditions, 607 events. 324/607 cut-off events. For 577/577 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2443 event pairs, 38 based on Foata normal form. 0/606 useless extension candidates. Maximal degree in co-relation 696. Up to 171 conditions per place. [2025-03-04 02:12:16,049 INFO L140 encePairwiseOnDemand]: 47/60 looper letters, 82 selfloop transitions, 23 changer transitions 0/107 dead transitions. [2025-03-04 02:12:16,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 107 transitions, 682 flow [2025-03-04 02:12:16,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 02:12:16,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 02:12:16,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 201 transitions. [2025-03-04 02:12:16,050 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2791666666666667 [2025-03-04 02:12:16,050 INFO L175 Difference]: Start difference. First operand has 50 places, 44 transitions, 172 flow. Second operand 12 states and 201 transitions. [2025-03-04 02:12:16,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 107 transitions, 682 flow [2025-03-04 02:12:16,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 107 transitions, 674 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-04 02:12:16,053 INFO L231 Difference]: Finished difference. Result has 64 places, 55 transitions, 288 flow [2025-03-04 02:12:16,053 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=288, PETRI_PLACES=64, PETRI_TRANSITIONS=55} [2025-03-04 02:12:16,053 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 11 predicate places. [2025-03-04 02:12:16,053 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 55 transitions, 288 flow [2025-03-04 02:12:16,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 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-04 02:12:16,055 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:12:16,055 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:12:16,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 02:12:16,056 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-04 02:12:16,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:12:16,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1738171910, now seen corresponding path program 4 times [2025-03-04 02:12:16,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:12:16,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945279241] [2025-03-04 02:12:16,057 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:12:16,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:12:16,076 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-03-04 02:12:16,093 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 02:12:16,093 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:12:16,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:12:16,315 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-04 02:12:16,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:12:16,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945279241] [2025-03-04 02:12:16,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945279241] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:12:16,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:12:16,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:12:16,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912109093] [2025-03-04 02:12:16,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:12:16,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:12:16,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:12:16,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:12:16,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:12:16,317 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 60 [2025-03-04 02:12:16,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 55 transitions, 288 flow. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:12:16,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:12:16,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 60 [2025-03-04 02:12:16,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:12:16,540 INFO L124 PetriNetUnfolderBase]: 437/848 cut-off events. [2025-03-04 02:12:16,540 INFO L125 PetriNetUnfolderBase]: For 1430/1430 co-relation queries the response was YES. [2025-03-04 02:12:16,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2923 conditions, 848 events. 437/848 cut-off events. For 1430/1430 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 4074 event pairs, 115 based on Foata normal form. 16/864 useless extension candidates. Maximal degree in co-relation 2881. Up to 515 conditions per place. [2025-03-04 02:12:16,546 INFO L140 encePairwiseOnDemand]: 54/60 looper letters, 87 selfloop transitions, 10 changer transitions 0/105 dead transitions. [2025-03-04 02:12:16,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 105 transitions, 750 flow [2025-03-04 02:12:16,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:12:16,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:12:16,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 173 transitions. [2025-03-04 02:12:16,547 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5766666666666667 [2025-03-04 02:12:16,547 INFO L175 Difference]: Start difference. First operand has 64 places, 55 transitions, 288 flow. Second operand 5 states and 173 transitions. [2025-03-04 02:12:16,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 105 transitions, 750 flow [2025-03-04 02:12:16,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 105 transitions, 725 flow, removed 8 selfloop flow, removed 3 redundant places. [2025-03-04 02:12:16,556 INFO L231 Difference]: Finished difference. Result has 68 places, 61 transitions, 370 flow [2025-03-04 02:12:16,557 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=370, PETRI_PLACES=68, PETRI_TRANSITIONS=61} [2025-03-04 02:12:16,558 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 15 predicate places. [2025-03-04 02:12:16,558 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 61 transitions, 370 flow [2025-03-04 02:12:16,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:12:16,559 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:12:16,559 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:12:16,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 02:12:16,560 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-04 02:12:16,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:12:16,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1955268214, now seen corresponding path program 5 times [2025-03-04 02:12:16,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:12:16,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300348731] [2025-03-04 02:12:16,560 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:12:16,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:12:16,592 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 1 equivalence classes. [2025-03-04 02:12:16,603 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 02:12:16,604 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:12:16,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:12:16,872 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-04 02:12:16,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:12:16,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300348731] [2025-03-04 02:12:16,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300348731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:12:16,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:12:16,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 02:12:16,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049851585] [2025-03-04 02:12:16,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:12:16,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:12:16,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:12:16,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:12:16,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:12:16,896 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-03-04 02:12:16,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 61 transitions, 370 flow. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 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-04 02:12:16,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:12:16,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-03-04 02:12:16,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:12:17,241 INFO L124 PetriNetUnfolderBase]: 437/844 cut-off events. [2025-03-04 02:12:17,241 INFO L125 PetriNetUnfolderBase]: For 2275/2275 co-relation queries the response was YES. [2025-03-04 02:12:17,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3182 conditions, 844 events. 437/844 cut-off events. For 2275/2275 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3981 event pairs, 45 based on Foata normal form. 2/846 useless extension candidates. Maximal degree in co-relation 3139. Up to 246 conditions per place. [2025-03-04 02:12:17,249 INFO L140 encePairwiseOnDemand]: 47/60 looper letters, 93 selfloop transitions, 27 changer transitions 0/121 dead transitions. [2025-03-04 02:12:17,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 121 transitions, 1017 flow [2025-03-04 02:12:17,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 02:12:17,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 02:12:17,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 202 transitions. [2025-03-04 02:12:17,251 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.28055555555555556 [2025-03-04 02:12:17,252 INFO L175 Difference]: Start difference. First operand has 68 places, 61 transitions, 370 flow. Second operand 12 states and 202 transitions. [2025-03-04 02:12:17,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 121 transitions, 1017 flow [2025-03-04 02:12:17,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 121 transitions, 995 flow, removed 8 selfloop flow, removed 2 redundant places. [2025-03-04 02:12:17,261 INFO L231 Difference]: Finished difference. Result has 76 places, 65 transitions, 465 flow [2025-03-04 02:12:17,262 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=465, PETRI_PLACES=76, PETRI_TRANSITIONS=65} [2025-03-04 02:12:17,263 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 23 predicate places. [2025-03-04 02:12:17,264 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 65 transitions, 465 flow [2025-03-04 02:12:17,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 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-04 02:12:17,264 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:12:17,264 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:12:17,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 02:12:17,264 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-04 02:12:17,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:12:17,265 INFO L85 PathProgramCache]: Analyzing trace with hash -789106627, now seen corresponding path program 1 times [2025-03-04 02:12:17,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:12:17,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543936336] [2025-03-04 02:12:17,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:12:17,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:12:17,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 02:12:17,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:12:17,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:12:17,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:12:17,935 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-04 02:12:17,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:12:17,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543936336] [2025-03-04 02:12:17,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543936336] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:12:17,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:12:17,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 02:12:17,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261982614] [2025-03-04 02:12:17,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:12:17,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:12:17,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:12:17,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:12:17,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:12:17,966 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-03-04 02:12:17,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 65 transitions, 465 flow. Second operand has 10 states, 10 states have (on average 13.0) internal successors, (130), 10 states have internal predecessors, (130), 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-04 02:12:17,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:12:17,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-03-04 02:12:17,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:12:18,433 INFO L124 PetriNetUnfolderBase]: 437/842 cut-off events. [2025-03-04 02:12:18,433 INFO L125 PetriNetUnfolderBase]: For 2799/2799 co-relation queries the response was YES. [2025-03-04 02:12:18,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3376 conditions, 842 events. 437/842 cut-off events. For 2799/2799 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3921 event pairs, 82 based on Foata normal form. 1/843 useless extension candidates. Maximal degree in co-relation 2470. Up to 368 conditions per place. [2025-03-04 02:12:18,438 INFO L140 encePairwiseOnDemand]: 49/60 looper letters, 72 selfloop transitions, 32 changer transitions 27/132 dead transitions. [2025-03-04 02:12:18,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 132 transitions, 1200 flow [2025-03-04 02:12:18,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 02:12:18,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 02:12:18,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 232 transitions. [2025-03-04 02:12:18,440 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2761904761904762 [2025-03-04 02:12:18,440 INFO L175 Difference]: Start difference. First operand has 76 places, 65 transitions, 465 flow. Second operand 14 states and 232 transitions. [2025-03-04 02:12:18,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 132 transitions, 1200 flow [2025-03-04 02:12:18,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 132 transitions, 1148 flow, removed 11 selfloop flow, removed 7 redundant places. [2025-03-04 02:12:18,447 INFO L231 Difference]: Finished difference. Result has 88 places, 78 transitions, 685 flow [2025-03-04 02:12:18,447 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=431, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=685, PETRI_PLACES=88, PETRI_TRANSITIONS=78} [2025-03-04 02:12:18,448 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 35 predicate places. [2025-03-04 02:12:18,448 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 78 transitions, 685 flow [2025-03-04 02:12:18,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.0) internal successors, (130), 10 states have internal predecessors, (130), 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-04 02:12:18,448 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:12:18,448 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:12:18,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 02:12:18,449 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-04 02:12:18,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:12:18,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1566873167, now seen corresponding path program 2 times [2025-03-04 02:12:18,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:12:18,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204903422] [2025-03-04 02:12:18,449 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:12:18,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:12:18,464 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 1 equivalence classes. [2025-03-04 02:12:18,476 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:12:18,476 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:12:18,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:12:19,036 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-04 02:12:19,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:12:19,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204903422] [2025-03-04 02:12:19,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204903422] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:12:19,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:12:19,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 02:12:19,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964339634] [2025-03-04 02:12:19,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:12:19,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:12:19,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:12:19,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:12:19,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:12:19,054 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-03-04 02:12:19,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 78 transitions, 685 flow. Second operand has 11 states, 11 states have (on average 12.727272727272727) internal successors, (140), 11 states have internal predecessors, (140), 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-04 02:12:19,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:12:19,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-03-04 02:12:19,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:12:19,442 INFO L124 PetriNetUnfolderBase]: 377/746 cut-off events. [2025-03-04 02:12:19,442 INFO L125 PetriNetUnfolderBase]: For 2801/2801 co-relation queries the response was YES. [2025-03-04 02:12:19,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3126 conditions, 746 events. 377/746 cut-off events. For 2801/2801 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3382 event pairs, 66 based on Foata normal form. 1/747 useless extension candidates. Maximal degree in co-relation 3094. Up to 410 conditions per place. [2025-03-04 02:12:19,447 INFO L140 encePairwiseOnDemand]: 49/60 looper letters, 68 selfloop transitions, 28 changer transitions 32/129 dead transitions. [2025-03-04 02:12:19,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 129 transitions, 1242 flow [2025-03-04 02:12:19,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 02:12:19,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 02:12:19,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 217 transitions. [2025-03-04 02:12:19,449 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2782051282051282 [2025-03-04 02:12:19,449 INFO L175 Difference]: Start difference. First operand has 88 places, 78 transitions, 685 flow. Second operand 13 states and 217 transitions. [2025-03-04 02:12:19,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 129 transitions, 1242 flow [2025-03-04 02:12:19,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 129 transitions, 1135 flow, removed 15 selfloop flow, removed 10 redundant places. [2025-03-04 02:12:19,456 INFO L231 Difference]: Finished difference. Result has 91 places, 75 transitions, 637 flow [2025-03-04 02:12:19,457 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=637, PETRI_PLACES=91, PETRI_TRANSITIONS=75} [2025-03-04 02:12:19,457 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 38 predicate places. [2025-03-04 02:12:19,457 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 75 transitions, 637 flow [2025-03-04 02:12:19,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.727272727272727) internal successors, (140), 11 states have internal predecessors, (140), 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-04 02:12:19,458 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:12:19,458 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:12:19,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 02:12:19,458 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-04 02:12:19,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:12:19,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1176814957, now seen corresponding path program 3 times [2025-03-04 02:12:19,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:12:19,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936733581] [2025-03-04 02:12:19,458 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:12:19,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:12:19,474 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 1 equivalence classes. [2025-03-04 02:12:19,507 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:12:19,507 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 02:12:19,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:12:19,997 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-04 02:12:19,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:12:19,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936733581] [2025-03-04 02:12:19,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936733581] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:12:19,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:12:19,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 02:12:19,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383329338] [2025-03-04 02:12:19,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:12:19,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:12:19,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:12:19,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:12:19,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:12:20,036 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-03-04 02:12:20,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 75 transitions, 637 flow. Second operand has 10 states, 10 states have (on average 13.0) internal successors, (130), 10 states have internal predecessors, (130), 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-04 02:12:20,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:12:20,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-03-04 02:12:20,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:12:20,405 INFO L124 PetriNetUnfolderBase]: 295/584 cut-off events. [2025-03-04 02:12:20,406 INFO L125 PetriNetUnfolderBase]: For 2040/2040 co-relation queries the response was YES. [2025-03-04 02:12:20,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2413 conditions, 584 events. 295/584 cut-off events. For 2040/2040 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2415 event pairs, 58 based on Foata normal form. 1/585 useless extension candidates. Maximal degree in co-relation 2387. Up to 301 conditions per place. [2025-03-04 02:12:20,410 INFO L140 encePairwiseOnDemand]: 49/60 looper letters, 58 selfloop transitions, 26 changer transitions 27/112 dead transitions. [2025-03-04 02:12:20,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 112 transitions, 1053 flow [2025-03-04 02:12:20,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 02:12:20,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 02:12:20,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 228 transitions. [2025-03-04 02:12:20,412 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2714285714285714 [2025-03-04 02:12:20,412 INFO L175 Difference]: Start difference. First operand has 91 places, 75 transitions, 637 flow. Second operand 14 states and 228 transitions. [2025-03-04 02:12:20,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 112 transitions, 1053 flow [2025-03-04 02:12:20,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 112 transitions, 994 flow, removed 1 selfloop flow, removed 10 redundant places. [2025-03-04 02:12:20,417 INFO L231 Difference]: Finished difference. Result has 93 places, 67 transitions, 579 flow [2025-03-04 02:12:20,417 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=580, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=579, PETRI_PLACES=93, PETRI_TRANSITIONS=67} [2025-03-04 02:12:20,417 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 40 predicate places. [2025-03-04 02:12:20,417 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 67 transitions, 579 flow [2025-03-04 02:12:20,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.0) internal successors, (130), 10 states have internal predecessors, (130), 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-04 02:12:20,418 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:12:20,419 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:12:20,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 02:12:20,419 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-04 02:12:20,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:12:20,420 INFO L85 PathProgramCache]: Analyzing trace with hash 339144083, now seen corresponding path program 4 times [2025-03-04 02:12:20,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:12:20,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148552761] [2025-03-04 02:12:20,420 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:12:20,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:12:20,435 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-03-04 02:12:20,449 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:12:20,450 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:12:20,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:12:20,925 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-04 02:12:20,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:12:20,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148552761] [2025-03-04 02:12:20,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148552761] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:12:20,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:12:20,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 02:12:20,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295462480] [2025-03-04 02:12:20,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:12:20,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:12:20,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:12:20,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:12:20,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:12:20,951 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-03-04 02:12:20,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 67 transitions, 579 flow. Second operand has 11 states, 11 states have (on average 12.727272727272727) internal successors, (140), 11 states have internal predecessors, (140), 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-04 02:12:20,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:12:20,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-03-04 02:12:20,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:12:21,346 INFO L124 PetriNetUnfolderBase]: 228/449 cut-off events. [2025-03-04 02:12:21,346 INFO L125 PetriNetUnfolderBase]: For 1694/1694 co-relation queries the response was YES. [2025-03-04 02:12:21,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1920 conditions, 449 events. 228/449 cut-off events. For 1694/1694 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1677 event pairs, 34 based on Foata normal form. 1/450 useless extension candidates. Maximal degree in co-relation 1899. Up to 237 conditions per place. [2025-03-04 02:12:21,350 INFO L140 encePairwiseOnDemand]: 49/60 looper letters, 45 selfloop transitions, 16 changer transitions 36/98 dead transitions. [2025-03-04 02:12:21,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 98 transitions, 920 flow [2025-03-04 02:12:21,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 02:12:21,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 02:12:21,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 220 transitions. [2025-03-04 02:12:21,352 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2619047619047619 [2025-03-04 02:12:21,352 INFO L175 Difference]: Start difference. First operand has 93 places, 67 transitions, 579 flow. Second operand 14 states and 220 transitions. [2025-03-04 02:12:21,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 98 transitions, 920 flow [2025-03-04 02:12:21,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 98 transitions, 804 flow, removed 3 selfloop flow, removed 15 redundant places. [2025-03-04 02:12:21,358 INFO L231 Difference]: Finished difference. Result has 87 places, 53 transitions, 371 flow [2025-03-04 02:12:21,359 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=371, PETRI_PLACES=87, PETRI_TRANSITIONS=53} [2025-03-04 02:12:21,359 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 34 predicate places. [2025-03-04 02:12:21,359 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 53 transitions, 371 flow [2025-03-04 02:12:21,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.727272727272727) internal successors, (140), 11 states have internal predecessors, (140), 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-04 02:12:21,360 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:12:21,360 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:12:21,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 02:12:21,361 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-04 02:12:21,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:12:21,362 INFO L85 PathProgramCache]: Analyzing trace with hash 562723705, now seen corresponding path program 5 times [2025-03-04 02:12:21,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:12:21,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748797651] [2025-03-04 02:12:21,362 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:12:21,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:12:21,378 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-04 02:12:21,384 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 31 statements. [2025-03-04 02:12:21,385 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:12:21,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:12:21,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:12:21,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:12:21,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748797651] [2025-03-04 02:12:21,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748797651] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:12:21,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:12:21,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:12:21,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045236121] [2025-03-04 02:12:21,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:12:21,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:12:21,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:12:21,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:12:21,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:12:21,488 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 60 [2025-03-04 02:12:21,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 53 transitions, 371 flow. Second operand has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 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-04 02:12:21,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:12:21,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 60 [2025-03-04 02:12:21,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:12:21,603 INFO L124 PetriNetUnfolderBase]: 97/204 cut-off events. [2025-03-04 02:12:21,604 INFO L125 PetriNetUnfolderBase]: For 769/769 co-relation queries the response was YES. [2025-03-04 02:12:21,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 834 conditions, 204 events. 97/204 cut-off events. For 769/769 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 589 event pairs, 21 based on Foata normal form. 12/216 useless extension candidates. Maximal degree in co-relation 816. Up to 96 conditions per place. [2025-03-04 02:12:21,606 INFO L140 encePairwiseOnDemand]: 54/60 looper letters, 45 selfloop transitions, 14 changer transitions 0/64 dead transitions. [2025-03-04 02:12:21,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 64 transitions, 533 flow [2025-03-04 02:12:21,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:12:21,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:12:21,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 154 transitions. [2025-03-04 02:12:21,607 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5133333333333333 [2025-03-04 02:12:21,607 INFO L175 Difference]: Start difference. First operand has 87 places, 53 transitions, 371 flow. Second operand 5 states and 154 transitions. [2025-03-04 02:12:21,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 64 transitions, 533 flow [2025-03-04 02:12:21,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 64 transitions, 421 flow, removed 16 selfloop flow, removed 18 redundant places. [2025-03-04 02:12:21,610 INFO L231 Difference]: Finished difference. Result has 65 places, 51 transitions, 311 flow [2025-03-04 02:12:21,610 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=311, PETRI_PLACES=65, PETRI_TRANSITIONS=51} [2025-03-04 02:12:21,610 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 12 predicate places. [2025-03-04 02:12:21,610 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 51 transitions, 311 flow [2025-03-04 02:12:21,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 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-04 02:12:21,610 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:12:21,610 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:12:21,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 02:12:21,611 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-04 02:12:21,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:12:21,611 INFO L85 PathProgramCache]: Analyzing trace with hash 88366521, now seen corresponding path program 6 times [2025-03-04 02:12:21,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:12:21,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472368012] [2025-03-04 02:12:21,611 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:12:21,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:12:21,625 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 2 equivalence classes. [2025-03-04 02:12:21,633 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:12:21,633 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 02:12:21,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:12:22,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:12:22,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:12:22,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472368012] [2025-03-04 02:12:22,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472368012] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:12:22,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735564023] [2025-03-04 02:12:22,082 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:12:22,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:12:22,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:12:22,084 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:12:22,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 02:12:22,200 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 2 equivalence classes. [2025-03-04 02:12:22,235 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:12:22,235 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 02:12:22,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:12:22,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-04 02:12:22,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:12:22,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2025-03-04 02:12:22,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 11 [2025-03-04 02:12:22,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 11 [2025-03-04 02:12:22,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:12:22,496 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:12:22,880 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:12:22,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1735564023] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:12:22,880 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:12:22,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 17 [2025-03-04 02:12:22,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344282673] [2025-03-04 02:12:22,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:12:22,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 02:12:22,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:12:22,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 02:12:22,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2025-03-04 02:12:22,933 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-03-04 02:12:22,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 51 transitions, 311 flow. Second operand has 17 states, 17 states have (on average 13.647058823529411) internal successors, (232), 17 states have internal predecessors, (232), 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-04 02:12:22,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:12:22,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-03-04 02:12:22,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:12:23,436 INFO L124 PetriNetUnfolderBase]: 144/303 cut-off events. [2025-03-04 02:12:23,436 INFO L125 PetriNetUnfolderBase]: For 805/805 co-relation queries the response was YES. [2025-03-04 02:12:23,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1039 conditions, 303 events. 144/303 cut-off events. For 805/805 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 994 event pairs, 24 based on Foata normal form. 1/304 useless extension candidates. Maximal degree in co-relation 736. Up to 134 conditions per place. [2025-03-04 02:12:23,437 INFO L140 encePairwiseOnDemand]: 49/60 looper letters, 35 selfloop transitions, 11 changer transitions 34/81 dead transitions. [2025-03-04 02:12:23,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 81 transitions, 595 flow [2025-03-04 02:12:23,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 02:12:23,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 02:12:23,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 220 transitions. [2025-03-04 02:12:23,439 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.24444444444444444 [2025-03-04 02:12:23,439 INFO L175 Difference]: Start difference. First operand has 65 places, 51 transitions, 311 flow. Second operand 15 states and 220 transitions. [2025-03-04 02:12:23,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 81 transitions, 595 flow [2025-03-04 02:12:23,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 81 transitions, 554 flow, removed 8 selfloop flow, removed 5 redundant places. [2025-03-04 02:12:23,441 INFO L231 Difference]: Finished difference. Result has 76 places, 42 transitions, 229 flow [2025-03-04 02:12:23,442 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=229, PETRI_PLACES=76, PETRI_TRANSITIONS=42} [2025-03-04 02:12:23,442 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 23 predicate places. [2025-03-04 02:12:23,442 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 42 transitions, 229 flow [2025-03-04 02:12:23,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 13.647058823529411) internal successors, (232), 17 states have internal predecessors, (232), 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-04 02:12:23,442 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:12:23,442 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:12:23,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 02:12:23,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 02:12:23,643 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-04 02:12:23,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:12:23,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1516499833, now seen corresponding path program 7 times [2025-03-04 02:12:23,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:12:23,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895565965] [2025-03-04 02:12:23,644 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:12:23,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:12:23,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 02:12:23,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:12:23,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:12:23,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:12:24,221 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:12:24,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:12:24,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895565965] [2025-03-04 02:12:24,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895565965] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:12:24,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438425783] [2025-03-04 02:12:24,222 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:12:24,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:12:24,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:12:24,224 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:12:24,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 02:12:24,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 02:12:24,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:12:24,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:12:24,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:12:24,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-04 02:12:24,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:12:24,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2025-03-04 02:12:24,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 11 [2025-03-04 02:12:24,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 11 [2025-03-04 02:12:24,564 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:12:24,564 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:12:24,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:12:24,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438425783] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:12:24,866 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:12:24,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 18 [2025-03-04 02:12:24,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314201841] [2025-03-04 02:12:24,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:12:24,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 02:12:24,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:12:24,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 02:12:24,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2025-03-04 02:12:24,918 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-03-04 02:12:24,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 42 transitions, 229 flow. Second operand has 18 states, 18 states have (on average 13.555555555555555) internal successors, (244), 18 states have internal predecessors, (244), 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-04 02:12:24,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:12:24,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-03-04 02:12:24,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:12:25,342 INFO L124 PetriNetUnfolderBase]: 74/159 cut-off events. [2025-03-04 02:12:25,343 INFO L125 PetriNetUnfolderBase]: For 270/270 co-relation queries the response was YES. [2025-03-04 02:12:25,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 550 conditions, 159 events. 74/159 cut-off events. For 270/270 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 365 event pairs, 0 based on Foata normal form. 1/160 useless extension candidates. Maximal degree in co-relation 537. Up to 62 conditions per place. [2025-03-04 02:12:25,343 INFO L140 encePairwiseOnDemand]: 49/60 looper letters, 0 selfloop transitions, 0 changer transitions 51/51 dead transitions. [2025-03-04 02:12:25,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 51 transitions, 353 flow [2025-03-04 02:12:25,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 02:12:25,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 02:12:25,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 178 transitions. [2025-03-04 02:12:25,345 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2282051282051282 [2025-03-04 02:12:25,345 INFO L175 Difference]: Start difference. First operand has 76 places, 42 transitions, 229 flow. Second operand 13 states and 178 transitions. [2025-03-04 02:12:25,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 51 transitions, 353 flow [2025-03-04 02:12:25,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 51 transitions, 303 flow, removed 7 selfloop flow, removed 13 redundant places. [2025-03-04 02:12:25,346 INFO L231 Difference]: Finished difference. Result has 65 places, 0 transitions, 0 flow [2025-03-04 02:12:25,347 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=0, PETRI_PLACES=65, PETRI_TRANSITIONS=0} [2025-03-04 02:12:25,348 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 12 predicate places. [2025-03-04 02:12:25,348 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 0 transitions, 0 flow [2025-03-04 02:12:25,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 13.555555555555555) internal successors, (244), 18 states have internal predecessors, (244), 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-04 02:12:25,351 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2025-03-04 02:12:25,355 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2025-03-04 02:12:25,355 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2025-03-04 02:12:25,355 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2025-03-04 02:12:25,355 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2025-03-04 02:12:25,355 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2025-03-04 02:12:25,355 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2025-03-04 02:12:25,355 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 8 remaining) [2025-03-04 02:12:25,366 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 02:12:25,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 02:12:25,556 INFO L422 BasicCegarLoop]: Path program histogram: [7, 5, 1, 1, 1, 1] [2025-03-04 02:12:25,558 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 02:12:25,558 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 02:12:25,562 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 02:12:25 BasicIcfg [2025-03-04 02:12:25,562 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 02:12:25,562 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 02:12:25,562 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 02:12:25,562 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 02:12:25,563 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:12:11" (3/4) ... [2025-03-04 02:12:25,564 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 02:12:25,566 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure my_callback [2025-03-04 02:12:25,573 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 85 nodes and edges [2025-03-04 02:12:25,574 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 30 nodes and edges [2025-03-04 02:12:25,574 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-03-04 02:12:25,574 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-04 02:12:25,634 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 02:12:25,635 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 02:12:25,635 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 02:12:25,636 INFO L158 Benchmark]: Toolchain (without parser) took 14889.74ms. Allocated memory was 167.8MB in the beginning and 587.2MB in the end (delta: 419.4MB). Free memory was 120.7MB in the beginning and 364.0MB in the end (delta: -243.3MB). Peak memory consumption was 176.6MB. Max. memory is 16.1GB. [2025-03-04 02:12:25,636 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 116.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 02:12:25,636 INFO L158 Benchmark]: CACSL2BoogieTranslator took 473.04ms. Allocated memory is still 167.8MB. Free memory was 120.7MB in the beginning and 90.1MB in the end (delta: 30.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-04 02:12:25,637 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.45ms. Allocated memory is still 167.8MB. Free memory was 90.1MB in the beginning and 87.2MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 02:12:25,637 INFO L158 Benchmark]: Boogie Preprocessor took 63.83ms. Allocated memory is still 167.8MB. Free memory was 87.2MB in the beginning and 83.9MB in the end (delta: 3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 02:12:25,637 INFO L158 Benchmark]: IcfgBuilder took 606.06ms. Allocated memory is still 167.8MB. Free memory was 83.9MB in the beginning and 46.1MB in the end (delta: 37.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-04 02:12:25,638 INFO L158 Benchmark]: TraceAbstraction took 13633.06ms. Allocated memory was 167.8MB in the beginning and 587.2MB in the end (delta: 419.4MB). Free memory was 45.4MB in the beginning and 368.3MB in the end (delta: -322.9MB). Peak memory consumption was 101.1MB. Max. memory is 16.1GB. [2025-03-04 02:12:25,638 INFO L158 Benchmark]: Witness Printer took 72.44ms. Allocated memory is still 587.2MB. Free memory was 368.3MB in the beginning and 364.0MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 02:12:25,640 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.23ms. Allocated memory is still 201.3MB. Free memory is still 116.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 473.04ms. Allocated memory is still 167.8MB. Free memory was 120.7MB in the beginning and 90.1MB in the end (delta: 30.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.45ms. Allocated memory is still 167.8MB. Free memory was 90.1MB in the beginning and 87.2MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 63.83ms. Allocated memory is still 167.8MB. Free memory was 87.2MB in the beginning and 83.9MB in the end (delta: 3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 606.06ms. Allocated memory is still 167.8MB. Free memory was 83.9MB in the beginning and 46.1MB in the end (delta: 37.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 13633.06ms. Allocated memory was 167.8MB in the beginning and 587.2MB in the end (delta: 419.4MB). Free memory was 45.4MB in the beginning and 368.3MB in the end (delta: -322.9MB). Peak memory consumption was 101.1MB. Max. memory is 16.1GB. * Witness Printer took 72.44ms. Allocated memory is still 587.2MB. Free memory was 368.3MB in the beginning and 364.0MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3885]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 3885]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 3885]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 3885]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 3885]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 3885]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 4 procedures, 60 locations, 8 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: 13.5s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1104 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1019 mSDsluCounter, 884 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 824 mSDsCounter, 165 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4187 IncrementalHoareTripleChecker+Invalid, 4352 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 165 mSolverCounterUnsat, 60 mSDtfsCounter, 4187 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 303 GetRequests, 143 SyntacticMatches, 5 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=685occurred in iteration=10, InterpolantAutomatonStates: 143, 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.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 469 NumberOfCodeBlocks, 460 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 511 ConstructedInterpolants, 36 QuantifiedInterpolants, 6268 SizeOfPredicates, 31 NumberOfNonLiveVariables, 632 ConjunctsInSsa, 81 ConjunctsInUnsatCore, 20 InterpolantComputations, 14 PerfectInterpolantSequences, 1/7 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 02:12:25,655 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 Result: TRUE