./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_77-tricky_address4_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows 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/goblint-regression/28-race_reach_77-tricky_address4_racing.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-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 ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dce9d71ca8bbe247a74e6b2653e5cdb882c6b8b5d902edf534df70d90ee806fe --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:22:48,873 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:22:48,934 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:22:48,940 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:22:48,940 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:22:48,962 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:22:48,963 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:22:48,963 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:22:48,963 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:22:48,963 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:22:48,963 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:22:48,963 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:22:48,964 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:22:48,965 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:22:48,965 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:22:48,965 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:22:48,966 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:22:48,966 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:22:48,966 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:22:48,966 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:22:48,966 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:22:48,966 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:22:48,966 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:22:48,966 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:22:48,966 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:22:48,967 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:22:48,967 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:22:48,967 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:22:48,967 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:22:48,967 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:22:48,967 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:22:48,967 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:22:48,968 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:22:48,968 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:22:48,968 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:22:48,968 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:22:48,968 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:22:48,968 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:22:48,968 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:22:48,968 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:22:48,968 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:22:48,968 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:22:48,968 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:22:48,968 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:22:48,968 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:22:48,969 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 ! overflow) ) 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 -> dce9d71ca8bbe247a74e6b2653e5cdb882c6b8b5d902edf534df70d90ee806fe [2025-03-04 15:22:49,199 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:22:49,207 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:22:49,210 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:22:49,211 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:22:49,211 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:22:49,214 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_77-tricky_address4_racing.i [2025-03-04 15:22:50,399 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b0ec5616/91cc366d82ac4fd2861795f0826cc145/FLAGef0ecf39d [2025-03-04 15:22:50,725 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:22:50,726 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_77-tricky_address4_racing.i [2025-03-04 15:22:50,743 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b0ec5616/91cc366d82ac4fd2861795f0826cc145/FLAGef0ecf39d [2025-03-04 15:22:50,763 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b0ec5616/91cc366d82ac4fd2861795f0826cc145 [2025-03-04 15:22:50,765 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:22:50,767 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:22:50,769 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:22:50,769 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:22:50,773 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:22:50,773 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:22:50" (1/1) ... [2025-03-04 15:22:50,774 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b75528f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:50, skipping insertion in model container [2025-03-04 15:22:50,774 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:22:50" (1/1) ... [2025-03-04 15:22:50,808 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:22:51,084 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:22:51,111 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:22:51,172 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:22:51,220 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:22:51,220 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:51 WrapperNode [2025-03-04 15:22:51,221 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:22:51,222 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:22:51,223 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:22:51,223 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:22:51,229 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:51" (1/1) ... [2025-03-04 15:22:51,245 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:51" (1/1) ... [2025-03-04 15:22:51,277 INFO L138 Inliner]: procedures = 271, calls = 110, calls flagged for inlining = 7, calls inlined = 8, statements flattened = 276 [2025-03-04 15:22:51,278 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:22:51,279 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:22:51,279 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:22:51,280 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:22:51,286 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:51" (1/1) ... [2025-03-04 15:22:51,286 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:51" (1/1) ... [2025-03-04 15:22:51,291 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:51" (1/1) ... [2025-03-04 15:22:51,314 INFO L175 MemorySlicer]: Split 79 memory accesses to 4 slices as follows [2, 5, 70, 2]. 89 percent of accesses are in the largest equivalence class. The 67 initializations are split as follows [2, 5, 60, 0]. The 5 writes are split as follows [0, 0, 4, 1]. [2025-03-04 15:22:51,314 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:51" (1/1) ... [2025-03-04 15:22:51,314 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:51" (1/1) ... [2025-03-04 15:22:51,321 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:51" (1/1) ... [2025-03-04 15:22:51,322 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:51" (1/1) ... [2025-03-04 15:22:51,330 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:51" (1/1) ... [2025-03-04 15:22:51,331 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:51" (1/1) ... [2025-03-04 15:22:51,336 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:22:51,337 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:22:51,337 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:22:51,337 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:22:51,338 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:51" (1/1) ... [2025-03-04 15:22:51,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:22:51,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:22:51,366 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 15:22:51,368 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 15:22:51,384 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 15:22:51,385 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 15:22:51,385 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 15:22:51,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:22:51,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:22:51,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 15:22:51,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 15:22:51,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:22:51,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:22:51,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 15:22:51,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 15:22:51,386 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 15:22:51,386 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:22:51,386 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-04 15:22:51,386 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-04 15:22:51,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:22:51,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 15:22:51,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 15:22:51,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 15:22:51,386 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:22:51,386 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:22:51,387 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 15:22:51,494 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:22:51,496 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:22:51,743 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L954: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-03-04 15:22:51,744 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L954-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-03-04 15:22:51,823 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:22:51,823 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:22:52,136 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:22:52,136 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:22:52,136 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:22:52 BoogieIcfgContainer [2025-03-04 15:22:52,136 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:22:52,138 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:22:52,138 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:22:52,141 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:22:52,142 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:22:50" (1/3) ... [2025-03-04 15:22:52,142 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2510f884 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:22:52, skipping insertion in model container [2025-03-04 15:22:52,142 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:51" (2/3) ... [2025-03-04 15:22:52,142 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2510f884 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:22:52, skipping insertion in model container [2025-03-04 15:22:52,142 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:22:52" (3/3) ... [2025-03-04 15:22:52,143 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_77-tricky_address4_racing.i [2025-03-04 15:22:52,155 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:22:52,158 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_77-tricky_address4_racing.i that has 2 procedures, 89 locations, 1 initial locations, 11 loop locations, and 16 error locations. [2025-03-04 15:22:52,158 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:22:52,200 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-04 15:22:52,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 113 transitions, 233 flow [2025-03-04 15:22:52,299 INFO L124 PetriNetUnfolderBase]: 35/159 cut-off events. [2025-03-04 15:22:52,302 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 15:22:52,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164 conditions, 159 events. 35/159 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 633 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 98. Up to 8 conditions per place. [2025-03-04 15:22:52,306 INFO L82 GeneralOperation]: Start removeDead. Operand has 92 places, 113 transitions, 233 flow [2025-03-04 15:22:52,310 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 92 places, 112 transitions, 231 flow [2025-03-04 15:22:52,315 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:22:52,323 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;@3cc10eed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:22:52,324 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-03-04 15:22:52,329 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:22:52,329 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-03-04 15:22:52,329 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:22:52,329 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:52,329 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 15:22:52,330 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-04 15:22:52,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:52,333 INFO L85 PathProgramCache]: Analyzing trace with hash 667551, now seen corresponding path program 1 times [2025-03-04 15:22:52,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:52,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263173831] [2025-03-04 15:22:52,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:52,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:52,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:22:52,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:22:52,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:52,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:52,607 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 15:22:52,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:52,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263173831] [2025-03-04 15:22:52,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263173831] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:22:52,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:22:52,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:22:52,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691963176] [2025-03-04 15:22:52,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:22:52,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:22:52,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:52,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:22:52,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:22:52,649 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 113 [2025-03-04 15:22:52,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 112 transitions, 231 flow. Second operand has 4 states, 4 states have (on average 42.75) internal successors, (171), 4 states have internal predecessors, (171), 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 15:22:52,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:52,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 113 [2025-03-04 15:22:52,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:52,952 INFO L124 PetriNetUnfolderBase]: 486/1471 cut-off events. [2025-03-04 15:22:52,953 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 15:22:52,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2451 conditions, 1471 events. 486/1471 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 9830 event pairs, 440 based on Foata normal form. 230/1515 useless extension candidates. Maximal degree in co-relation 2361. Up to 973 conditions per place. [2025-03-04 15:22:52,964 INFO L140 encePairwiseOnDemand]: 87/113 looper letters, 49 selfloop transitions, 3 changer transitions 0/94 dead transitions. [2025-03-04 15:22:52,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 94 transitions, 299 flow [2025-03-04 15:22:52,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:22:52,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:22:53,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 243 transitions. [2025-03-04 15:22:53,004 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5376106194690266 [2025-03-04 15:22:53,005 INFO L175 Difference]: Start difference. First operand has 92 places, 112 transitions, 231 flow. Second operand 4 states and 243 transitions. [2025-03-04 15:22:53,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 94 transitions, 299 flow [2025-03-04 15:22:53,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 94 transitions, 299 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:22:53,012 INFO L231 Difference]: Finished difference. Result has 97 places, 94 transitions, 215 flow [2025-03-04 15:22:53,013 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=215, PETRI_PLACES=97, PETRI_TRANSITIONS=94} [2025-03-04 15:22:53,016 INFO L279 CegarLoopForPetriNet]: 92 programPoint places, 5 predicate places. [2025-03-04 15:22:53,016 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 94 transitions, 215 flow [2025-03-04 15:22:53,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.75) internal successors, (171), 4 states have internal predecessors, (171), 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 15:22:53,016 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:53,016 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-04 15:22:53,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:22:53,017 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-04 15:22:53,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:53,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1587260876, now seen corresponding path program 1 times [2025-03-04 15:22:53,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:53,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274033943] [2025-03-04 15:22:53,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:53,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:53,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:22:53,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:22:53,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:53,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:53,112 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:53,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:53,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274033943] [2025-03-04 15:22:53,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274033943] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:22:53,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737373300] [2025-03-04 15:22:53,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:53,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:22:53,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:22:53,115 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 15:22:53,117 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 15:22:53,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:22:53,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:22:53,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:53,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:53,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:22:53,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:22:53,221 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:53,222 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:22:53,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [737373300] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:22:53,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:22:53,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-04 15:22:53,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508342942] [2025-03-04 15:22:53,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:22:53,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:22:53,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:53,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:22:53,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:22:53,230 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 113 [2025-03-04 15:22:53,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 94 transitions, 215 flow. Second operand has 6 states, 6 states have (on average 42.833333333333336) internal successors, (257), 6 states have internal predecessors, (257), 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 15:22:53,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:53,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 113 [2025-03-04 15:22:53,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:53,494 INFO L124 PetriNetUnfolderBase]: 486/1470 cut-off events. [2025-03-04 15:22:53,494 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 15:22:53,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2461 conditions, 1470 events. 486/1470 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 9812 event pairs, 440 based on Foata normal form. 1/1285 useless extension candidates. Maximal degree in co-relation 2443. Up to 968 conditions per place. [2025-03-04 15:22:53,501 INFO L140 encePairwiseOnDemand]: 108/113 looper letters, 45 selfloop transitions, 6 changer transitions 0/93 dead transitions. [2025-03-04 15:22:53,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 93 transitions, 313 flow [2025-03-04 15:22:53,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:22:53,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:22:53,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 304 transitions. [2025-03-04 15:22:53,503 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44837758112094395 [2025-03-04 15:22:53,503 INFO L175 Difference]: Start difference. First operand has 97 places, 94 transitions, 215 flow. Second operand 6 states and 304 transitions. [2025-03-04 15:22:53,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 93 transitions, 313 flow [2025-03-04 15:22:53,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 93 transitions, 311 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:22:53,506 INFO L231 Difference]: Finished difference. Result has 100 places, 93 transitions, 221 flow [2025-03-04 15:22:53,506 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=221, PETRI_PLACES=100, PETRI_TRANSITIONS=93} [2025-03-04 15:22:53,507 INFO L279 CegarLoopForPetriNet]: 92 programPoint places, 8 predicate places. [2025-03-04 15:22:53,507 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 93 transitions, 221 flow [2025-03-04 15:22:53,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 42.833333333333336) internal successors, (257), 6 states have internal predecessors, (257), 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 15:22:53,507 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:53,507 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-03-04 15:22:53,514 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 15:22:53,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:22:53,708 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-04 15:22:53,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:53,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1960446335, now seen corresponding path program 1 times [2025-03-04 15:22:53,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:53,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165627434] [2025-03-04 15:22:53,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:53,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:53,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:22:53,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:22:53,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:53,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:53,766 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:22:53,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:53,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165627434] [2025-03-04 15:22:53,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165627434] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:22:53,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:22:53,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:22:53,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961556838] [2025-03-04 15:22:53,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:22:53,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:22:53,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:53,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:22:53,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:22:53,772 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 113 [2025-03-04 15:22:53,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 93 transitions, 221 flow. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 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 15:22:53,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:53,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 113 [2025-03-04 15:22:53,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:53,943 INFO L124 PetriNetUnfolderBase]: 486/1469 cut-off events. [2025-03-04 15:22:53,943 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-04 15:22:53,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2463 conditions, 1469 events. 486/1469 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 9837 event pairs, 440 based on Foata normal form. 1/1285 useless extension candidates. Maximal degree in co-relation 2439. Up to 971 conditions per place. [2025-03-04 15:22:53,952 INFO L140 encePairwiseOnDemand]: 110/113 looper letters, 46 selfloop transitions, 4 changer transitions 0/92 dead transitions. [2025-03-04 15:22:53,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 92 transitions, 317 flow [2025-03-04 15:22:53,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:22:53,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:22:53,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 175 transitions. [2025-03-04 15:22:53,954 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5162241887905604 [2025-03-04 15:22:53,954 INFO L175 Difference]: Start difference. First operand has 100 places, 93 transitions, 221 flow. Second operand 3 states and 175 transitions. [2025-03-04 15:22:53,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 92 transitions, 317 flow [2025-03-04 15:22:53,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 92 transitions, 295 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-03-04 15:22:53,956 INFO L231 Difference]: Finished difference. Result has 95 places, 92 transitions, 203 flow [2025-03-04 15:22:53,956 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=203, PETRI_PLACES=95, PETRI_TRANSITIONS=92} [2025-03-04 15:22:53,959 INFO L279 CegarLoopForPetriNet]: 92 programPoint places, 3 predicate places. [2025-03-04 15:22:53,959 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 92 transitions, 203 flow [2025-03-04 15:22:53,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 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 15:22:53,959 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:53,960 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:22:53,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 15:22:53,960 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-04 15:22:53,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:53,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1501877143, now seen corresponding path program 1 times [2025-03-04 15:22:53,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:53,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110928664] [2025-03-04 15:22:53,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:53,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:53,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:22:53,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:22:53,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:53,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:54,064 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 15:22:54,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:54,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110928664] [2025-03-04 15:22:54,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110928664] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:22:54,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268110628] [2025-03-04 15:22:54,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:54,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:22:54,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:22:54,066 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 15:22:54,068 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 15:22:54,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:22:54,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:22:54,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:54,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:54,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:22:54,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:22:54,157 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 15:22:54,157 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:22:54,181 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 15:22:54,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [268110628] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:22:54,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:22:54,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-04 15:22:54,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249608337] [2025-03-04 15:22:54,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:22:54,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 15:22:54,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:54,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 15:22:54,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 15:22:54,190 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 113 [2025-03-04 15:22:54,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 92 transitions, 203 flow. Second operand has 10 states, 10 states have (on average 43.3) internal successors, (433), 10 states have internal predecessors, (433), 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 15:22:54,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:54,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 113 [2025-03-04 15:22:54,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:54,421 INFO L124 PetriNetUnfolderBase]: 486/1473 cut-off events. [2025-03-04 15:22:54,421 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-04 15:22:54,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2466 conditions, 1473 events. 486/1473 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 9827 event pairs, 440 based on Foata normal form. 2/1291 useless extension candidates. Maximal degree in co-relation 2432. Up to 969 conditions per place. [2025-03-04 15:22:54,429 INFO L140 encePairwiseOnDemand]: 109/113 looper letters, 46 selfloop transitions, 7 changer transitions 0/95 dead transitions. [2025-03-04 15:22:54,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 95 transitions, 324 flow [2025-03-04 15:22:54,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:22:54,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 15:22:54,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 349 transitions. [2025-03-04 15:22:54,432 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44121365360303416 [2025-03-04 15:22:54,432 INFO L175 Difference]: Start difference. First operand has 95 places, 92 transitions, 203 flow. Second operand 7 states and 349 transitions. [2025-03-04 15:22:54,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 95 transitions, 324 flow [2025-03-04 15:22:54,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 95 transitions, 310 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:22:54,434 INFO L231 Difference]: Finished difference. Result has 101 places, 95 transitions, 229 flow [2025-03-04 15:22:54,434 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=229, PETRI_PLACES=101, PETRI_TRANSITIONS=95} [2025-03-04 15:22:54,437 INFO L279 CegarLoopForPetriNet]: 92 programPoint places, 9 predicate places. [2025-03-04 15:22:54,437 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 95 transitions, 229 flow [2025-03-04 15:22:54,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 43.3) internal successors, (433), 10 states have internal predecessors, (433), 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 15:22:54,437 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:54,437 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1] [2025-03-04 15:22:54,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 15:22:54,642 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,SelfDestructingSolverStorable3 [2025-03-04 15:22:54,644 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-04 15:22:54,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:54,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1595349129, now seen corresponding path program 2 times [2025-03-04 15:22:54,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:54,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452926694] [2025-03-04 15:22:54,645 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:22:54,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:54,655 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-04 15:22:54,660 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 15 statements. [2025-03-04 15:22:54,660 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:22:54,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:54,720 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 15:22:54,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:54,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452926694] [2025-03-04 15:22:54,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452926694] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:22:54,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:22:54,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:22:54,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534479270] [2025-03-04 15:22:54,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:22:54,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:22:54,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:54,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:22:54,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:22:54,725 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 113 [2025-03-04 15:22:54,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 95 transitions, 229 flow. Second operand has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 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 15:22:54,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:54,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 113 [2025-03-04 15:22:54,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:54,931 INFO L124 PetriNetUnfolderBase]: 483/1356 cut-off events. [2025-03-04 15:22:54,932 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-04 15:22:54,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2356 conditions, 1356 events. 483/1356 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 8966 event pairs, 0 based on Foata normal form. 21/1244 useless extension candidates. Maximal degree in co-relation 2317. Up to 912 conditions per place. [2025-03-04 15:22:54,938 INFO L140 encePairwiseOnDemand]: 107/113 looper letters, 92 selfloop transitions, 3 changer transitions 0/134 dead transitions. [2025-03-04 15:22:54,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 134 transitions, 497 flow [2025-03-04 15:22:54,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:22:54,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:22:54,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 257 transitions. [2025-03-04 15:22:54,940 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5685840707964602 [2025-03-04 15:22:54,940 INFO L175 Difference]: Start difference. First operand has 101 places, 95 transitions, 229 flow. Second operand 4 states and 257 transitions. [2025-03-04 15:22:54,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 134 transitions, 497 flow [2025-03-04 15:22:54,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 134 transitions, 493 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:22:54,943 INFO L231 Difference]: Finished difference. Result has 101 places, 93 transitions, 231 flow [2025-03-04 15:22:54,943 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=231, PETRI_PLACES=101, PETRI_TRANSITIONS=93} [2025-03-04 15:22:54,943 INFO L279 CegarLoopForPetriNet]: 92 programPoint places, 9 predicate places. [2025-03-04 15:22:54,943 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 93 transitions, 231 flow [2025-03-04 15:22:54,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 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 15:22:54,944 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:54,944 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:22:54,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:22:54,944 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-04 15:22:54,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:54,944 INFO L85 PathProgramCache]: Analyzing trace with hash 174154424, now seen corresponding path program 1 times [2025-03-04 15:22:54,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:54,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464561201] [2025-03-04 15:22:54,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:54,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:54,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:22:54,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:22:54,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:54,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:55,018 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 15:22:55,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:55,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464561201] [2025-03-04 15:22:55,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464561201] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:22:55,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:22:55,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:22:55,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691955458] [2025-03-04 15:22:55,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:22:55,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:22:55,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:55,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:22:55,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:22:55,027 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 113 [2025-03-04 15:22:55,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 93 transitions, 231 flow. Second operand has 4 states, 4 states have (on average 44.5) internal successors, (178), 4 states have internal predecessors, (178), 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 15:22:55,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:55,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 113 [2025-03-04 15:22:55,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:55,272 INFO L124 PetriNetUnfolderBase]: 506/1487 cut-off events. [2025-03-04 15:22:55,272 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2025-03-04 15:22:55,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2557 conditions, 1487 events. 506/1487 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 9895 event pairs, 378 based on Foata normal form. 23/1344 useless extension candidates. Maximal degree in co-relation 2518. Up to 875 conditions per place. [2025-03-04 15:22:55,279 INFO L140 encePairwiseOnDemand]: 109/113 looper letters, 95 selfloop transitions, 3 changer transitions 0/136 dead transitions. [2025-03-04 15:22:55,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 136 transitions, 521 flow [2025-03-04 15:22:55,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:22:55,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:22:55,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 262 transitions. [2025-03-04 15:22:55,280 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5796460176991151 [2025-03-04 15:22:55,280 INFO L175 Difference]: Start difference. First operand has 101 places, 93 transitions, 231 flow. Second operand 4 states and 262 transitions. [2025-03-04 15:22:55,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 136 transitions, 521 flow [2025-03-04 15:22:55,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 136 transitions, 511 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:22:55,283 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 229 flow [2025-03-04 15:22:55,283 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=229, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2025-03-04 15:22:55,284 INFO L279 CegarLoopForPetriNet]: 92 programPoint places, 8 predicate places. [2025-03-04 15:22:55,284 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 92 transitions, 229 flow [2025-03-04 15:22:55,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.5) internal successors, (178), 4 states have internal predecessors, (178), 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 15:22:55,284 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:55,284 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:22:55,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 15:22:55,284 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-04 15:22:55,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:55,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1062771755, now seen corresponding path program 1 times [2025-03-04 15:22:55,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:55,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069118098] [2025-03-04 15:22:55,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:55,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:55,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 15:22:55,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 15:22:55,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:55,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:55,416 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:55,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:55,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069118098] [2025-03-04 15:22:55,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069118098] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:22:55,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [458389212] [2025-03-04 15:22:55,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:55,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:22:55,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:22:55,418 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:22:55,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 15:22:55,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 15:22:55,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 15:22:55,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:55,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:55,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 15:22:55,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:22:55,531 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:55,531 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:22:55,606 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:55,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [458389212] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:22:55,607 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:22:55,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-03-04 15:22:55,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843544727] [2025-03-04 15:22:55,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:22:55,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 15:22:55,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:55,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 15:22:55,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-04 15:22:55,624 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 113 [2025-03-04 15:22:55,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 92 transitions, 229 flow. Second operand has 18 states, 18 states have (on average 43.22222222222222) internal successors, (778), 18 states have internal predecessors, (778), 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 15:22:55,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:55,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 113 [2025-03-04 15:22:55,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:55,935 INFO L124 PetriNetUnfolderBase]: 485/1452 cut-off events. [2025-03-04 15:22:55,935 INFO L125 PetriNetUnfolderBase]: For 115/115 co-relation queries the response was YES. [2025-03-04 15:22:55,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2545 conditions, 1452 events. 485/1452 cut-off events. For 115/115 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 9472 event pairs, 440 based on Foata normal form. 4/1313 useless extension candidates. Maximal degree in co-relation 2470. Up to 947 conditions per place. [2025-03-04 15:22:55,941 INFO L140 encePairwiseOnDemand]: 109/113 looper letters, 46 selfloop transitions, 15 changer transitions 0/100 dead transitions. [2025-03-04 15:22:55,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 100 transitions, 399 flow [2025-03-04 15:22:55,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 15:22:55,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 15:22:55,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 695 transitions. [2025-03-04 15:22:55,946 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41002949852507375 [2025-03-04 15:22:55,946 INFO L175 Difference]: Start difference. First operand has 100 places, 92 transitions, 229 flow. Second operand 15 states and 695 transitions. [2025-03-04 15:22:55,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 100 transitions, 399 flow [2025-03-04 15:22:55,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 100 transitions, 393 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:22:55,948 INFO L231 Difference]: Finished difference. Result has 115 places, 100 transitions, 320 flow [2025-03-04 15:22:55,948 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=320, PETRI_PLACES=115, PETRI_TRANSITIONS=100} [2025-03-04 15:22:55,949 INFO L279 CegarLoopForPetriNet]: 92 programPoint places, 23 predicate places. [2025-03-04 15:22:55,949 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 100 transitions, 320 flow [2025-03-04 15:22:55,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 43.22222222222222) internal successors, (778), 18 states have internal predecessors, (778), 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 15:22:55,952 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:55,952 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:22:55,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 15:22:56,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:22:56,152 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-04 15:22:56,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:56,153 INFO L85 PathProgramCache]: Analyzing trace with hash -212691861, now seen corresponding path program 2 times [2025-03-04 15:22:56,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:56,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410014047] [2025-03-04 15:22:56,153 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:22:56,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:56,165 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-04 15:22:56,182 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 15:22:56,182 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:22:56,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:56,411 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:56,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:56,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410014047] [2025-03-04 15:22:56,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410014047] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:22:56,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1484412131] [2025-03-04 15:22:56,413 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:22:56,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:22:56,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:22:56,414 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:22:56,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 15:22:56,467 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-04 15:22:56,496 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 15:22:56,496 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:22:56,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:56,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 15:22:56,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:22:56,554 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:56,555 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:22:56,722 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:56,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1484412131] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:22:56,722 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:22:56,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 22 [2025-03-04 15:22:56,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031564442] [2025-03-04 15:22:56,723 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:22:56,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 15:22:56,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:56,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 15:22:56,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-03-04 15:22:56,740 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 113 [2025-03-04 15:22:56,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 100 transitions, 320 flow. Second operand has 23 states, 23 states have (on average 43.21739130434783) internal successors, (994), 23 states have internal predecessors, (994), 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 15:22:56,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:56,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 113 [2025-03-04 15:22:56,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:57,029 INFO L124 PetriNetUnfolderBase]: 485/1467 cut-off events. [2025-03-04 15:22:57,029 INFO L125 PetriNetUnfolderBase]: For 141/141 co-relation queries the response was YES. [2025-03-04 15:22:57,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2543 conditions, 1467 events. 485/1467 cut-off events. For 141/141 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 9557 event pairs, 440 based on Foata normal form. 3/1326 useless extension candidates. Maximal degree in co-relation 2408. Up to 944 conditions per place. [2025-03-04 15:22:57,036 INFO L140 encePairwiseOnDemand]: 109/113 looper letters, 46 selfloop transitions, 21 changer transitions 0/106 dead transitions. [2025-03-04 15:22:57,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 106 transitions, 508 flow [2025-03-04 15:22:57,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 15:22:57,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-04 15:22:57,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 952 transitions. [2025-03-04 15:22:57,039 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40117994100294985 [2025-03-04 15:22:57,040 INFO L175 Difference]: Start difference. First operand has 115 places, 100 transitions, 320 flow. Second operand 21 states and 952 transitions. [2025-03-04 15:22:57,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 106 transitions, 508 flow [2025-03-04 15:22:57,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 106 transitions, 498 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-03-04 15:22:57,043 INFO L231 Difference]: Finished difference. Result has 134 places, 106 transitions, 421 flow [2025-03-04 15:22:57,044 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=421, PETRI_PLACES=134, PETRI_TRANSITIONS=106} [2025-03-04 15:22:57,044 INFO L279 CegarLoopForPetriNet]: 92 programPoint places, 42 predicate places. [2025-03-04 15:22:57,044 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 106 transitions, 421 flow [2025-03-04 15:22:57,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 43.21739130434783) internal successors, (994), 23 states have internal predecessors, (994), 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 15:22:57,045 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:57,045 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:22:57,052 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 15:22:57,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:22:57,250 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-04 15:22:57,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:57,251 INFO L85 PathProgramCache]: Analyzing trace with hash -776277866, now seen corresponding path program 3 times [2025-03-04 15:22:57,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:57,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112840860] [2025-03-04 15:22:57,251 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:22:57,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:57,263 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 11 equivalence classes. [2025-03-04 15:22:57,312 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 15:22:57,312 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-04 15:22:57,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:22:57,313 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:22:57,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 15:22:57,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 15:22:57,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:57,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:22:57,367 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:22:57,369 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 15:22:57,369 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 23 remaining) [2025-03-04 15:22:57,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 23 remaining) [2025-03-04 15:22:57,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 23 remaining) [2025-03-04 15:22:57,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 23 remaining) [2025-03-04 15:22:57,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 23 remaining) [2025-03-04 15:22:57,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 23 remaining) [2025-03-04 15:22:57,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 23 remaining) [2025-03-04 15:22:57,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 23 remaining) [2025-03-04 15:22:57,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 23 remaining) [2025-03-04 15:22:57,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 23 remaining) [2025-03-04 15:22:57,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 23 remaining) [2025-03-04 15:22:57,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 23 remaining) [2025-03-04 15:22:57,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 23 remaining) [2025-03-04 15:22:57,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 23 remaining) [2025-03-04 15:22:57,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 23 remaining) [2025-03-04 15:22:57,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 23 remaining) [2025-03-04 15:22:57,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 23 remaining) [2025-03-04 15:22:57,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 23 remaining) [2025-03-04 15:22:57,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 23 remaining) [2025-03-04 15:22:57,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 23 remaining) [2025-03-04 15:22:57,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 23 remaining) [2025-03-04 15:22:57,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 23 remaining) [2025-03-04 15:22:57,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 23 remaining) [2025-03-04 15:22:57,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 15:22:57,374 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1] [2025-03-04 15:22:57,375 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 15:22:57,375 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 15:22:57,405 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 15:22:57,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 162 transitions, 340 flow [2025-03-04 15:22:57,421 INFO L124 PetriNetUnfolderBase]: 59/273 cut-off events. [2025-03-04 15:22:57,421 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 15:22:57,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 285 conditions, 273 events. 59/273 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1246 event pairs, 0 based on Foata normal form. 0/174 useless extension candidates. Maximal degree in co-relation 161. Up to 12 conditions per place. [2025-03-04 15:22:57,423 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 162 transitions, 340 flow [2025-03-04 15:22:57,424 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 131 places, 162 transitions, 340 flow [2025-03-04 15:22:57,425 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:22:57,425 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;@3cc10eed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:22:57,425 INFO L334 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2025-03-04 15:22:57,427 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:22:57,427 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-03-04 15:22:57,427 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:22:57,427 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:57,427 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 15:22:57,427 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2025-03-04 15:22:57,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:57,427 INFO L85 PathProgramCache]: Analyzing trace with hash 828417, now seen corresponding path program 1 times [2025-03-04 15:22:57,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:57,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100441662] [2025-03-04 15:22:57,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:57,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:57,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:22:57,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:22:57,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:57,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:57,463 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 15:22:57,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:57,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100441662] [2025-03-04 15:22:57,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100441662] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:22:57,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:22:57,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:22:57,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603640377] [2025-03-04 15:22:57,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:22:57,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:22:57,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:57,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:22:57,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:22:57,482 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 162 [2025-03-04 15:22:57,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 162 transitions, 340 flow. Second operand has 4 states, 4 states have (on average 59.75) internal successors, (239), 4 states have internal predecessors, (239), 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 15:22:57,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:57,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 162 [2025-03-04 15:22:57,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:59,929 INFO L124 PetriNetUnfolderBase]: 20921/43350 cut-off events. [2025-03-04 15:22:59,929 INFO L125 PetriNetUnfolderBase]: For 122/122 co-relation queries the response was YES. [2025-03-04 15:22:59,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74649 conditions, 43350 events. 20921/43350 cut-off events. For 122/122 co-relation queries the response was YES. Maximal size of possible extension queue 1178. Compared 435108 event pairs, 19440 based on Foata normal form. 7691/46338 useless extension candidates. Maximal degree in co-relation 58580. Up to 31185 conditions per place. [2025-03-04 15:23:00,141 INFO L140 encePairwiseOnDemand]: 126/162 looper letters, 72 selfloop transitions, 3 changer transitions 0/134 dead transitions. [2025-03-04 15:23:00,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 134 transitions, 434 flow [2025-03-04 15:23:00,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:23:00,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:23:00,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 344 transitions. [2025-03-04 15:23:00,142 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5308641975308642 [2025-03-04 15:23:00,142 INFO L175 Difference]: Start difference. First operand has 131 places, 162 transitions, 340 flow. Second operand 4 states and 344 transitions. [2025-03-04 15:23:00,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 134 transitions, 434 flow [2025-03-04 15:23:00,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 134 transitions, 434 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:23:00,145 INFO L231 Difference]: Finished difference. Result has 136 places, 134 transitions, 304 flow [2025-03-04 15:23:00,145 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=304, PETRI_PLACES=136, PETRI_TRANSITIONS=134} [2025-03-04 15:23:00,146 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 5 predicate places. [2025-03-04 15:23:00,146 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 134 transitions, 304 flow [2025-03-04 15:23:00,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.75) internal successors, (239), 4 states have internal predecessors, (239), 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 15:23:00,146 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:00,146 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-04 15:23:00,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 15:23:00,146 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2025-03-04 15:23:00,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:00,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1089708300, now seen corresponding path program 1 times [2025-03-04 15:23:00,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:00,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811390201] [2025-03-04 15:23:00,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:00,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:00,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:23:00,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:23:00,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:00,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:00,197 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:23:00,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:00,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811390201] [2025-03-04 15:23:00,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811390201] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:23:00,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314206407] [2025-03-04 15:23:00,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:00,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:23:00,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:23:00,200 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:23:00,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 15:23:00,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:23:00,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:23:00,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:00,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:00,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:23:00,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:23:00,301 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:23:00,301 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:23:00,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1314206407] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:00,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:23:00,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-04 15:23:00,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456275484] [2025-03-04 15:23:00,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:00,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:23:00,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:00,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:23:00,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:23:00,307 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 162 [2025-03-04 15:23:00,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 134 transitions, 304 flow. Second operand has 6 states, 6 states have (on average 59.833333333333336) internal successors, (359), 6 states have internal predecessors, (359), 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 15:23:00,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:00,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 162 [2025-03-04 15:23:00,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:02,591 INFO L124 PetriNetUnfolderBase]: 20921/43349 cut-off events. [2025-03-04 15:23:02,591 INFO L125 PetriNetUnfolderBase]: For 124/124 co-relation queries the response was YES. [2025-03-04 15:23:02,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74659 conditions, 43349 events. 20921/43349 cut-off events. For 124/124 co-relation queries the response was YES. Maximal size of possible extension queue 1178. Compared 435214 event pairs, 19440 based on Foata normal form. 1/38647 useless extension candidates. Maximal degree in co-relation 74640. Up to 31180 conditions per place. [2025-03-04 15:23:02,788 INFO L140 encePairwiseOnDemand]: 157/162 looper letters, 68 selfloop transitions, 6 changer transitions 0/133 dead transitions. [2025-03-04 15:23:02,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 133 transitions, 448 flow [2025-03-04 15:23:02,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:23:02,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:23:02,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 429 transitions. [2025-03-04 15:23:02,790 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44135802469135804 [2025-03-04 15:23:02,790 INFO L175 Difference]: Start difference. First operand has 136 places, 134 transitions, 304 flow. Second operand 6 states and 429 transitions. [2025-03-04 15:23:02,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 133 transitions, 448 flow [2025-03-04 15:23:02,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 133 transitions, 446 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:23:02,792 INFO L231 Difference]: Finished difference. Result has 139 places, 133 transitions, 310 flow [2025-03-04 15:23:02,793 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=310, PETRI_PLACES=139, PETRI_TRANSITIONS=133} [2025-03-04 15:23:02,793 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 8 predicate places. [2025-03-04 15:23:02,793 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 133 transitions, 310 flow [2025-03-04 15:23:02,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 59.833333333333336) internal successors, (359), 6 states have internal predecessors, (359), 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 15:23:02,793 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:02,793 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-03-04 15:23:02,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 15:23:02,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 15:23:02,998 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2025-03-04 15:23:02,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:02,998 INFO L85 PathProgramCache]: Analyzing trace with hash 578781795, now seen corresponding path program 1 times [2025-03-04 15:23:02,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:02,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6994605] [2025-03-04 15:23:02,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:02,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:03,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:23:03,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:23:03,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:03,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:03,024 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:23:03,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:03,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6994605] [2025-03-04 15:23:03,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6994605] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:03,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:23:03,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:23:03,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398734815] [2025-03-04 15:23:03,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:03,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:23:03,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:03,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:23:03,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:23:03,028 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 162 [2025-03-04 15:23:03,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 133 transitions, 310 flow. Second operand has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 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 15:23:03,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:03,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 162 [2025-03-04 15:23:03,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:05,430 INFO L124 PetriNetUnfolderBase]: 20921/43348 cut-off events. [2025-03-04 15:23:05,430 INFO L125 PetriNetUnfolderBase]: For 129/129 co-relation queries the response was YES. [2025-03-04 15:23:05,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74661 conditions, 43348 events. 20921/43348 cut-off events. For 129/129 co-relation queries the response was YES. Maximal size of possible extension queue 1178. Compared 435122 event pairs, 19440 based on Foata normal form. 1/38647 useless extension candidates. Maximal degree in co-relation 74636. Up to 31183 conditions per place. [2025-03-04 15:23:05,628 INFO L140 encePairwiseOnDemand]: 159/162 looper letters, 69 selfloop transitions, 4 changer transitions 0/132 dead transitions. [2025-03-04 15:23:05,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 132 transitions, 452 flow [2025-03-04 15:23:05,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:23:05,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:23:05,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 249 transitions. [2025-03-04 15:23:05,629 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5123456790123457 [2025-03-04 15:23:05,629 INFO L175 Difference]: Start difference. First operand has 139 places, 133 transitions, 310 flow. Second operand 3 states and 249 transitions. [2025-03-04 15:23:05,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 132 transitions, 452 flow [2025-03-04 15:23:05,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 132 transitions, 430 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-03-04 15:23:05,632 INFO L231 Difference]: Finished difference. Result has 134 places, 132 transitions, 292 flow [2025-03-04 15:23:05,632 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=292, PETRI_PLACES=134, PETRI_TRANSITIONS=132} [2025-03-04 15:23:05,633 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 3 predicate places. [2025-03-04 15:23:05,633 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 132 transitions, 292 flow [2025-03-04 15:23:05,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 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 15:23:05,633 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:05,633 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:23:05,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 15:23:05,633 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2025-03-04 15:23:05,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:05,634 INFO L85 PathProgramCache]: Analyzing trace with hash -2136231000, now seen corresponding path program 1 times [2025-03-04 15:23:05,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:05,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711913595] [2025-03-04 15:23:05,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:05,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:05,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:23:05,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:23:05,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:05,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:05,684 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 15:23:05,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:05,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711913595] [2025-03-04 15:23:05,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711913595] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:23:05,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339355083] [2025-03-04 15:23:05,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:05,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:23:05,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:23:05,686 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:23:05,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 15:23:05,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:23:05,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:23:05,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:05,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:05,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:23:05,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:23:05,778 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 15:23:05,779 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:23:05,800 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 15:23:05,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339355083] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:23:05,800 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:23:05,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-04 15:23:05,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498669254] [2025-03-04 15:23:05,800 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:23:05,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 15:23:05,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:05,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 15:23:05,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 15:23:05,812 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 162 [2025-03-04 15:23:05,813 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 132 transitions, 292 flow. Second operand has 10 states, 10 states have (on average 60.3) internal successors, (603), 10 states have internal predecessors, (603), 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 15:23:05,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:05,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 162 [2025-03-04 15:23:05,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:07,794 INFO L124 PetriNetUnfolderBase]: 20921/43352 cut-off events. [2025-03-04 15:23:07,794 INFO L125 PetriNetUnfolderBase]: For 131/131 co-relation queries the response was YES. [2025-03-04 15:23:07,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74664 conditions, 43352 events. 20921/43352 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 1178. Compared 435091 event pairs, 19440 based on Foata normal form. 2/38653 useless extension candidates. Maximal degree in co-relation 74629. Up to 31181 conditions per place. [2025-03-04 15:23:07,962 INFO L140 encePairwiseOnDemand]: 158/162 looper letters, 69 selfloop transitions, 7 changer transitions 0/135 dead transitions. [2025-03-04 15:23:07,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 135 transitions, 459 flow [2025-03-04 15:23:07,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:23:07,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 15:23:07,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 491 transitions. [2025-03-04 15:23:07,964 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4329805996472663 [2025-03-04 15:23:07,964 INFO L175 Difference]: Start difference. First operand has 134 places, 132 transitions, 292 flow. Second operand 7 states and 491 transitions. [2025-03-04 15:23:07,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 135 transitions, 459 flow [2025-03-04 15:23:07,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 135 transitions, 445 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:23:07,967 INFO L231 Difference]: Finished difference. Result has 140 places, 135 transitions, 318 flow [2025-03-04 15:23:07,967 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=318, PETRI_PLACES=140, PETRI_TRANSITIONS=135} [2025-03-04 15:23:07,967 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 9 predicate places. [2025-03-04 15:23:07,967 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 135 transitions, 318 flow [2025-03-04 15:23:07,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 60.3) internal successors, (603), 10 states have internal predecessors, (603), 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 15:23:07,968 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:07,968 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1] [2025-03-04 15:23:07,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 15:23:08,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:23:08,172 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2025-03-04 15:23:08,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:08,172 INFO L85 PathProgramCache]: Analyzing trace with hash 801772232, now seen corresponding path program 2 times [2025-03-04 15:23:08,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:08,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582802513] [2025-03-04 15:23:08,173 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:23:08,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:08,180 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-04 15:23:08,183 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 15 statements. [2025-03-04 15:23:08,183 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:23:08,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:08,218 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 15:23:08,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:08,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582802513] [2025-03-04 15:23:08,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582802513] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:08,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:23:08,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:23:08,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081981994] [2025-03-04 15:23:08,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:08,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:23:08,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:08,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:23:08,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:23:08,227 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 162 [2025-03-04 15:23:08,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 135 transitions, 318 flow. Second operand has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 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 15:23:08,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:08,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 162 [2025-03-04 15:23:08,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:10,976 INFO L124 PetriNetUnfolderBase]: 23017/45811 cut-off events. [2025-03-04 15:23:10,977 INFO L125 PetriNetUnfolderBase]: For 110/110 co-relation queries the response was YES. [2025-03-04 15:23:11,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80506 conditions, 45811 events. 23017/45811 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 1202. Compared 449239 event pairs, 11716 based on Foata normal form. 21/40675 useless extension candidates. Maximal degree in co-relation 80466. Up to 34500 conditions per place. [2025-03-04 15:23:11,159 INFO L140 encePairwiseOnDemand]: 156/162 looper letters, 119 selfloop transitions, 3 changer transitions 0/178 dead transitions. [2025-03-04 15:23:11,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 178 transitions, 648 flow [2025-03-04 15:23:11,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:23:11,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:23:11,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 352 transitions. [2025-03-04 15:23:11,161 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5432098765432098 [2025-03-04 15:23:11,161 INFO L175 Difference]: Start difference. First operand has 140 places, 135 transitions, 318 flow. Second operand 4 states and 352 transitions. [2025-03-04 15:23:11,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 178 transitions, 648 flow [2025-03-04 15:23:11,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 178 transitions, 644 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:23:11,164 INFO L231 Difference]: Finished difference. Result has 143 places, 137 transitions, 338 flow [2025-03-04 15:23:11,164 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=338, PETRI_PLACES=143, PETRI_TRANSITIONS=137} [2025-03-04 15:23:11,166 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 12 predicate places. [2025-03-04 15:23:11,166 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 137 transitions, 338 flow [2025-03-04 15:23:11,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 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 15:23:11,166 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:11,166 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:23:11,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 15:23:11,166 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2025-03-04 15:23:11,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:11,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1705316873, now seen corresponding path program 1 times [2025-03-04 15:23:11,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:11,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552958981] [2025-03-04 15:23:11,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:11,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:11,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:23:11,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:23:11,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:11,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:11,209 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 15:23:11,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:11,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552958981] [2025-03-04 15:23:11,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552958981] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:11,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:23:11,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:23:11,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614972841] [2025-03-04 15:23:11,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:11,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:23:11,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:11,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:23:11,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:23:11,214 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 162 [2025-03-04 15:23:11,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 137 transitions, 338 flow. Second operand has 4 states, 4 states have (on average 61.5) internal successors, (246), 4 states have internal predecessors, (246), 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 15:23:11,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:11,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 162 [2025-03-04 15:23:11,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:13,190 INFO L124 PetriNetUnfolderBase]: 21407/40320 cut-off events. [2025-03-04 15:23:13,191 INFO L125 PetriNetUnfolderBase]: For 1134/2063 co-relation queries the response was YES. [2025-03-04 15:23:13,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73580 conditions, 40320 events. 21407/40320 cut-off events. For 1134/2063 co-relation queries the response was YES. Maximal size of possible extension queue 1125. Compared 384955 event pairs, 440 based on Foata normal form. 526/37106 useless extension candidates. Maximal degree in co-relation 73539. Up to 28198 conditions per place. [2025-03-04 15:23:13,446 INFO L140 encePairwiseOnDemand]: 158/162 looper letters, 167 selfloop transitions, 3 changer transitions 0/228 dead transitions. [2025-03-04 15:23:13,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 228 transitions, 890 flow [2025-03-04 15:23:13,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:23:13,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:23:13,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 399 transitions. [2025-03-04 15:23:13,447 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6157407407407407 [2025-03-04 15:23:13,447 INFO L175 Difference]: Start difference. First operand has 143 places, 137 transitions, 338 flow. Second operand 4 states and 399 transitions. [2025-03-04 15:23:13,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 228 transitions, 890 flow [2025-03-04 15:23:13,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 228 transitions, 886 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:23:13,451 INFO L231 Difference]: Finished difference. Result has 144 places, 136 transitions, 340 flow [2025-03-04 15:23:13,451 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=340, PETRI_PLACES=144, PETRI_TRANSITIONS=136} [2025-03-04 15:23:13,451 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 13 predicate places. [2025-03-04 15:23:13,451 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 136 transitions, 340 flow [2025-03-04 15:23:13,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 61.5) internal successors, (246), 4 states have internal predecessors, (246), 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 15:23:13,452 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:13,452 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:23:13,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 15:23:13,452 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2025-03-04 15:23:13,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:13,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1325216312, now seen corresponding path program 1 times [2025-03-04 15:23:13,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:13,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715145382] [2025-03-04 15:23:13,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:13,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:13,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 15:23:13,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 15:23:13,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:13,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:13,490 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 15:23:13,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:13,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715145382] [2025-03-04 15:23:13,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715145382] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:13,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:23:13,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:23:13,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194206030] [2025-03-04 15:23:13,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:13,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:23:13,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:13,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:23:13,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:23:13,494 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 162 [2025-03-04 15:23:13,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 136 transitions, 340 flow. Second operand has 4 states, 4 states have (on average 61.5) internal successors, (246), 4 states have internal predecessors, (246), 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 15:23:13,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:13,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 162 [2025-03-04 15:23:13,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:16,270 INFO L124 PetriNetUnfolderBase]: 20832/43282 cut-off events. [2025-03-04 15:23:16,271 INFO L125 PetriNetUnfolderBase]: For 2470/3347 co-relation queries the response was YES. [2025-03-04 15:23:16,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76997 conditions, 43282 events. 20832/43282 cut-off events. For 2470/3347 co-relation queries the response was YES. Maximal size of possible extension queue 1147. Compared 434715 event pairs, 16531 based on Foata normal form. 526/39582 useless extension candidates. Maximal degree in co-relation 76956. Up to 26767 conditions per place. [2025-03-04 15:23:16,581 INFO L140 encePairwiseOnDemand]: 158/162 looper letters, 166 selfloop transitions, 3 changer transitions 0/227 dead transitions. [2025-03-04 15:23:16,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 227 transitions, 888 flow [2025-03-04 15:23:16,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:23:16,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:23:16,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 398 transitions. [2025-03-04 15:23:16,583 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6141975308641975 [2025-03-04 15:23:16,583 INFO L175 Difference]: Start difference. First operand has 144 places, 136 transitions, 340 flow. Second operand 4 states and 398 transitions. [2025-03-04 15:23:16,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 227 transitions, 888 flow [2025-03-04 15:23:16,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 227 transitions, 882 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:23:16,589 INFO L231 Difference]: Finished difference. Result has 143 places, 135 transitions, 338 flow [2025-03-04 15:23:16,590 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=338, PETRI_PLACES=143, PETRI_TRANSITIONS=135} [2025-03-04 15:23:16,590 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 12 predicate places. [2025-03-04 15:23:16,590 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 135 transitions, 338 flow [2025-03-04 15:23:16,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 61.5) internal successors, (246), 4 states have internal predecessors, (246), 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 15:23:16,590 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:16,590 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:23:16,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 15:23:16,591 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2025-03-04 15:23:16,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:16,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1429502607, now seen corresponding path program 1 times [2025-03-04 15:23:16,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:16,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131813418] [2025-03-04 15:23:16,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:16,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:16,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 15:23:16,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:23:16,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:16,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:16,680 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:23:16,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:16,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131813418] [2025-03-04 15:23:16,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131813418] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:23:16,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043126497] [2025-03-04 15:23:16,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:16,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:23:16,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:23:16,683 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:23:16,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 15:23:16,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 15:23:16,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:23:16,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:16,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:16,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 15:23:16,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:23:16,780 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:23:16,780 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:23:16,840 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:23:16,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2043126497] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:23:16,840 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:23:16,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-03-04 15:23:16,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114208218] [2025-03-04 15:23:16,841 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:23:16,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 15:23:16,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:16,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 15:23:16,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-04 15:23:16,859 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 162 [2025-03-04 15:23:16,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 135 transitions, 338 flow. Second operand has 18 states, 18 states have (on average 60.27777777777778) internal successors, (1085), 18 states have internal predecessors, (1085), 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 15:23:16,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:16,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 162 [2025-03-04 15:23:16,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:19,218 INFO L124 PetriNetUnfolderBase]: 20919/43590 cut-off events. [2025-03-04 15:23:19,218 INFO L125 PetriNetUnfolderBase]: For 2583/3453 co-relation queries the response was YES. [2025-03-04 15:23:19,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77419 conditions, 43590 events. 20919/43590 cut-off events. For 2583/3453 co-relation queries the response was YES. Maximal size of possible extension queue 1171. Compared 438849 event pairs, 19440 based on Foata normal form. 22/39264 useless extension candidates. Maximal degree in co-relation 77342. Up to 31203 conditions per place. [2025-03-04 15:23:19,559 INFO L140 encePairwiseOnDemand]: 158/162 looper letters, 70 selfloop transitions, 15 changer transitions 0/143 dead transitions. [2025-03-04 15:23:19,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 143 transitions, 556 flow [2025-03-04 15:23:19,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 15:23:19,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 15:23:19,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 973 transitions. [2025-03-04 15:23:19,562 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40041152263374485 [2025-03-04 15:23:19,562 INFO L175 Difference]: Start difference. First operand has 143 places, 135 transitions, 338 flow. Second operand 15 states and 973 transitions. [2025-03-04 15:23:19,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 143 transitions, 556 flow [2025-03-04 15:23:19,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 143 transitions, 550 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:23:19,567 INFO L231 Difference]: Finished difference. Result has 158 places, 143 transitions, 429 flow [2025-03-04 15:23:19,567 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=429, PETRI_PLACES=158, PETRI_TRANSITIONS=143} [2025-03-04 15:23:19,568 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 27 predicate places. [2025-03-04 15:23:19,568 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 143 transitions, 429 flow [2025-03-04 15:23:19,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 60.27777777777778) internal successors, (1085), 18 states have internal predecessors, (1085), 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 15:23:19,568 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:19,568 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:23:19,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 15:23:19,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:23:19,769 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2025-03-04 15:23:19,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:19,769 INFO L85 PathProgramCache]: Analyzing trace with hash -273601457, now seen corresponding path program 2 times [2025-03-04 15:23:19,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:19,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184320498] [2025-03-04 15:23:19,770 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:23:19,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:19,778 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-04 15:23:19,782 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 32 statements. [2025-03-04 15:23:19,782 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:23:19,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:19,823 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-04 15:23:19,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:19,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184320498] [2025-03-04 15:23:19,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184320498] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:19,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:23:19,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 15:23:19,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060335570] [2025-03-04 15:23:19,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:19,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:23:19,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:19,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:23:19,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:23:19,833 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 162 [2025-03-04 15:23:19,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 143 transitions, 429 flow. Second operand has 6 states, 6 states have (on average 60.0) internal successors, (360), 6 states have internal predecessors, (360), 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 15:23:19,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:19,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 162 [2025-03-04 15:23:19,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:22,459 INFO L124 PetriNetUnfolderBase]: 21731/41748 cut-off events. [2025-03-04 15:23:22,459 INFO L125 PetriNetUnfolderBase]: For 1878/1878 co-relation queries the response was YES. [2025-03-04 15:23:22,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76592 conditions, 41748 events. 21731/41748 cut-off events. For 1878/1878 co-relation queries the response was YES. Maximal size of possible extension queue 1168. Compared 401441 event pairs, 819 based on Foata normal form. 441/38439 useless extension candidates. Maximal degree in co-relation 76491. Up to 26688 conditions per place. [2025-03-04 15:23:22,874 INFO L140 encePairwiseOnDemand]: 157/162 looper letters, 203 selfloop transitions, 6 changer transitions 0/263 dead transitions. [2025-03-04 15:23:22,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 263 transitions, 1085 flow [2025-03-04 15:23:22,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:23:22,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:23:22,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 545 transitions. [2025-03-04 15:23:22,876 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5606995884773662 [2025-03-04 15:23:22,876 INFO L175 Difference]: Start difference. First operand has 158 places, 143 transitions, 429 flow. Second operand 6 states and 545 transitions. [2025-03-04 15:23:22,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 263 transitions, 1085 flow [2025-03-04 15:23:22,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 263 transitions, 1075 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-03-04 15:23:22,882 INFO L231 Difference]: Finished difference. Result has 158 places, 142 transitions, 427 flow [2025-03-04 15:23:22,882 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=415, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=427, PETRI_PLACES=158, PETRI_TRANSITIONS=142} [2025-03-04 15:23:22,882 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 27 predicate places. [2025-03-04 15:23:22,882 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 142 transitions, 427 flow [2025-03-04 15:23:22,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 60.0) internal successors, (360), 6 states have internal predecessors, (360), 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 15:23:22,882 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:22,883 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 15:23:22,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 15:23:22,883 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2025-03-04 15:23:22,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:22,883 INFO L85 PathProgramCache]: Analyzing trace with hash 108290165, now seen corresponding path program 1 times [2025-03-04 15:23:22,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:22,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484685806] [2025-03-04 15:23:22,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:22,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:22,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 15:23:22,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 15:23:22,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:22,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:22,947 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-04 15:23:22,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:22,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484685806] [2025-03-04 15:23:22,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484685806] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:22,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:23:22,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:23:22,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939909676] [2025-03-04 15:23:22,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:22,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:23:22,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:22,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:23:22,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:23:22,954 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 162 [2025-03-04 15:23:22,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 142 transitions, 427 flow. Second operand has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 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 15:23:22,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:22,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 162 [2025-03-04 15:23:22,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:25,881 INFO L124 PetriNetUnfolderBase]: 21290/40509 cut-off events. [2025-03-04 15:23:25,881 INFO L125 PetriNetUnfolderBase]: For 3442/3442 co-relation queries the response was YES. [2025-03-04 15:23:26,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75471 conditions, 40509 events. 21290/40509 cut-off events. For 3442/3442 co-relation queries the response was YES. Maximal size of possible extension queue 1110. Compared 382927 event pairs, 1280 based on Foata normal form. 441/37801 useless extension candidates. Maximal degree in co-relation 75374. Up to 28410 conditions per place. [2025-03-04 15:23:26,161 INFO L140 encePairwiseOnDemand]: 157/162 looper letters, 162 selfloop transitions, 6 changer transitions 0/222 dead transitions. [2025-03-04 15:23:26,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 222 transitions, 921 flow [2025-03-04 15:23:26,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:23:26,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:23:26,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 386 transitions. [2025-03-04 15:23:26,163 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.595679012345679 [2025-03-04 15:23:26,163 INFO L175 Difference]: Start difference. First operand has 158 places, 142 transitions, 427 flow. Second operand 4 states and 386 transitions. [2025-03-04 15:23:26,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 222 transitions, 921 flow [2025-03-04 15:23:26,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 222 transitions, 905 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-03-04 15:23:26,191 INFO L231 Difference]: Finished difference. Result has 156 places, 142 transitions, 427 flow [2025-03-04 15:23:26,191 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=407, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=427, PETRI_PLACES=156, PETRI_TRANSITIONS=142} [2025-03-04 15:23:26,191 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 25 predicate places. [2025-03-04 15:23:26,191 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 142 transitions, 427 flow [2025-03-04 15:23:26,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 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 15:23:26,192 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:26,192 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:23:26,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 15:23:26,192 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2025-03-04 15:23:26,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:26,192 INFO L85 PathProgramCache]: Analyzing trace with hash -935200368, now seen corresponding path program 1 times [2025-03-04 15:23:26,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:26,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580733491] [2025-03-04 15:23:26,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:26,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:26,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 15:23:26,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 15:23:26,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:26,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:26,236 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-04 15:23:26,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:26,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580733491] [2025-03-04 15:23:26,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580733491] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:26,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:23:26,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:23:26,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104592076] [2025-03-04 15:23:26,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:26,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:23:26,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:26,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:23:26,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:23:26,242 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 162 [2025-03-04 15:23:26,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 142 transitions, 427 flow. Second operand has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 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 15:23:26,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:26,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 162 [2025-03-04 15:23:26,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:28,297 INFO L124 PetriNetUnfolderBase]: 21406/40544 cut-off events. [2025-03-04 15:23:28,298 INFO L125 PetriNetUnfolderBase]: For 4069/4069 co-relation queries the response was YES. [2025-03-04 15:23:28,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74840 conditions, 40544 events. 21406/40544 cut-off events. For 4069/4069 co-relation queries the response was YES. Maximal size of possible extension queue 1125. Compared 379946 event pairs, 900 based on Foata normal form. 487/37270 useless extension candidates. Maximal degree in co-relation 74745. Up to 27381 conditions per place. [2025-03-04 15:23:28,564 INFO L140 encePairwiseOnDemand]: 158/162 looper letters, 172 selfloop transitions, 3 changer transitions 0/229 dead transitions. [2025-03-04 15:23:28,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 229 transitions, 975 flow [2025-03-04 15:23:28,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:23:28,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:23:28,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 397 transitions. [2025-03-04 15:23:28,565 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6126543209876543 [2025-03-04 15:23:28,565 INFO L175 Difference]: Start difference. First operand has 156 places, 142 transitions, 427 flow. Second operand 4 states and 397 transitions. [2025-03-04 15:23:28,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 229 transitions, 975 flow [2025-03-04 15:23:28,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 229 transitions, 963 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:23:28,568 INFO L231 Difference]: Finished difference. Result has 156 places, 141 transitions, 423 flow [2025-03-04 15:23:28,568 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=417, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=423, PETRI_PLACES=156, PETRI_TRANSITIONS=141} [2025-03-04 15:23:28,569 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 25 predicate places. [2025-03-04 15:23:28,569 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 141 transitions, 423 flow [2025-03-04 15:23:28,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 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 15:23:28,569 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:28,569 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:23:28,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 15:23:28,569 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2025-03-04 15:23:28,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:28,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1057433333, now seen corresponding path program 1 times [2025-03-04 15:23:28,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:28,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79180377] [2025-03-04 15:23:28,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:28,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:28,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 15:23:28,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 15:23:28,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:28,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:28,742 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:23:28,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:28,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79180377] [2025-03-04 15:23:28,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79180377] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:23:28,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [300348731] [2025-03-04 15:23:28,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:28,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:23:28,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:23:28,745 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:23:28,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 15:23:28,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 15:23:28,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 15:23:28,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:28,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:28,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 15:23:28,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:23:28,864 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:23:28,865 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:23:28,983 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:23:28,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [300348731] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:23:28,983 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:23:28,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 22 [2025-03-04 15:23:28,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141334081] [2025-03-04 15:23:28,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:23:28,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 15:23:28,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:28,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 15:23:28,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-03-04 15:23:29,001 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 162 [2025-03-04 15:23:29,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 141 transitions, 423 flow. Second operand has 23 states, 23 states have (on average 60.52173913043478) internal successors, (1392), 23 states have internal predecessors, (1392), 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 15:23:29,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:29,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 162 [2025-03-04 15:23:29,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:31,370 INFO L124 PetriNetUnfolderBase]: 20961/43634 cut-off events. [2025-03-04 15:23:31,370 INFO L125 PetriNetUnfolderBase]: For 3930/3930 co-relation queries the response was YES. [2025-03-04 15:23:31,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77999 conditions, 43634 events. 20961/43634 cut-off events. For 3930/3930 co-relation queries the response was YES. Maximal size of possible extension queue 1179. Compared 439273 event pairs, 19501 based on Foata normal form. 3/39329 useless extension candidates. Maximal degree in co-relation 77867. Up to 31295 conditions per place. [2025-03-04 15:23:31,770 INFO L140 encePairwiseOnDemand]: 158/162 looper letters, 71 selfloop transitions, 21 changer transitions 0/147 dead transitions. [2025-03-04 15:23:31,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 147 transitions, 661 flow [2025-03-04 15:23:31,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 15:23:31,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-04 15:23:31,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1332 transitions. [2025-03-04 15:23:31,772 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3915343915343915 [2025-03-04 15:23:31,772 INFO L175 Difference]: Start difference. First operand has 156 places, 141 transitions, 423 flow. Second operand 21 states and 1332 transitions. [2025-03-04 15:23:31,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 147 transitions, 661 flow [2025-03-04 15:23:31,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 147 transitions, 655 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:23:31,779 INFO L231 Difference]: Finished difference. Result has 176 places, 147 transitions, 528 flow [2025-03-04 15:23:31,779 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=417, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=528, PETRI_PLACES=176, PETRI_TRANSITIONS=147} [2025-03-04 15:23:31,779 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 45 predicate places. [2025-03-04 15:23:31,779 INFO L471 AbstractCegarLoop]: Abstraction has has 176 places, 147 transitions, 528 flow [2025-03-04 15:23:31,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 60.52173913043478) internal successors, (1392), 23 states have internal predecessors, (1392), 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 15:23:31,780 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:31,780 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:23:31,787 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 15:23:31,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-04 15:23:31,981 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2025-03-04 15:23:31,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:31,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1800260296, now seen corresponding path program 2 times [2025-03-04 15:23:31,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:31,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302944960] [2025-03-04 15:23:31,981 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:23:31,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:31,992 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-03-04 15:23:32,015 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 44 statements. [2025-03-04 15:23:32,015 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:23:32,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:32,483 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 15:23:32,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:32,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302944960] [2025-03-04 15:23:32,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302944960] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:32,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:23:32,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 15:23:32,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667790698] [2025-03-04 15:23:32,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:32,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 15:23:32,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:32,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 15:23:32,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 15:23:32,506 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 162 [2025-03-04 15:23:32,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 147 transitions, 528 flow. Second operand has 7 states, 7 states have (on average 59.142857142857146) internal successors, (414), 7 states have internal predecessors, (414), 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 15:23:32,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:32,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 162 [2025-03-04 15:23:32,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:35,976 INFO L124 PetriNetUnfolderBase]: 25660/51402 cut-off events. [2025-03-04 15:23:35,976 INFO L125 PetriNetUnfolderBase]: For 3013/3013 co-relation queries the response was YES. [2025-03-04 15:23:36,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92490 conditions, 51402 events. 25660/51402 cut-off events. For 3013/3013 co-relation queries the response was YES. Maximal size of possible extension queue 1425. Compared 520881 event pairs, 3078 based on Foata normal form. 598/47627 useless extension candidates. Maximal degree in co-relation 92330. Up to 27118 conditions per place. [2025-03-04 15:23:36,413 INFO L140 encePairwiseOnDemand]: 152/162 looper letters, 318 selfloop transitions, 17 changer transitions 0/388 dead transitions. [2025-03-04 15:23:36,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 388 transitions, 1788 flow [2025-03-04 15:23:36,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 15:23:36,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 15:23:36,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 769 transitions. [2025-03-04 15:23:36,414 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5933641975308642 [2025-03-04 15:23:36,414 INFO L175 Difference]: Start difference. First operand has 176 places, 147 transitions, 528 flow. Second operand 8 states and 769 transitions. [2025-03-04 15:23:36,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 388 transitions, 1788 flow [2025-03-04 15:23:36,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 388 transitions, 1745 flow, removed 1 selfloop flow, removed 13 redundant places. [2025-03-04 15:23:36,420 INFO L231 Difference]: Finished difference. Result has 176 places, 165 transitions, 604 flow [2025-03-04 15:23:36,420 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=485, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=604, PETRI_PLACES=176, PETRI_TRANSITIONS=165} [2025-03-04 15:23:36,420 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 45 predicate places. [2025-03-04 15:23:36,420 INFO L471 AbstractCegarLoop]: Abstraction has has 176 places, 165 transitions, 604 flow [2025-03-04 15:23:36,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 59.142857142857146) internal successors, (414), 7 states have internal predecessors, (414), 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 15:23:36,420 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:36,421 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 15:23:36,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 15:23:36,421 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2025-03-04 15:23:36,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:36,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1730486455, now seen corresponding path program 1 times [2025-03-04 15:23:36,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:36,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200664528] [2025-03-04 15:23:36,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:36,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:36,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 15:23:36,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 15:23:36,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:36,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:23:36,445 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:23:36,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 15:23:36,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 15:23:36,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:36,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:23:36,467 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:23:36,467 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 15:23:36,467 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 29 remaining) [2025-03-04 15:23:36,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 29 remaining) [2025-03-04 15:23:36,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 29 remaining) [2025-03-04 15:23:36,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 29 remaining) [2025-03-04 15:23:36,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 29 remaining) [2025-03-04 15:23:36,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 29 remaining) [2025-03-04 15:23:36,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 29 remaining) [2025-03-04 15:23:36,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 29 remaining) [2025-03-04 15:23:36,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 29 remaining) [2025-03-04 15:23:36,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 29 remaining) [2025-03-04 15:23:36,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 29 remaining) [2025-03-04 15:23:36,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 29 remaining) [2025-03-04 15:23:36,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 29 remaining) [2025-03-04 15:23:36,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 29 remaining) [2025-03-04 15:23:36,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 29 remaining) [2025-03-04 15:23:36,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 29 remaining) [2025-03-04 15:23:36,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 29 remaining) [2025-03-04 15:23:36,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 29 remaining) [2025-03-04 15:23:36,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 29 remaining) [2025-03-04 15:23:36,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 29 remaining) [2025-03-04 15:23:36,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 29 remaining) [2025-03-04 15:23:36,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 29 remaining) [2025-03-04 15:23:36,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 29 remaining) [2025-03-04 15:23:36,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 29 remaining) [2025-03-04 15:23:36,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 29 remaining) [2025-03-04 15:23:36,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 29 remaining) [2025-03-04 15:23:36,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 29 remaining) [2025-03-04 15:23:36,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 29 remaining) [2025-03-04 15:23:36,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 29 remaining) [2025-03-04 15:23:36,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 15:23:36,470 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:23:36,470 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 15:23:36,470 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-04 15:23:36,489 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 15:23:36,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 170 places, 211 transitions, 449 flow [2025-03-04 15:23:36,507 INFO L124 PetriNetUnfolderBase]: 86/406 cut-off events. [2025-03-04 15:23:36,507 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-04 15:23:36,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 431 conditions, 406 events. 86/406 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1981 event pairs, 1 based on Foata normal form. 0/260 useless extension candidates. Maximal degree in co-relation 282. Up to 16 conditions per place. [2025-03-04 15:23:36,511 INFO L82 GeneralOperation]: Start removeDead. Operand has 170 places, 211 transitions, 449 flow [2025-03-04 15:23:36,513 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 170 places, 211 transitions, 449 flow [2025-03-04 15:23:36,513 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:23:36,514 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;@3cc10eed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:23:36,514 INFO L334 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2025-03-04 15:23:36,515 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:23:36,515 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-03-04 15:23:36,515 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:23:36,515 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:36,515 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 15:23:36,515 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 32 more)] === [2025-03-04 15:23:36,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:36,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1037940, now seen corresponding path program 1 times [2025-03-04 15:23:36,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:36,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245696345] [2025-03-04 15:23:36,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:36,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:36,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:23:36,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:23:36,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:36,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:36,535 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 15:23:36,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:36,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245696345] [2025-03-04 15:23:36,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245696345] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:36,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:23:36,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:23:36,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635222083] [2025-03-04 15:23:36,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:36,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:23:36,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:36,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:23:36,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:23:36,540 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 211 [2025-03-04 15:23:36,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 211 transitions, 449 flow. Second operand has 4 states, 4 states have (on average 76.75) internal successors, (307), 4 states have internal predecessors, (307), 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 15:23:36,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:36,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 211 [2025-03-04 15:23:36,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand