./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/pthread/stack-2.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/pthread/stack-2.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 1c5d098180a5596f0a60d3177354c69a5ee6da68b8191dc75b6c33b291ef0421 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:08:05,160 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:08:05,211 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:08:05,215 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:08:05,215 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:08:05,228 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:08:05,229 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:08:05,230 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:08:05,230 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:08:05,230 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:08:05,230 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:08:05,231 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:08:05,231 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:08:05,231 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:08:05,231 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:08:05,231 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:08:05,231 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:08:05,232 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:08:05,232 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:08:05,232 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:08:05,232 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:08:05,232 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:08:05,232 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:08:05,232 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:08:05,232 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:08:05,232 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:08:05,232 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:08:05,232 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:08:05,233 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:08:05,233 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:08:05,233 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:08:05,233 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:08:05,233 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:08:05,233 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:08:05,233 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:08:05,233 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:08:05,234 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:08:05,234 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:08:05,234 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:08:05,234 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:08:05,234 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:08:05,234 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:08:05,234 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:08:05,234 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:08:05,234 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:08:05,234 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 -> 1c5d098180a5596f0a60d3177354c69a5ee6da68b8191dc75b6c33b291ef0421 [2025-03-04 15:08:05,457 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:08:05,465 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:08:05,466 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:08:05,467 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:08:05,467 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:08:05,469 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/stack-2.i [2025-03-04 15:08:06,612 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97055485b/e463a2763fa744b38d4a770d818a6809/FLAG3a5b8b951 [2025-03-04 15:08:06,930 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:08:06,931 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/stack-2.i [2025-03-04 15:08:06,951 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97055485b/e463a2763fa744b38d4a770d818a6809/FLAG3a5b8b951 [2025-03-04 15:08:07,184 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97055485b/e463a2763fa744b38d4a770d818a6809 [2025-03-04 15:08:07,186 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:08:07,188 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:08:07,189 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:08:07,189 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:08:07,192 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:08:07,192 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:08:07" (1/1) ... [2025-03-04 15:08:07,193 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2303777 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:08:07, skipping insertion in model container [2025-03-04 15:08:07,193 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:08:07" (1/1) ... [2025-03-04 15:08:07,218 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:08:07,601 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:08:07,614 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:08:07,649 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:08:07,686 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:08:07,687 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:08:07 WrapperNode [2025-03-04 15:08:07,687 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:08:07,688 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:08:07,688 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:08:07,688 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:08:07,697 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:08:07" (1/1) ... [2025-03-04 15:08:07,707 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:08:07" (1/1) ... [2025-03-04 15:08:07,725 INFO L138 Inliner]: procedures = 277, calls = 37, calls flagged for inlining = 13, calls inlined = 14, statements flattened = 163 [2025-03-04 15:08:07,725 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:08:07,726 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:08:07,726 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:08:07,726 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:08:07,732 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:08:07" (1/1) ... [2025-03-04 15:08:07,732 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:08:07" (1/1) ... [2025-03-04 15:08:07,735 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:08:07" (1/1) ... [2025-03-04 15:08:07,749 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 5, 7]. 50 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 5, 5]. The 1 writes are split as follows [0, 0, 1]. [2025-03-04 15:08:07,749 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:08:07" (1/1) ... [2025-03-04 15:08:07,749 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:08:07" (1/1) ... [2025-03-04 15:08:07,753 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:08:07" (1/1) ... [2025-03-04 15:08:07,754 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:08:07" (1/1) ... [2025-03-04 15:08:07,755 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:08:07" (1/1) ... [2025-03-04 15:08:07,756 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:08:07" (1/1) ... [2025-03-04 15:08:07,757 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:08:07,758 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:08:07,758 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:08:07,758 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:08:07,759 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:08:07" (1/1) ... [2025-03-04 15:08:07,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:08:07,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:08:07,781 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:08:07,784 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:08:07,800 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-04 15:08:07,801 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-04 15:08:07,801 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-04 15:08:07,801 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-04 15:08:07,801 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 15:08:07,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:08:07,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:08:07,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 15:08:07,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:08:07,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:08:07,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 15:08:07,801 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 15:08:07,801 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:08:07,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:08:07,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 15:08:07,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 15:08:07,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:08:07,802 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:08:07,803 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:08:07,918 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:08:07,920 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:08:08,155 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L986-1: pop_#res#1 := 0; [2025-03-04 15:08:08,155 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L984: havoc pop_#t~mem38#1; [2025-03-04 15:08:08,155 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L984-1: havoc pop_#t~ret37#1; [2025-03-04 15:08:08,156 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:08:08,156 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:08:08,284 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:08:08,286 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:08:08,286 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:08:08 BoogieIcfgContainer [2025-03-04 15:08:08,286 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:08:08,288 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:08:08,288 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:08:08,292 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:08:08,292 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:08:07" (1/3) ... [2025-03-04 15:08:08,293 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@292c442b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:08:08, skipping insertion in model container [2025-03-04 15:08:08,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:08:07" (2/3) ... [2025-03-04 15:08:08,294 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@292c442b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:08:08, skipping insertion in model container [2025-03-04 15:08:08,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:08:08" (3/3) ... [2025-03-04 15:08:08,295 INFO L128 eAbstractionObserver]: Analyzing ICFG stack-2.i [2025-03-04 15:08:08,306 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:08:08,308 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG stack-2.i that has 3 procedures, 44 locations, 1 initial locations, 2 loop locations, and 8 error locations. [2025-03-04 15:08:08,309 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:08:08,362 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 15:08:08,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 48 transitions, 110 flow [2025-03-04 15:08:08,413 INFO L124 PetriNetUnfolderBase]: 5/46 cut-off events. [2025-03-04 15:08:08,415 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 15:08:08,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 46 events. 5/46 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 131 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 43. Up to 2 conditions per place. [2025-03-04 15:08:08,417 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 48 transitions, 110 flow [2025-03-04 15:08:08,423 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 44 transitions, 97 flow [2025-03-04 15:08:08,430 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:08:08,446 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;@25164b60, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:08:08,446 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-03-04 15:08:08,470 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:08:08,470 INFO L124 PetriNetUnfolderBase]: 1/20 cut-off events. [2025-03-04 15:08:08,470 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 15:08:08,470 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:08,471 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:08,471 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:08,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:08,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1435140805, now seen corresponding path program 1 times [2025-03-04 15:08:08,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:08,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016305419] [2025-03-04 15:08:08,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:08,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:08,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:08:08,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:08:08,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:08,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:08,754 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:08:08,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:08,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016305419] [2025-03-04 15:08:08,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016305419] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:08,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:08:08,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:08:08,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120591556] [2025-03-04 15:08:08,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:08,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:08:08,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:08,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:08:08,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:08:08,785 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 48 [2025-03-04 15:08:08,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 44 transitions, 97 flow. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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:08:08,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:08,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 48 [2025-03-04 15:08:08,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:09,095 INFO L124 PetriNetUnfolderBase]: 708/1406 cut-off events. [2025-03-04 15:08:09,095 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2025-03-04 15:08:09,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2592 conditions, 1406 events. 708/1406 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 7651 event pairs, 143 based on Foata normal form. 40/1294 useless extension candidates. Maximal degree in co-relation 2468. Up to 781 conditions per place. [2025-03-04 15:08:09,105 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 71 selfloop transitions, 6 changer transitions 0/91 dead transitions. [2025-03-04 15:08:09,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 91 transitions, 354 flow [2025-03-04 15:08:09,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:08:09,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:08:09,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 162 transitions. [2025-03-04 15:08:09,117 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.675 [2025-03-04 15:08:09,118 INFO L175 Difference]: Start difference. First operand has 46 places, 44 transitions, 97 flow. Second operand 5 states and 162 transitions. [2025-03-04 15:08:09,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 91 transitions, 354 flow [2025-03-04 15:08:09,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 91 transitions, 345 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:08:09,124 INFO L231 Difference]: Finished difference. Result has 50 places, 49 transitions, 140 flow [2025-03-04 15:08:09,125 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=140, PETRI_PLACES=50, PETRI_TRANSITIONS=49} [2025-03-04 15:08:09,128 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 4 predicate places. [2025-03-04 15:08:09,128 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 49 transitions, 140 flow [2025-03-04 15:08:09,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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:08:09,129 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:09,129 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:09,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:08:09,129 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:09,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:09,131 INFO L85 PathProgramCache]: Analyzing trace with hash 16184202, now seen corresponding path program 1 times [2025-03-04 15:08:09,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:09,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916524570] [2025-03-04 15:08:09,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:09,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:09,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:08:09,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:08:09,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:09,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:09,238 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:08:09,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:09,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916524570] [2025-03-04 15:08:09,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916524570] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:09,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:08:09,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:08:09,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912889132] [2025-03-04 15:08:09,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:09,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:08:09,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:09,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:08:09,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:08:09,244 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 48 [2025-03-04 15:08:09,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 49 transitions, 140 flow. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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:08:09,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:09,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 48 [2025-03-04 15:08:09,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:09,421 INFO L124 PetriNetUnfolderBase]: 746/1508 cut-off events. [2025-03-04 15:08:09,422 INFO L125 PetriNetUnfolderBase]: For 346/350 co-relation queries the response was YES. [2025-03-04 15:08:09,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3178 conditions, 1508 events. 746/1508 cut-off events. For 346/350 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 8366 event pairs, 195 based on Foata normal form. 64/1451 useless extension candidates. Maximal degree in co-relation 2800. Up to 839 conditions per place. [2025-03-04 15:08:09,429 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 67 selfloop transitions, 7 changer transitions 0/88 dead transitions. [2025-03-04 15:08:09,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 88 transitions, 388 flow [2025-03-04 15:08:09,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:08:09,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:08:09,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 156 transitions. [2025-03-04 15:08:09,430 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.65 [2025-03-04 15:08:09,430 INFO L175 Difference]: Start difference. First operand has 50 places, 49 transitions, 140 flow. Second operand 5 states and 156 transitions. [2025-03-04 15:08:09,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 88 transitions, 388 flow [2025-03-04 15:08:09,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 88 transitions, 388 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:08:09,434 INFO L231 Difference]: Finished difference. Result has 57 places, 52 transitions, 188 flow [2025-03-04 15:08:09,434 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=188, PETRI_PLACES=57, PETRI_TRANSITIONS=52} [2025-03-04 15:08:09,434 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 11 predicate places. [2025-03-04 15:08:09,435 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 52 transitions, 188 flow [2025-03-04 15:08:09,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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:08:09,435 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:09,435 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:09,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 15:08:09,435 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:09,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:09,435 INFO L85 PathProgramCache]: Analyzing trace with hash 501678887, now seen corresponding path program 1 times [2025-03-04 15:08:09,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:09,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543058919] [2025-03-04 15:08:09,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:09,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:09,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:08:09,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:08:09,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:09,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:09,505 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:08:09,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:09,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543058919] [2025-03-04 15:08:09,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543058919] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:09,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:08:09,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:08:09,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422641070] [2025-03-04 15:08:09,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:09,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:08:09,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:09,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:08:09,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:08:09,513 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 48 [2025-03-04 15:08:09,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 52 transitions, 188 flow. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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:08:09,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:09,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 48 [2025-03-04 15:08:09,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:09,751 INFO L124 PetriNetUnfolderBase]: 1250/2479 cut-off events. [2025-03-04 15:08:09,751 INFO L125 PetriNetUnfolderBase]: For 1160/1168 co-relation queries the response was YES. [2025-03-04 15:08:09,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5711 conditions, 2479 events. 1250/2479 cut-off events. For 1160/1168 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 15000 event pairs, 528 based on Foata normal form. 68/2430 useless extension candidates. Maximal degree in co-relation 5209. Up to 1228 conditions per place. [2025-03-04 15:08:09,781 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 81 selfloop transitions, 3 changer transitions 0/98 dead transitions. [2025-03-04 15:08:09,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 98 transitions, 527 flow [2025-03-04 15:08:09,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:08:09,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:08:09,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 132 transitions. [2025-03-04 15:08:09,782 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6875 [2025-03-04 15:08:09,783 INFO L175 Difference]: Start difference. First operand has 57 places, 52 transitions, 188 flow. Second operand 4 states and 132 transitions. [2025-03-04 15:08:09,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 98 transitions, 527 flow [2025-03-04 15:08:09,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 98 transitions, 517 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:08:09,790 INFO L231 Difference]: Finished difference. Result has 61 places, 54 transitions, 207 flow [2025-03-04 15:08:09,791 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=207, PETRI_PLACES=61, PETRI_TRANSITIONS=54} [2025-03-04 15:08:09,791 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 15 predicate places. [2025-03-04 15:08:09,791 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 54 transitions, 207 flow [2025-03-04 15:08:09,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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:08:09,791 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:09,791 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:09,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 15:08:09,792 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:09,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:09,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1588362660, now seen corresponding path program 1 times [2025-03-04 15:08:09,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:09,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151986409] [2025-03-04 15:08:09,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:09,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:09,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:08:09,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:08:09,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:09,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:09,862 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:08:09,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:09,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151986409] [2025-03-04 15:08:09,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151986409] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:09,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:08:09,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:08:09,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064010463] [2025-03-04 15:08:09,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:09,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:08:09,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:09,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:08:09,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:08:09,870 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 48 [2025-03-04 15:08:09,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 54 transitions, 207 flow. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:09,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:09,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 48 [2025-03-04 15:08:09,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:10,143 INFO L124 PetriNetUnfolderBase]: 1711/3261 cut-off events. [2025-03-04 15:08:10,144 INFO L125 PetriNetUnfolderBase]: For 2145/2317 co-relation queries the response was YES. [2025-03-04 15:08:10,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7902 conditions, 3261 events. 1711/3261 cut-off events. For 2145/2317 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 20120 event pairs, 635 based on Foata normal form. 106/3248 useless extension candidates. Maximal degree in co-relation 7134. Up to 1454 conditions per place. [2025-03-04 15:08:10,159 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 82 selfloop transitions, 3 changer transitions 0/99 dead transitions. [2025-03-04 15:08:10,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 99 transitions, 546 flow [2025-03-04 15:08:10,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:08:10,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:08:10,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 134 transitions. [2025-03-04 15:08:10,160 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6979166666666666 [2025-03-04 15:08:10,160 INFO L175 Difference]: Start difference. First operand has 61 places, 54 transitions, 207 flow. Second operand 4 states and 134 transitions. [2025-03-04 15:08:10,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 99 transitions, 546 flow [2025-03-04 15:08:10,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 99 transitions, 540 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:08:10,165 INFO L231 Difference]: Finished difference. Result has 65 places, 56 transitions, 229 flow [2025-03-04 15:08:10,165 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=229, PETRI_PLACES=65, PETRI_TRANSITIONS=56} [2025-03-04 15:08:10,166 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 19 predicate places. [2025-03-04 15:08:10,166 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 56 transitions, 229 flow [2025-03-04 15:08:10,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:10,166 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:10,166 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:10,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 15:08:10,166 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:10,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:10,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1389023405, now seen corresponding path program 1 times [2025-03-04 15:08:10,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:10,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630787439] [2025-03-04 15:08:10,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:10,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:10,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 15:08:10,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 15:08:10,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:10,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:10,269 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:08:10,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:10,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630787439] [2025-03-04 15:08:10,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630787439] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:10,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:08:10,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:08:10,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136727573] [2025-03-04 15:08:10,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:10,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:08:10,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:10,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:08:10,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:08:10,271 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2025-03-04 15:08:10,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 56 transitions, 229 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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:08:10,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:10,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2025-03-04 15:08:10,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:10,440 INFO L124 PetriNetUnfolderBase]: 823/1825 cut-off events. [2025-03-04 15:08:10,441 INFO L125 PetriNetUnfolderBase]: For 1150/1226 co-relation queries the response was YES. [2025-03-04 15:08:10,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4525 conditions, 1825 events. 823/1825 cut-off events. For 1150/1226 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 10593 event pairs, 210 based on Foata normal form. 92/1886 useless extension candidates. Maximal degree in co-relation 4331. Up to 954 conditions per place. [2025-03-04 15:08:10,451 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 48 selfloop transitions, 4 changer transitions 0/68 dead transitions. [2025-03-04 15:08:10,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 68 transitions, 368 flow [2025-03-04 15:08:10,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:08:10,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:08:10,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2025-03-04 15:08:10,454 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-03-04 15:08:10,454 INFO L175 Difference]: Start difference. First operand has 65 places, 56 transitions, 229 flow. Second operand 3 states and 96 transitions. [2025-03-04 15:08:10,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 68 transitions, 368 flow [2025-03-04 15:08:10,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 68 transitions, 352 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-03-04 15:08:10,463 INFO L231 Difference]: Finished difference. Result has 62 places, 52 transitions, 193 flow [2025-03-04 15:08:10,463 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=193, PETRI_PLACES=62, PETRI_TRANSITIONS=52} [2025-03-04 15:08:10,464 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 16 predicate places. [2025-03-04 15:08:10,464 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 52 transitions, 193 flow [2025-03-04 15:08:10,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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:08:10,465 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:10,465 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:10,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:08:10,465 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:10,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:10,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1575967881, now seen corresponding path program 1 times [2025-03-04 15:08:10,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:10,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453410044] [2025-03-04 15:08:10,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:10,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:10,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 15:08:10,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 15:08:10,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:10,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:10,573 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:10,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:10,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453410044] [2025-03-04 15:08:10,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453410044] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:08:10,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781142767] [2025-03-04 15:08:10,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:10,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:08:10,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:08:10,576 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:08:10,578 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:08:10,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 15:08:10,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 15:08:10,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:10,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:10,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:08:10,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:08:10,717 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:10,717 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:08:10,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781142767] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:10,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:08:10,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-04 15:08:10,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276226289] [2025-03-04 15:08:10,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:10,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:08:10,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:10,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:08:10,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:08:10,724 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 48 [2025-03-04 15:08:10,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 52 transitions, 193 flow. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 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:08:10,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:10,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 48 [2025-03-04 15:08:10,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:11,035 INFO L124 PetriNetUnfolderBase]: 1302/2777 cut-off events. [2025-03-04 15:08:11,036 INFO L125 PetriNetUnfolderBase]: For 1364/1474 co-relation queries the response was YES. [2025-03-04 15:08:11,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6869 conditions, 2777 events. 1302/2777 cut-off events. For 1364/1474 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 17041 event pairs, 273 based on Foata normal form. 18/2744 useless extension candidates. Maximal degree in co-relation 5597. Up to 906 conditions per place. [2025-03-04 15:08:11,051 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 97 selfloop transitions, 9 changer transitions 0/120 dead transitions. [2025-03-04 15:08:11,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 120 transitions, 654 flow [2025-03-04 15:08:11,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:08:11,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 15:08:11,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 203 transitions. [2025-03-04 15:08:11,054 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6041666666666666 [2025-03-04 15:08:11,054 INFO L175 Difference]: Start difference. First operand has 62 places, 52 transitions, 193 flow. Second operand 7 states and 203 transitions. [2025-03-04 15:08:11,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 120 transitions, 654 flow [2025-03-04 15:08:11,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 120 transitions, 643 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:08:11,060 INFO L231 Difference]: Finished difference. Result has 70 places, 57 transitions, 251 flow [2025-03-04 15:08:11,060 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=251, PETRI_PLACES=70, PETRI_TRANSITIONS=57} [2025-03-04 15:08:11,061 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 24 predicate places. [2025-03-04 15:08:11,062 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 57 transitions, 251 flow [2025-03-04 15:08:11,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 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:08:11,062 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:11,062 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:11,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 15:08:11,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-04 15:08:11,263 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:11,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:11,263 INFO L85 PathProgramCache]: Analyzing trace with hash 2098313892, now seen corresponding path program 1 times [2025-03-04 15:08:11,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:11,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12797870] [2025-03-04 15:08:11,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:11,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:11,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 15:08:11,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:08:11,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:11,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:11,350 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:08:11,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:11,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12797870] [2025-03-04 15:08:11,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12797870] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:11,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:08:11,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:08:11,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456614093] [2025-03-04 15:08:11,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:11,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:08:11,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:11,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:08:11,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:08:11,363 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2025-03-04 15:08:11,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 57 transitions, 251 flow. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:11,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:11,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2025-03-04 15:08:11,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:11,720 INFO L124 PetriNetUnfolderBase]: 1824/3777 cut-off events. [2025-03-04 15:08:11,720 INFO L125 PetriNetUnfolderBase]: For 2941/3113 co-relation queries the response was YES. [2025-03-04 15:08:11,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9793 conditions, 3777 events. 1824/3777 cut-off events. For 2941/3113 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 24314 event pairs, 351 based on Foata normal form. 26/3786 useless extension candidates. Maximal degree in co-relation 7956. Up to 1716 conditions per place. [2025-03-04 15:08:11,742 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 107 selfloop transitions, 10 changer transitions 0/129 dead transitions. [2025-03-04 15:08:11,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 129 transitions, 757 flow [2025-03-04 15:08:11,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:08:11,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 15:08:11,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 195 transitions. [2025-03-04 15:08:11,743 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5803571428571429 [2025-03-04 15:08:11,744 INFO L175 Difference]: Start difference. First operand has 70 places, 57 transitions, 251 flow. Second operand 7 states and 195 transitions. [2025-03-04 15:08:11,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 129 transitions, 757 flow [2025-03-04 15:08:11,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 129 transitions, 748 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-04 15:08:11,750 INFO L231 Difference]: Finished difference. Result has 77 places, 62 transitions, 318 flow [2025-03-04 15:08:11,750 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=318, PETRI_PLACES=77, PETRI_TRANSITIONS=62} [2025-03-04 15:08:11,751 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 31 predicate places. [2025-03-04 15:08:11,751 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 62 transitions, 318 flow [2025-03-04 15:08:11,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:11,751 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:11,751 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:11,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 15:08:11,752 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:11,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:11,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1616305839, now seen corresponding path program 1 times [2025-03-04 15:08:11,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:11,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413314454] [2025-03-04 15:08:11,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:11,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:11,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 15:08:11,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:08:11,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:11,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:11,846 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:08:11,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:11,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413314454] [2025-03-04 15:08:11,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413314454] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:11,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:08:11,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:08:11,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543829200] [2025-03-04 15:08:11,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:11,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:08:11,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:11,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:08:11,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:08:11,861 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2025-03-04 15:08:11,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 62 transitions, 318 flow. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:11,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:11,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2025-03-04 15:08:11,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:12,271 INFO L124 PetriNetUnfolderBase]: 2301/4739 cut-off events. [2025-03-04 15:08:12,272 INFO L125 PetriNetUnfolderBase]: For 4939/5173 co-relation queries the response was YES. [2025-03-04 15:08:12,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12824 conditions, 4739 events. 2301/4739 cut-off events. For 4939/5173 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 32212 event pairs, 536 based on Foata normal form. 24/4736 useless extension candidates. Maximal degree in co-relation 9575. Up to 2363 conditions per place. [2025-03-04 15:08:12,292 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 108 selfloop transitions, 15 changer transitions 0/135 dead transitions. [2025-03-04 15:08:12,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 135 transitions, 848 flow [2025-03-04 15:08:12,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 15:08:12,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 15:08:12,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 210 transitions. [2025-03-04 15:08:12,294 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.546875 [2025-03-04 15:08:12,294 INFO L175 Difference]: Start difference. First operand has 77 places, 62 transitions, 318 flow. Second operand 8 states and 210 transitions. [2025-03-04 15:08:12,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 135 transitions, 848 flow [2025-03-04 15:08:12,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 135 transitions, 839 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-04 15:08:12,303 INFO L231 Difference]: Finished difference. Result has 85 places, 67 transitions, 410 flow [2025-03-04 15:08:12,303 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=410, PETRI_PLACES=85, PETRI_TRANSITIONS=67} [2025-03-04 15:08:12,303 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 39 predicate places. [2025-03-04 15:08:12,303 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 67 transitions, 410 flow [2025-03-04 15:08:12,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:12,304 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:12,304 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:12,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 15:08:12,304 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:12,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:12,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1478154692, now seen corresponding path program 1 times [2025-03-04 15:08:12,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:12,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51626589] [2025-03-04 15:08:12,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:12,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:12,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 15:08:12,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:08:12,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:12,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:12,358 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:12,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:12,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51626589] [2025-03-04 15:08:12,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51626589] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:08:12,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1802501493] [2025-03-04 15:08:12,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:12,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:08:12,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:08:12,361 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:08:12,362 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:08:12,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 15:08:12,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:08:12,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:12,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:12,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:08:12,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:08:12,447 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:12,447 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:08:12,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1802501493] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:12,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:08:12,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-03-04 15:08:12,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770461471] [2025-03-04 15:08:12,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:12,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:08:12,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:12,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:08:12,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-04 15:08:12,454 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 48 [2025-03-04 15:08:12,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 67 transitions, 410 flow. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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:08:12,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:12,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 48 [2025-03-04 15:08:12,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:12,851 INFO L124 PetriNetUnfolderBase]: 2583/5004 cut-off events. [2025-03-04 15:08:12,851 INFO L125 PetriNetUnfolderBase]: For 8300/8538 co-relation queries the response was YES. [2025-03-04 15:08:12,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14300 conditions, 5004 events. 2583/5004 cut-off events. For 8300/8538 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 32580 event pairs, 315 based on Foata normal form. 130/4995 useless extension candidates. Maximal degree in co-relation 11097. Up to 2463 conditions per place. [2025-03-04 15:08:12,877 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 89 selfloop transitions, 5 changer transitions 0/110 dead transitions. [2025-03-04 15:08:12,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 110 transitions, 898 flow [2025-03-04 15:08:12,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:08:12,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:08:12,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions. [2025-03-04 15:08:12,879 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.609375 [2025-03-04 15:08:12,879 INFO L175 Difference]: Start difference. First operand has 85 places, 67 transitions, 410 flow. Second operand 4 states and 117 transitions. [2025-03-04 15:08:12,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 110 transitions, 898 flow [2025-03-04 15:08:12,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 110 transitions, 864 flow, removed 8 selfloop flow, removed 4 redundant places. [2025-03-04 15:08:12,896 INFO L231 Difference]: Finished difference. Result has 83 places, 66 transitions, 396 flow [2025-03-04 15:08:12,896 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=396, PETRI_PLACES=83, PETRI_TRANSITIONS=66} [2025-03-04 15:08:12,897 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 37 predicate places. [2025-03-04 15:08:12,897 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 66 transitions, 396 flow [2025-03-04 15:08:12,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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:08:12,897 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:12,897 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:12,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 15:08:13,098 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,SelfDestructingSolverStorable8 [2025-03-04 15:08:13,098 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:13,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:13,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1610363678, now seen corresponding path program 1 times [2025-03-04 15:08:13,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:13,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142353950] [2025-03-04 15:08:13,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:13,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:13,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 15:08:13,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:08:13,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:13,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:13,184 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:13,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:13,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142353950] [2025-03-04 15:08:13,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142353950] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:08:13,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [495650641] [2025-03-04 15:08:13,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:13,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:08:13,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:08:13,187 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:08:13,188 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:08:13,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 15:08:13,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:08:13,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:13,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:13,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:08:13,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:08:13,299 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:13,300 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:08:13,342 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:13,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [495650641] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:08:13,342 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:08:13,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-03-04 15:08:13,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139896975] [2025-03-04 15:08:13,342 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:08:13,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 15:08:13,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:13,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 15:08:13,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 15:08:13,353 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 48 [2025-03-04 15:08:13,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 66 transitions, 396 flow. Second operand has 12 states, 12 states have (on average 19.083333333333332) internal successors, (229), 12 states have internal predecessors, (229), 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:08:13,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:13,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 48 [2025-03-04 15:08:13,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:14,024 INFO L124 PetriNetUnfolderBase]: 3141/6608 cut-off events. [2025-03-04 15:08:14,025 INFO L125 PetriNetUnfolderBase]: For 12128/12358 co-relation queries the response was YES. [2025-03-04 15:08:14,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19322 conditions, 6608 events. 3141/6608 cut-off events. For 12128/12358 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 46702 event pairs, 788 based on Foata normal form. 90/6667 useless extension candidates. Maximal degree in co-relation 15679. Up to 2350 conditions per place. [2025-03-04 15:08:14,052 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 173 selfloop transitions, 20 changer transitions 0/207 dead transitions. [2025-03-04 15:08:14,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 207 transitions, 1464 flow [2025-03-04 15:08:14,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 15:08:14,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 15:08:14,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 335 transitions. [2025-03-04 15:08:14,056 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.634469696969697 [2025-03-04 15:08:14,056 INFO L175 Difference]: Start difference. First operand has 83 places, 66 transitions, 396 flow. Second operand 11 states and 335 transitions. [2025-03-04 15:08:14,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 207 transitions, 1464 flow [2025-03-04 15:08:14,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 207 transitions, 1366 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:08:14,074 INFO L231 Difference]: Finished difference. Result has 94 places, 77 transitions, 588 flow [2025-03-04 15:08:14,074 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=588, PETRI_PLACES=94, PETRI_TRANSITIONS=77} [2025-03-04 15:08:14,075 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 48 predicate places. [2025-03-04 15:08:14,075 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 77 transitions, 588 flow [2025-03-04 15:08:14,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 19.083333333333332) internal successors, (229), 12 states have internal predecessors, (229), 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:08:14,075 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:14,075 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:14,082 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 15:08:14,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:08:14,276 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:14,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:14,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1350610787, now seen corresponding path program 1 times [2025-03-04 15:08:14,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:14,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740326821] [2025-03-04 15:08:14,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:14,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:14,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 15:08:14,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 15:08:14,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:14,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:14,346 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:08:14,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:14,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740326821] [2025-03-04 15:08:14,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740326821] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:14,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:08:14,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:08:14,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329211073] [2025-03-04 15:08:14,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:14,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:08:14,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:14,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:08:14,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:08:14,357 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2025-03-04 15:08:14,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 77 transitions, 588 flow. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:14,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:14,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2025-03-04 15:08:14,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:14,978 INFO L124 PetriNetUnfolderBase]: 3469/6946 cut-off events. [2025-03-04 15:08:14,978 INFO L125 PetriNetUnfolderBase]: For 13979/14366 co-relation queries the response was YES. [2025-03-04 15:08:14,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20153 conditions, 6946 events. 3469/6946 cut-off events. For 13979/14366 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 45881 event pairs, 727 based on Foata normal form. 67/6990 useless extension candidates. Maximal degree in co-relation 17120. Up to 3973 conditions per place. [2025-03-04 15:08:15,015 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 127 selfloop transitions, 14 changer transitions 0/152 dead transitions. [2025-03-04 15:08:15,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 152 transitions, 1179 flow [2025-03-04 15:08:15,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 15:08:15,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 15:08:15,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 212 transitions. [2025-03-04 15:08:15,017 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5520833333333334 [2025-03-04 15:08:15,017 INFO L175 Difference]: Start difference. First operand has 94 places, 77 transitions, 588 flow. Second operand 8 states and 212 transitions. [2025-03-04 15:08:15,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 152 transitions, 1179 flow [2025-03-04 15:08:15,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 152 transitions, 1162 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-03-04 15:08:15,046 INFO L231 Difference]: Finished difference. Result has 102 places, 84 transitions, 689 flow [2025-03-04 15:08:15,046 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=571, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=689, PETRI_PLACES=102, PETRI_TRANSITIONS=84} [2025-03-04 15:08:15,047 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 56 predicate places. [2025-03-04 15:08:15,047 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 84 transitions, 689 flow [2025-03-04 15:08:15,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:15,047 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:15,047 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:15,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 15:08:15,048 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:15,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:15,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1434126166, now seen corresponding path program 1 times [2025-03-04 15:08:15,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:15,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346293799] [2025-03-04 15:08:15,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:15,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:15,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 15:08:15,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 15:08:15,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:15,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:15,131 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:08:15,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:15,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346293799] [2025-03-04 15:08:15,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346293799] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:15,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:08:15,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:08:15,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217987423] [2025-03-04 15:08:15,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:15,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:08:15,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:15,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:08:15,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:08:15,144 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2025-03-04 15:08:15,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 84 transitions, 689 flow. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:15,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:15,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2025-03-04 15:08:15,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:15,788 INFO L124 PetriNetUnfolderBase]: 3507/7161 cut-off events. [2025-03-04 15:08:15,788 INFO L125 PetriNetUnfolderBase]: For 14979/15265 co-relation queries the response was YES. [2025-03-04 15:08:15,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21149 conditions, 7161 events. 3507/7161 cut-off events. For 14979/15265 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 49122 event pairs, 947 based on Foata normal form. 12/7148 useless extension candidates. Maximal degree in co-relation 17965. Up to 5369 conditions per place. [2025-03-04 15:08:15,830 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 113 selfloop transitions, 8 changer transitions 0/132 dead transitions. [2025-03-04 15:08:15,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 132 transitions, 1113 flow [2025-03-04 15:08:15,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:08:15,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 15:08:15,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 177 transitions. [2025-03-04 15:08:15,831 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5267857142857143 [2025-03-04 15:08:15,831 INFO L175 Difference]: Start difference. First operand has 102 places, 84 transitions, 689 flow. Second operand 7 states and 177 transitions. [2025-03-04 15:08:15,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 132 transitions, 1113 flow [2025-03-04 15:08:15,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 132 transitions, 1096 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-03-04 15:08:15,859 INFO L231 Difference]: Finished difference. Result has 107 places, 85 transitions, 709 flow [2025-03-04 15:08:15,860 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=674, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=709, PETRI_PLACES=107, PETRI_TRANSITIONS=85} [2025-03-04 15:08:15,860 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 61 predicate places. [2025-03-04 15:08:15,860 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 85 transitions, 709 flow [2025-03-04 15:08:15,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:15,860 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:15,861 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:15,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 15:08:15,861 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:15,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:15,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1421845207, now seen corresponding path program 1 times [2025-03-04 15:08:15,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:15,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168940761] [2025-03-04 15:08:15,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:15,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:15,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 15:08:15,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 15:08:15,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:15,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:15,889 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:08:15,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:15,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168940761] [2025-03-04 15:08:15,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168940761] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:15,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:08:15,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:08:15,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506203453] [2025-03-04 15:08:15,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:15,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:08:15,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:15,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:08:15,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:08:15,893 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 48 [2025-03-04 15:08:15,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 85 transitions, 709 flow. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:15,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:15,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 48 [2025-03-04 15:08:15,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:16,486 INFO L124 PetriNetUnfolderBase]: 3533/7263 cut-off events. [2025-03-04 15:08:16,486 INFO L125 PetriNetUnfolderBase]: For 16088/16336 co-relation queries the response was YES. [2025-03-04 15:08:16,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21252 conditions, 7263 events. 3533/7263 cut-off events. For 16088/16336 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 50249 event pairs, 590 based on Foata normal form. 0/7262 useless extension candidates. Maximal degree in co-relation 18131. Up to 3403 conditions per place. [2025-03-04 15:08:16,514 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 134 selfloop transitions, 6 changer transitions 0/157 dead transitions. [2025-03-04 15:08:16,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 157 transitions, 1695 flow [2025-03-04 15:08:16,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:08:16,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:08:16,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions. [2025-03-04 15:08:16,515 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.609375 [2025-03-04 15:08:16,515 INFO L175 Difference]: Start difference. First operand has 107 places, 85 transitions, 709 flow. Second operand 4 states and 117 transitions. [2025-03-04 15:08:16,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 157 transitions, 1695 flow [2025-03-04 15:08:16,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 157 transitions, 1668 flow, removed 10 selfloop flow, removed 2 redundant places. [2025-03-04 15:08:16,541 INFO L231 Difference]: Finished difference. Result has 108 places, 85 transitions, 712 flow [2025-03-04 15:08:16,541 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=692, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=712, PETRI_PLACES=108, PETRI_TRANSITIONS=85} [2025-03-04 15:08:16,541 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 62 predicate places. [2025-03-04 15:08:16,541 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 85 transitions, 712 flow [2025-03-04 15:08:16,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:16,542 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:16,542 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:16,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 15:08:16,542 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:16,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:16,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1044717523, now seen corresponding path program 1 times [2025-03-04 15:08:16,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:16,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163059003] [2025-03-04 15:08:16,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:16,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:16,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 15:08:16,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 15:08:16,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:16,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:16,608 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:16,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:16,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163059003] [2025-03-04 15:08:16,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163059003] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:08:16,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887976748] [2025-03-04 15:08:16,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:16,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:08:16,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:08:16,610 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:08:16,612 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:08:16,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 15:08:16,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 15:08:16,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:16,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:16,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:08:16,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:08:16,714 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:16,714 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:08:16,767 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:16,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1887976748] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:08:16,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:08:16,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-03-04 15:08:16,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23713271] [2025-03-04 15:08:16,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:08:16,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 15:08:16,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:16,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 15:08:16,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 15:08:16,772 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 48 [2025-03-04 15:08:16,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 85 transitions, 712 flow. Second operand has 12 states, 12 states have (on average 18.833333333333332) internal successors, (226), 12 states have internal predecessors, (226), 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:08:16,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:16,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 48 [2025-03-04 15:08:16,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:17,884 INFO L124 PetriNetUnfolderBase]: 4337/8694 cut-off events. [2025-03-04 15:08:17,884 INFO L125 PetriNetUnfolderBase]: For 19505/19861 co-relation queries the response was YES. [2025-03-04 15:08:17,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27014 conditions, 8694 events. 4337/8694 cut-off events. For 19505/19861 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 58788 event pairs, 927 based on Foata normal form. 39/8708 useless extension candidates. Maximal degree in co-relation 23704. Up to 4364 conditions per place. [2025-03-04 15:08:17,942 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 201 selfloop transitions, 45 changer transitions 0/260 dead transitions. [2025-03-04 15:08:17,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 260 transitions, 1989 flow [2025-03-04 15:08:17,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 15:08:17,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-04 15:08:17,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 456 transitions. [2025-03-04 15:08:17,944 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5588235294117647 [2025-03-04 15:08:17,944 INFO L175 Difference]: Start difference. First operand has 108 places, 85 transitions, 712 flow. Second operand 17 states and 456 transitions. [2025-03-04 15:08:17,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 260 transitions, 1989 flow [2025-03-04 15:08:17,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 260 transitions, 1955 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:08:17,984 INFO L231 Difference]: Finished difference. Result has 126 places, 108 transitions, 1072 flow [2025-03-04 15:08:17,984 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=704, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1072, PETRI_PLACES=126, PETRI_TRANSITIONS=108} [2025-03-04 15:08:17,984 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 80 predicate places. [2025-03-04 15:08:17,984 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 108 transitions, 1072 flow [2025-03-04 15:08:17,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 18.833333333333332) internal successors, (226), 12 states have internal predecessors, (226), 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:08:17,985 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:17,985 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:17,990 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 15:08:18,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:08:18,185 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:18,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:18,186 INFO L85 PathProgramCache]: Analyzing trace with hash 779869416, now seen corresponding path program 1 times [2025-03-04 15:08:18,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:18,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116120017] [2025-03-04 15:08:18,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:18,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:18,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 15:08:18,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 15:08:18,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:18,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:18,258 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:18,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:18,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116120017] [2025-03-04 15:08:18,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116120017] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:08:18,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294489822] [2025-03-04 15:08:18,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:18,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:08:18,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:08:18,261 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:08:18,262 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:08:18,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 15:08:18,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 15:08:18,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:18,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:18,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:08:18,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:08:18,362 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:18,362 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:08:18,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294489822] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:18,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:08:18,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-03-04 15:08:18,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134602211] [2025-03-04 15:08:18,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:18,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:08:18,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:18,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:08:18,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-04 15:08:18,367 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 48 [2025-03-04 15:08:18,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 108 transitions, 1072 flow. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 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:08:18,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:18,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 48 [2025-03-04 15:08:18,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:19,171 INFO L124 PetriNetUnfolderBase]: 4901/9400 cut-off events. [2025-03-04 15:08:19,171 INFO L125 PetriNetUnfolderBase]: For 24971/25025 co-relation queries the response was YES. [2025-03-04 15:08:19,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29817 conditions, 9400 events. 4901/9400 cut-off events. For 24971/25025 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 62801 event pairs, 712 based on Foata normal form. 262/9400 useless extension candidates. Maximal degree in co-relation 28870. Up to 5331 conditions per place. [2025-03-04 15:08:19,221 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 138 selfloop transitions, 5 changer transitions 0/163 dead transitions. [2025-03-04 15:08:19,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 163 transitions, 1819 flow [2025-03-04 15:08:19,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:08:19,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:08:19,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2025-03-04 15:08:19,222 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6197916666666666 [2025-03-04 15:08:19,222 INFO L175 Difference]: Start difference. First operand has 126 places, 108 transitions, 1072 flow. Second operand 4 states and 119 transitions. [2025-03-04 15:08:19,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 163 transitions, 1819 flow [2025-03-04 15:08:19,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 163 transitions, 1699 flow, removed 52 selfloop flow, removed 4 redundant places. [2025-03-04 15:08:19,265 INFO L231 Difference]: Finished difference. Result has 124 places, 107 transitions, 1007 flow [2025-03-04 15:08:19,266 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=997, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1007, PETRI_PLACES=124, PETRI_TRANSITIONS=107} [2025-03-04 15:08:19,266 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 78 predicate places. [2025-03-04 15:08:19,266 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 107 transitions, 1007 flow [2025-03-04 15:08:19,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 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:08:19,266 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:19,266 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 15:08:19,273 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:08:19,467 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,SelfDestructingSolverStorable14 [2025-03-04 15:08:19,467 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:19,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:19,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1593851497, now seen corresponding path program 1 times [2025-03-04 15:08:19,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:19,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944437599] [2025-03-04 15:08:19,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:19,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:19,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 15:08:19,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 15:08:19,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:19,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:19,517 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:08:19,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:19,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944437599] [2025-03-04 15:08:19,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944437599] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:19,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:08:19,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:08:19,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989003067] [2025-03-04 15:08:19,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:19,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:08:19,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:19,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:08:19,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:08:19,522 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 48 [2025-03-04 15:08:19,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 107 transitions, 1007 flow. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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:08:19,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:19,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 48 [2025-03-04 15:08:19,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:20,194 INFO L124 PetriNetUnfolderBase]: 4541/9002 cut-off events. [2025-03-04 15:08:20,194 INFO L125 PetriNetUnfolderBase]: For 23394/23398 co-relation queries the response was YES. [2025-03-04 15:08:20,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28777 conditions, 9002 events. 4541/9002 cut-off events. For 23394/23398 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 60676 event pairs, 901 based on Foata normal form. 262/9238 useless extension candidates. Maximal degree in co-relation 27049. Up to 4371 conditions per place. [2025-03-04 15:08:20,237 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 153 selfloop transitions, 6 changer transitions 0/179 dead transitions. [2025-03-04 15:08:20,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 179 transitions, 1925 flow [2025-03-04 15:08:20,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:08:20,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:08:20,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2025-03-04 15:08:20,238 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6197916666666666 [2025-03-04 15:08:20,238 INFO L175 Difference]: Start difference. First operand has 124 places, 107 transitions, 1007 flow. Second operand 4 states and 119 transitions. [2025-03-04 15:08:20,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 179 transitions, 1925 flow [2025-03-04 15:08:20,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 179 transitions, 1915 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:08:20,287 INFO L231 Difference]: Finished difference. Result has 124 places, 107 transitions, 1013 flow [2025-03-04 15:08:20,287 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=993, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1013, PETRI_PLACES=124, PETRI_TRANSITIONS=107} [2025-03-04 15:08:20,287 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 78 predicate places. [2025-03-04 15:08:20,287 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 107 transitions, 1013 flow [2025-03-04 15:08:20,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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:08:20,287 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:20,287 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:20,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 15:08:20,287 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:20,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:20,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1507878101, now seen corresponding path program 1 times [2025-03-04 15:08:20,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:20,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692394140] [2025-03-04 15:08:20,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:20,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:20,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 15:08:20,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 15:08:20,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:20,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:20,365 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:08:20,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:20,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692394140] [2025-03-04 15:08:20,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692394140] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:08:20,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471819804] [2025-03-04 15:08:20,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:20,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:08:20,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:08:20,368 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:08:20,374 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:08:20,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 15:08:20,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 15:08:20,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:20,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:20,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:08:20,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:08:20,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:08:20,477 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:08:20,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1471819804] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:20,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:08:20,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 9 [2025-03-04 15:08:20,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730213811] [2025-03-04 15:08:20,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:20,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:08:20,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:20,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:08:20,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-04 15:08:20,483 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 48 [2025-03-04 15:08:20,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 107 transitions, 1013 flow. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:20,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:20,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 48 [2025-03-04 15:08:20,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:21,075 INFO L124 PetriNetUnfolderBase]: 4019/8167 cut-off events. [2025-03-04 15:08:21,075 INFO L125 PetriNetUnfolderBase]: For 23608/23608 co-relation queries the response was YES. [2025-03-04 15:08:21,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26770 conditions, 8167 events. 4019/8167 cut-off events. For 23608/23608 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 55416 event pairs, 2882 based on Foata normal form. 76/8190 useless extension candidates. Maximal degree in co-relation 25162. Up to 5989 conditions per place. [2025-03-04 15:08:21,127 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 73 selfloop transitions, 24 changer transitions 0/115 dead transitions. [2025-03-04 15:08:21,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 115 transitions, 1237 flow [2025-03-04 15:08:21,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:08:21,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:08:21,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 101 transitions. [2025-03-04 15:08:21,127 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5260416666666666 [2025-03-04 15:08:21,127 INFO L175 Difference]: Start difference. First operand has 124 places, 107 transitions, 1013 flow. Second operand 4 states and 101 transitions. [2025-03-04 15:08:21,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 115 transitions, 1237 flow [2025-03-04 15:08:21,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 115 transitions, 1213 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-03-04 15:08:21,171 INFO L231 Difference]: Finished difference. Result has 121 places, 106 transitions, 1027 flow [2025-03-04 15:08:21,171 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=979, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1027, PETRI_PLACES=121, PETRI_TRANSITIONS=106} [2025-03-04 15:08:21,172 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 75 predicate places. [2025-03-04 15:08:21,172 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 106 transitions, 1027 flow [2025-03-04 15:08:21,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:21,172 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:21,172 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:21,178 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:08:21,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 15:08:21,373 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:21,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:21,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1612448420, now seen corresponding path program 1 times [2025-03-04 15:08:21,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:21,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903928671] [2025-03-04 15:08:21,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:21,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:21,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 15:08:21,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 15:08:21,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:21,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:21,486 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:21,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:21,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903928671] [2025-03-04 15:08:21,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903928671] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:08:21,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080540050] [2025-03-04 15:08:21,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:21,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:08:21,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:08:21,490 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:08:21,491 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:08:21,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 15:08:21,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 15:08:21,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:21,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:21,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 15:08:21,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:08:21,616 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:21,617 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:08:21,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080540050] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:21,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:08:21,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2025-03-04 15:08:21,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259629919] [2025-03-04 15:08:21,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:21,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 15:08:21,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:21,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 15:08:21,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-04 15:08:21,630 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2025-03-04 15:08:21,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 106 transitions, 1027 flow. Second operand has 8 states, 8 states have (on average 17.0) internal successors, (136), 8 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:21,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:21,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2025-03-04 15:08:21,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:22,472 INFO L124 PetriNetUnfolderBase]: 4670/9095 cut-off events. [2025-03-04 15:08:22,472 INFO L125 PetriNetUnfolderBase]: For 26349/26349 co-relation queries the response was YES. [2025-03-04 15:08:22,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29418 conditions, 9095 events. 4670/9095 cut-off events. For 26349/26349 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 59956 event pairs, 908 based on Foata normal form. 63/9125 useless extension candidates. Maximal degree in co-relation 27915. Up to 2687 conditions per place. [2025-03-04 15:08:22,526 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 179 selfloop transitions, 41 changer transitions 0/231 dead transitions. [2025-03-04 15:08:22,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 231 transitions, 2070 flow [2025-03-04 15:08:22,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 15:08:22,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 15:08:22,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 311 transitions. [2025-03-04 15:08:22,528 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5399305555555556 [2025-03-04 15:08:22,528 INFO L175 Difference]: Start difference. First operand has 121 places, 106 transitions, 1027 flow. Second operand 12 states and 311 transitions. [2025-03-04 15:08:22,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 231 transitions, 2070 flow [2025-03-04 15:08:22,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 231 transitions, 2012 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-03-04 15:08:22,573 INFO L231 Difference]: Finished difference. Result has 132 places, 118 transitions, 1242 flow [2025-03-04 15:08:22,573 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=977, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1242, PETRI_PLACES=132, PETRI_TRANSITIONS=118} [2025-03-04 15:08:22,574 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 86 predicate places. [2025-03-04 15:08:22,574 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 118 transitions, 1242 flow [2025-03-04 15:08:22,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.0) internal successors, (136), 8 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:22,574 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:22,574 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:22,580 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:08:22,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:08:22,775 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:22,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:22,776 INFO L85 PathProgramCache]: Analyzing trace with hash 2035566679, now seen corresponding path program 1 times [2025-03-04 15:08:22,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:22,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098585584] [2025-03-04 15:08:22,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:22,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:22,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 15:08:22,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 15:08:22,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:22,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:22,858 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:22,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:22,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098585584] [2025-03-04 15:08:22,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098585584] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:08:22,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307448773] [2025-03-04 15:08:22,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:22,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:08:22,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:08:22,860 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:08:22,861 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:08:22,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 15:08:22,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 15:08:22,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:22,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:22,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 15:08:22,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:08:22,976 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:22,976 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:08:23,049 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:23,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307448773] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:08:23,049 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:08:23,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2025-03-04 15:08:23,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19515423] [2025-03-04 15:08:23,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:08:23,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 15:08:23,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:23,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 15:08:23,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-03-04 15:08:23,065 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2025-03-04 15:08:23,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 118 transitions, 1242 flow. Second operand has 14 states, 14 states have (on average 17.285714285714285) internal successors, (242), 14 states have internal predecessors, (242), 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:08:23,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:23,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2025-03-04 15:08:23,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:24,277 INFO L124 PetriNetUnfolderBase]: 6445/12245 cut-off events. [2025-03-04 15:08:24,277 INFO L125 PetriNetUnfolderBase]: For 36038/36038 co-relation queries the response was YES. [2025-03-04 15:08:24,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40236 conditions, 12245 events. 6445/12245 cut-off events. For 36038/36038 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 84568 event pairs, 978 based on Foata normal form. 93/12301 useless extension candidates. Maximal degree in co-relation 38919. Up to 3478 conditions per place. [2025-03-04 15:08:24,364 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 267 selfloop transitions, 98 changer transitions 0/374 dead transitions. [2025-03-04 15:08:24,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 374 transitions, 3333 flow [2025-03-04 15:08:24,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-04 15:08:24,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-03-04 15:08:24,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 567 transitions. [2025-03-04 15:08:24,366 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4725 [2025-03-04 15:08:24,366 INFO L175 Difference]: Start difference. First operand has 132 places, 118 transitions, 1242 flow. Second operand 25 states and 567 transitions. [2025-03-04 15:08:24,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 374 transitions, 3333 flow [2025-03-04 15:08:24,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 374 transitions, 3290 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-03-04 15:08:24,438 INFO L231 Difference]: Finished difference. Result has 158 places, 157 transitions, 1944 flow [2025-03-04 15:08:24,438 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1208, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=1944, PETRI_PLACES=158, PETRI_TRANSITIONS=157} [2025-03-04 15:08:24,438 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 112 predicate places. [2025-03-04 15:08:24,438 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 157 transitions, 1944 flow [2025-03-04 15:08:24,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 17.285714285714285) internal successors, (242), 14 states have internal predecessors, (242), 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:08:24,439 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:24,439 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:24,445 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:08:24,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:08:24,639 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:24,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:24,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1004436461, now seen corresponding path program 1 times [2025-03-04 15:08:24,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:24,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461143998] [2025-03-04 15:08:24,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:24,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:24,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 15:08:24,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 15:08:24,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:24,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:24,722 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:24,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:24,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461143998] [2025-03-04 15:08:24,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461143998] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:08:24,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491834933] [2025-03-04 15:08:24,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:24,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:08:24,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:08:24,725 INFO L229 MonitoredProcess]: Starting monitored process 10 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:08:24,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 15:08:24,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 15:08:24,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 15:08:24,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:24,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:24,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 15:08:24,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:08:24,843 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:24,843 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:08:24,907 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:24,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491834933] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:08:24,907 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:08:24,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-03-04 15:08:24,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508974442] [2025-03-04 15:08:24,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:08:24,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 15:08:24,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:24,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 15:08:24,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2025-03-04 15:08:24,935 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2025-03-04 15:08:24,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 157 transitions, 1944 flow. Second operand has 16 states, 16 states have (on average 17.625) internal successors, (282), 16 states have internal predecessors, (282), 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:08:24,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:24,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2025-03-04 15:08:24,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:26,549 INFO L124 PetriNetUnfolderBase]: 7531/14748 cut-off events. [2025-03-04 15:08:26,549 INFO L125 PetriNetUnfolderBase]: For 57441/57441 co-relation queries the response was YES. [2025-03-04 15:08:26,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48302 conditions, 14748 events. 7531/14748 cut-off events. For 57441/57441 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 107154 event pairs, 1611 based on Foata normal form. 547/15254 useless extension candidates. Maximal degree in co-relation 46684. Up to 4101 conditions per place. [2025-03-04 15:08:26,629 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 200 selfloop transitions, 135 changer transitions 0/348 dead transitions. [2025-03-04 15:08:26,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 348 transitions, 3631 flow [2025-03-04 15:08:26,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 15:08:26,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-04 15:08:26,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 447 transitions. [2025-03-04 15:08:26,630 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5173611111111112 [2025-03-04 15:08:26,630 INFO L175 Difference]: Start difference. First operand has 158 places, 157 transitions, 1944 flow. Second operand 18 states and 447 transitions. [2025-03-04 15:08:26,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 348 transitions, 3631 flow [2025-03-04 15:08:26,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 348 transitions, 3325 flow, removed 117 selfloop flow, removed 7 redundant places. [2025-03-04 15:08:26,737 INFO L231 Difference]: Finished difference. Result has 159 places, 185 transitions, 2336 flow [2025-03-04 15:08:26,737 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1588, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2336, PETRI_PLACES=159, PETRI_TRANSITIONS=185} [2025-03-04 15:08:26,737 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 113 predicate places. [2025-03-04 15:08:26,737 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 185 transitions, 2336 flow [2025-03-04 15:08:26,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 17.625) internal successors, (282), 16 states have internal predecessors, (282), 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:08:26,738 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:26,738 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:26,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 15:08:26,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:08:26,939 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:26,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:26,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1953025358, now seen corresponding path program 1 times [2025-03-04 15:08:26,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:26,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285580014] [2025-03-04 15:08:26,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:26,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:26,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 15:08:26,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 15:08:26,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:26,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:27,068 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:27,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:27,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285580014] [2025-03-04 15:08:27,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285580014] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:08:27,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496241961] [2025-03-04 15:08:27,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:27,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:08:27,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:08:27,071 INFO L229 MonitoredProcess]: Starting monitored process 11 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:08:27,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 15:08:27,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 15:08:27,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 15:08:27,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:27,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:27,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 15:08:27,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:08:27,219 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:27,220 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:08:27,311 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:27,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496241961] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:08:27,311 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:08:27,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 16 [2025-03-04 15:08:27,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897485068] [2025-03-04 15:08:27,311 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:08:27,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 15:08:27,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:27,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 15:08:27,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2025-03-04 15:08:27,352 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2025-03-04 15:08:27,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 185 transitions, 2336 flow. Second operand has 18 states, 18 states have (on average 18.11111111111111) internal successors, (326), 18 states have internal predecessors, (326), 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:08:27,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:27,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2025-03-04 15:08:27,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:29,970 INFO L124 PetriNetUnfolderBase]: 12002/23461 cut-off events. [2025-03-04 15:08:29,970 INFO L125 PetriNetUnfolderBase]: For 76523/76523 co-relation queries the response was YES. [2025-03-04 15:08:30,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76896 conditions, 23461 events. 12002/23461 cut-off events. For 76523/76523 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 181374 event pairs, 2065 based on Foata normal form. 242/23638 useless extension candidates. Maximal degree in co-relation 74359. Up to 5548 conditions per place. [2025-03-04 15:08:30,124 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 350 selfloop transitions, 199 changer transitions 0/562 dead transitions. [2025-03-04 15:08:30,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 562 transitions, 6110 flow [2025-03-04 15:08:30,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-04 15:08:30,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-03-04 15:08:30,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 673 transitions. [2025-03-04 15:08:30,126 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5192901234567902 [2025-03-04 15:08:30,126 INFO L175 Difference]: Start difference. First operand has 159 places, 185 transitions, 2336 flow. Second operand 27 states and 673 transitions. [2025-03-04 15:08:30,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 562 transitions, 6110 flow [2025-03-04 15:08:30,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 562 transitions, 5710 flow, removed 162 selfloop flow, removed 8 redundant places. [2025-03-04 15:08:30,337 INFO L231 Difference]: Finished difference. Result has 187 places, 292 transitions, 4314 flow [2025-03-04 15:08:30,337 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=2138, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=111, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=4314, PETRI_PLACES=187, PETRI_TRANSITIONS=292} [2025-03-04 15:08:30,337 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 141 predicate places. [2025-03-04 15:08:30,337 INFO L471 AbstractCegarLoop]: Abstraction has has 187 places, 292 transitions, 4314 flow [2025-03-04 15:08:30,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 18.11111111111111) internal successors, (326), 18 states have internal predecessors, (326), 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:08:30,338 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:30,338 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:30,345 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 15:08:30,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-04 15:08:30,538 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:30,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:30,539 INFO L85 PathProgramCache]: Analyzing trace with hash -991226511, now seen corresponding path program 2 times [2025-03-04 15:08:30,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:30,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239599528] [2025-03-04 15:08:30,539 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:08:30,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:30,547 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-03-04 15:08:30,550 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 32 of 56 statements. [2025-03-04 15:08:30,551 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:08:30,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:30,724 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 15:08:30,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:30,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239599528] [2025-03-04 15:08:30,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239599528] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:30,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:08:30,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 15:08:30,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048366377] [2025-03-04 15:08:30,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:30,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:08:30,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:30,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:08:30,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:08:30,732 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2025-03-04 15:08:30,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 292 transitions, 4314 flow. Second operand has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 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:08:30,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:30,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2025-03-04 15:08:30,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:33,704 INFO L124 PetriNetUnfolderBase]: 13531/25997 cut-off events. [2025-03-04 15:08:33,704 INFO L125 PetriNetUnfolderBase]: For 90420/90430 co-relation queries the response was YES. [2025-03-04 15:08:33,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87002 conditions, 25997 events. 13531/25997 cut-off events. For 90420/90430 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 202720 event pairs, 5918 based on Foata normal form. 67/25891 useless extension candidates. Maximal degree in co-relation 85087. Up to 11818 conditions per place. [2025-03-04 15:08:33,907 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 143 selfloop transitions, 213 changer transitions 0/365 dead transitions. [2025-03-04 15:08:33,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 365 transitions, 5537 flow [2025-03-04 15:08:33,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 15:08:33,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 15:08:33,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 182 transitions. [2025-03-04 15:08:33,908 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4739583333333333 [2025-03-04 15:08:33,908 INFO L175 Difference]: Start difference. First operand has 187 places, 292 transitions, 4314 flow. Second operand 8 states and 182 transitions. [2025-03-04 15:08:33,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 365 transitions, 5537 flow [2025-03-04 15:08:34,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 365 transitions, 5486 flow, removed 22 selfloop flow, removed 3 redundant places. [2025-03-04 15:08:34,234 INFO L231 Difference]: Finished difference. Result has 191 places, 311 transitions, 5220 flow [2025-03-04 15:08:34,234 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=4163, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=190, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5220, PETRI_PLACES=191, PETRI_TRANSITIONS=311} [2025-03-04 15:08:34,234 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 145 predicate places. [2025-03-04 15:08:34,234 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 311 transitions, 5220 flow [2025-03-04 15:08:34,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 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:08:34,234 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:34,234 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:34,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 15:08:34,234 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:34,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:34,235 INFO L85 PathProgramCache]: Analyzing trace with hash 187608425, now seen corresponding path program 3 times [2025-03-04 15:08:34,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:34,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289372595] [2025-03-04 15:08:34,235 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:08:34,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:34,245 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 3 equivalence classes. [2025-03-04 15:08:34,249 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 32 of 56 statements. [2025-03-04 15:08:34,249 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 15:08:34,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:34,302 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 15:08:34,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:34,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289372595] [2025-03-04 15:08:34,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289372595] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:34,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:08:34,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:08:34,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749609921] [2025-03-04 15:08:34,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:34,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:08:34,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:34,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:08:34,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:08:34,305 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2025-03-04 15:08:34,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 311 transitions, 5220 flow. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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:08:34,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:34,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2025-03-04 15:08:34,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:36,599 INFO L124 PetriNetUnfolderBase]: 9132/18075 cut-off events. [2025-03-04 15:08:36,599 INFO L125 PetriNetUnfolderBase]: For 88927/88927 co-relation queries the response was YES. [2025-03-04 15:08:36,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64666 conditions, 18075 events. 9132/18075 cut-off events. For 88927/88927 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 134200 event pairs, 3861 based on Foata normal form. 8/18028 useless extension candidates. Maximal degree in co-relation 64613. Up to 14819 conditions per place. [2025-03-04 15:08:36,711 INFO L140 encePairwiseOnDemand]: 45/48 looper letters, 222 selfloop transitions, 2 changer transitions 0/250 dead transitions. [2025-03-04 15:08:36,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 250 transitions, 4408 flow [2025-03-04 15:08:36,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:08:36,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:08:36,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2025-03-04 15:08:36,712 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6736111111111112 [2025-03-04 15:08:36,712 INFO L175 Difference]: Start difference. First operand has 191 places, 311 transitions, 5220 flow. Second operand 3 states and 97 transitions. [2025-03-04 15:08:36,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 250 transitions, 4408 flow [2025-03-04 15:08:36,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 250 transitions, 4176 flow, removed 60 selfloop flow, removed 12 redundant places. [2025-03-04 15:08:36,912 INFO L231 Difference]: Finished difference. Result has 173 places, 237 transitions, 3687 flow [2025-03-04 15:08:36,913 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=3675, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3687, PETRI_PLACES=173, PETRI_TRANSITIONS=237} [2025-03-04 15:08:36,913 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 127 predicate places. [2025-03-04 15:08:36,913 INFO L471 AbstractCegarLoop]: Abstraction has has 173 places, 237 transitions, 3687 flow [2025-03-04 15:08:36,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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:08:36,913 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:36,913 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2025-03-04 15:08:36,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 15:08:36,914 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:36,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:36,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1305571810, now seen corresponding path program 2 times [2025-03-04 15:08:36,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:36,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262913388] [2025-03-04 15:08:36,914 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:08:36,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:36,923 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 64 statements into 2 equivalence classes. [2025-03-04 15:08:36,935 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 64 of 64 statements. [2025-03-04 15:08:36,936 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:08:36,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:37,140 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:37,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:37,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262913388] [2025-03-04 15:08:37,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262913388] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:08:37,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705055812] [2025-03-04 15:08:37,141 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:08:37,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:08:37,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:08:37,144 INFO L229 MonitoredProcess]: Starting monitored process 12 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:08:37,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 15:08:37,211 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 64 statements into 2 equivalence classes. [2025-03-04 15:08:37,249 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 64 of 64 statements. [2025-03-04 15:08:37,250 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:08:37,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:37,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 15:08:37,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:08:37,323 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:37,323 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:08:37,509 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:37,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1705055812] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:08:37,510 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:08:37,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 26 [2025-03-04 15:08:37,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59750384] [2025-03-04 15:08:37,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:08:37,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-04 15:08:37,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:37,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-04 15:08:37,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=547, Unknown=0, NotChecked=0, Total=756 [2025-03-04 15:08:37,532 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 48 [2025-03-04 15:08:37,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 237 transitions, 3687 flow. Second operand has 28 states, 28 states have (on average 19.607142857142858) internal successors, (549), 28 states have internal predecessors, (549), 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:08:37,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:37,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 48 [2025-03-04 15:08:37,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:40,198 INFO L124 PetriNetUnfolderBase]: 9834/19326 cut-off events. [2025-03-04 15:08:40,199 INFO L125 PetriNetUnfolderBase]: For 87483/87483 co-relation queries the response was YES. [2025-03-04 15:08:40,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68538 conditions, 19326 events. 9834/19326 cut-off events. For 87483/87483 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 141870 event pairs, 3541 based on Foata normal form. 54/19317 useless extension candidates. Maximal degree in co-relation 68489. Up to 11201 conditions per place. [2025-03-04 15:08:40,377 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 330 selfloop transitions, 49 changer transitions 11/409 dead transitions. [2025-03-04 15:08:40,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 409 transitions, 5301 flow [2025-03-04 15:08:40,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 15:08:40,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 15:08:40,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 405 transitions. [2025-03-04 15:08:40,378 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6490384615384616 [2025-03-04 15:08:40,378 INFO L175 Difference]: Start difference. First operand has 173 places, 237 transitions, 3687 flow. Second operand 13 states and 405 transitions. [2025-03-04 15:08:40,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 409 transitions, 5301 flow [2025-03-04 15:08:40,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 409 transitions, 5269 flow, removed 9 selfloop flow, removed 5 redundant places. [2025-03-04 15:08:40,624 INFO L231 Difference]: Finished difference. Result has 182 places, 241 transitions, 3871 flow [2025-03-04 15:08:40,624 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=3643, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3871, PETRI_PLACES=182, PETRI_TRANSITIONS=241} [2025-03-04 15:08:40,625 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 136 predicate places. [2025-03-04 15:08:40,625 INFO L471 AbstractCegarLoop]: Abstraction has has 182 places, 241 transitions, 3871 flow [2025-03-04 15:08:40,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 19.607142857142858) internal successors, (549), 28 states have internal predecessors, (549), 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:08:40,625 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:40,625 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:40,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-04 15:08:40,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-04 15:08:40,830 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:40,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:40,831 INFO L85 PathProgramCache]: Analyzing trace with hash -967996526, now seen corresponding path program 2 times [2025-03-04 15:08:40,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:40,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30224452] [2025-03-04 15:08:40,831 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:08:40,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:40,843 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 65 statements into 2 equivalence classes. [2025-03-04 15:08:40,883 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 15:08:40,883 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:08:40,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:41,265 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:41,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:41,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30224452] [2025-03-04 15:08:41,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30224452] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:08:41,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393211246] [2025-03-04 15:08:41,265 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:08:41,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:08:41,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:08:41,267 INFO L229 MonitoredProcess]: Starting monitored process 13 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:08:41,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 15:08:41,334 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 65 statements into 2 equivalence classes. [2025-03-04 15:08:41,378 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 15:08:41,379 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:08:41,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:41,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 15:08:41,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:08:41,446 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:41,447 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:08:41,579 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:41,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1393211246] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:08:41,580 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:08:41,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 20 [2025-03-04 15:08:41,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024180200] [2025-03-04 15:08:41,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:08:41,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 15:08:41,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:41,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 15:08:41,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2025-03-04 15:08:41,605 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2025-03-04 15:08:41,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 241 transitions, 3871 flow. Second operand has 22 states, 22 states have (on average 18.09090909090909) internal successors, (398), 22 states have internal predecessors, (398), 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:08:41,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:41,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2025-03-04 15:08:41,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:46,032 INFO L124 PetriNetUnfolderBase]: 16535/32245 cut-off events. [2025-03-04 15:08:46,032 INFO L125 PetriNetUnfolderBase]: For 153468/153468 co-relation queries the response was YES. [2025-03-04 15:08:46,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114199 conditions, 32245 events. 16535/32245 cut-off events. For 153468/153468 co-relation queries the response was YES. Maximal size of possible extension queue 427. Compared 252532 event pairs, 2849 based on Foata normal form. 276/32428 useless extension candidates. Maximal degree in co-relation 114152. Up to 6214 conditions per place. [2025-03-04 15:08:46,283 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 405 selfloop transitions, 284 changer transitions 2/706 dead transitions. [2025-03-04 15:08:46,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 706 transitions, 9164 flow [2025-03-04 15:08:46,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-04 15:08:46,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-03-04 15:08:46,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 735 transitions. [2025-03-04 15:08:46,285 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.546875 [2025-03-04 15:08:46,285 INFO L175 Difference]: Start difference. First operand has 182 places, 241 transitions, 3871 flow. Second operand 28 states and 735 transitions. [2025-03-04 15:08:46,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 706 transitions, 9164 flow [2025-03-04 15:08:46,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 706 transitions, 8870 flow, removed 0 selfloop flow, removed 10 redundant places. [2025-03-04 15:08:46,696 INFO L231 Difference]: Finished difference. Result has 210 places, 392 transitions, 7248 flow [2025-03-04 15:08:46,696 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=3664, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=153, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=7248, PETRI_PLACES=210, PETRI_TRANSITIONS=392} [2025-03-04 15:08:46,697 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 164 predicate places. [2025-03-04 15:08:46,697 INFO L471 AbstractCegarLoop]: Abstraction has has 210 places, 392 transitions, 7248 flow [2025-03-04 15:08:46,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 18.09090909090909) internal successors, (398), 22 states have internal predecessors, (398), 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:08:46,697 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:46,697 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:46,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-04 15:08:46,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-04 15:08:46,898 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:46,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:46,899 INFO L85 PathProgramCache]: Analyzing trace with hash -550366714, now seen corresponding path program 4 times [2025-03-04 15:08:46,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:46,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418146178] [2025-03-04 15:08:46,899 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:08:46,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:46,909 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 68 statements into 2 equivalence classes. [2025-03-04 15:08:46,919 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 68 of 68 statements. [2025-03-04 15:08:46,919 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:08:46,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:47,147 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:47,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:47,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418146178] [2025-03-04 15:08:47,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418146178] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:08:47,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386987805] [2025-03-04 15:08:47,148 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:08:47,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:08:47,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:08:47,150 INFO L229 MonitoredProcess]: Starting monitored process 14 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:08:47,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 15:08:47,225 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 68 statements into 2 equivalence classes. [2025-03-04 15:08:47,262 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 68 of 68 statements. [2025-03-04 15:08:47,262 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:08:47,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:47,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 15:08:47,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:08:47,337 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:47,337 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:08:47,504 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:47,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [386987805] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:08:47,504 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:08:47,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 24 [2025-03-04 15:08:47,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940812981] [2025-03-04 15:08:47,504 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:08:47,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 15:08:47,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:47,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 15:08:47,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650 [2025-03-04 15:08:47,519 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2025-03-04 15:08:47,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 392 transitions, 7248 flow. Second operand has 26 states, 26 states have (on average 17.384615384615383) internal successors, (452), 26 states have internal predecessors, (452), 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:08:47,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:47,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2025-03-04 15:08:47,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:55,697 INFO L124 PetriNetUnfolderBase]: 26773/50601 cut-off events. [2025-03-04 15:08:55,697 INFO L125 PetriNetUnfolderBase]: For 251241/251241 co-relation queries the response was YES. [2025-03-04 15:08:56,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183334 conditions, 50601 events. 26773/50601 cut-off events. For 251241/251241 co-relation queries the response was YES. Maximal size of possible extension queue 538. Compared 408607 event pairs, 4902 based on Foata normal form. 324/50786 useless extension candidates. Maximal degree in co-relation 183277. Up to 11465 conditions per place. [2025-03-04 15:08:56,128 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 479 selfloop transitions, 498 changer transitions 2/988 dead transitions. [2025-03-04 15:08:56,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 988 transitions, 15242 flow [2025-03-04 15:08:56,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-03-04 15:08:56,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2025-03-04 15:08:56,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 936 transitions. [2025-03-04 15:08:56,130 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47560975609756095 [2025-03-04 15:08:56,130 INFO L175 Difference]: Start difference. First operand has 210 places, 392 transitions, 7248 flow. Second operand 41 states and 936 transitions. [2025-03-04 15:08:56,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 988 transitions, 15242 flow [2025-03-04 15:08:57,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 988 transitions, 15046 flow, removed 93 selfloop flow, removed 4 redundant places. [2025-03-04 15:08:57,150 INFO L231 Difference]: Finished difference. Result has 257 places, 615 transitions, 12958 flow [2025-03-04 15:08:57,151 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=7098, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=392, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=287, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=41, PETRI_FLOW=12958, PETRI_PLACES=257, PETRI_TRANSITIONS=615} [2025-03-04 15:08:57,151 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 211 predicate places. [2025-03-04 15:08:57,151 INFO L471 AbstractCegarLoop]: Abstraction has has 257 places, 615 transitions, 12958 flow [2025-03-04 15:08:57,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 17.384615384615383) internal successors, (452), 26 states have internal predecessors, (452), 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:08:57,152 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:57,152 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:57,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-04 15:08:57,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-04 15:08:57,352 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:57,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:57,353 INFO L85 PathProgramCache]: Analyzing trace with hash 56662911, now seen corresponding path program 1 times [2025-03-04 15:08:57,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:57,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574003514] [2025-03-04 15:08:57,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:57,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:57,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-04 15:08:57,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 15:08:57,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:57,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:57,520 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:08:57,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:57,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574003514] [2025-03-04 15:08:57,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574003514] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:08:57,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83136827] [2025-03-04 15:08:57,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:57,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:08:57,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:08:57,523 INFO L229 MonitoredProcess]: Starting monitored process 15 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:08:57,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 15:08:57,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-04 15:08:57,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 15:08:57,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:57,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:57,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 15:08:57,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:08:57,756 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:08:57,757 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:08:57,884 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:08:57,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [83136827] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:08:57,884 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:08:57,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-03-04 15:08:57,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950201994] [2025-03-04 15:08:57,884 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:08:57,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 15:08:57,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:57,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 15:08:57,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2025-03-04 15:08:57,907 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2025-03-04 15:08:57,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 615 transitions, 12958 flow. Second operand has 22 states, 22 states have (on average 18.545454545454547) internal successors, (408), 22 states have internal predecessors, (408), 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:08:57,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:57,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2025-03-04 15:08:57,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand