./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/pthread-ext/09_fmaxsym.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-ext/09_fmaxsym.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2ce2a912f26c96a7a9e9698d6a341c03f1dcacccb179d06c2396dd9f137bcbd1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 13:54:04,628 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 13:54:04,683 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-08 13:54:04,688 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 13:54:04,688 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 13:54:04,708 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 13:54:04,709 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 13:54:04,710 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 13:54:04,710 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 13:54:04,711 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 13:54:04,711 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 13:54:04,711 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 13:54:04,712 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 13:54:04,712 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 13:54:04,712 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 13:54:04,712 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 13:54:04,712 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 13:54:04,712 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 13:54:04,712 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 13:54:04,712 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 13:54:04,712 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 13:54:04,712 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 13:54:04,712 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 13:54:04,712 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 13:54:04,713 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 13:54:04,713 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 13:54:04,713 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 13:54:04,713 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 13:54:04,713 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 13:54:04,713 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 13:54:04,713 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 13:54:04,713 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 13:54:04,713 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 13:54:04,713 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 13:54:04,713 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:54:04,713 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 13:54:04,713 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 13:54:04,714 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 13:54:04,715 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 13:54:04,715 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 13:54:04,715 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 13:54:04,715 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 13:54:04,715 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 13:54:04,715 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 13:54:04,715 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 13:54:04,715 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> 2ce2a912f26c96a7a9e9698d6a341c03f1dcacccb179d06c2396dd9f137bcbd1 [2025-02-08 13:54:04,999 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 13:54:05,009 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 13:54:05,011 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 13:54:05,013 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 13:54:05,014 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 13:54:05,015 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/09_fmaxsym.i [2025-02-08 13:54:06,304 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b7cb760a7/d911b4b5b0694530b7901c140f44c097/FLAG31f6d5210 [2025-02-08 13:54:06,685 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 13:54:06,685 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/09_fmaxsym.i [2025-02-08 13:54:06,695 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b7cb760a7/d911b4b5b0694530b7901c140f44c097/FLAG31f6d5210 [2025-02-08 13:54:06,710 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b7cb760a7/d911b4b5b0694530b7901c140f44c097 [2025-02-08 13:54:06,714 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 13:54:06,716 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 13:54:06,717 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 13:54:06,717 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 13:54:06,721 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 13:54:06,721 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:54:06" (1/1) ... [2025-02-08 13:54:06,722 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49f549d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:06, skipping insertion in model container [2025-02-08 13:54:06,722 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:54:06" (1/1) ... [2025-02-08 13:54:06,754 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 13:54:07,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:54:07,084 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 13:54:07,137 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:54:07,169 INFO L204 MainTranslator]: Completed translation [2025-02-08 13:54:07,170 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:07 WrapperNode [2025-02-08 13:54:07,170 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 13:54:07,171 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 13:54:07,171 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 13:54:07,171 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 13:54:07,176 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:07" (1/1) ... [2025-02-08 13:54:07,191 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:07" (1/1) ... [2025-02-08 13:54:07,211 INFO L138 Inliner]: procedures = 164, calls = 29, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 92 [2025-02-08 13:54:07,212 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 13:54:07,212 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 13:54:07,212 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 13:54:07,213 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 13:54:07,220 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:07" (1/1) ... [2025-02-08 13:54:07,220 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:07" (1/1) ... [2025-02-08 13:54:07,222 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:07" (1/1) ... [2025-02-08 13:54:07,231 INFO L175 MemorySlicer]: Split 15 memory accesses to 3 slices as follows [2, 5, 8]. 53 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 5, 6]. The 1 writes are split as follows [0, 0, 1]. [2025-02-08 13:54:07,231 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:07" (1/1) ... [2025-02-08 13:54:07,232 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:07" (1/1) ... [2025-02-08 13:54:07,237 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:07" (1/1) ... [2025-02-08 13:54:07,237 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:07" (1/1) ... [2025-02-08 13:54:07,238 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:07" (1/1) ... [2025-02-08 13:54:07,239 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:07" (1/1) ... [2025-02-08 13:54:07,241 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 13:54:07,242 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 13:54:07,245 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 13:54:07,246 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 13:54:07,246 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:07" (1/1) ... [2025-02-08 13:54:07,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:54:07,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:54:07,279 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 13:54:07,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 13:54:07,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 13:54:07,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 13:54:07,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 13:54:07,301 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-02-08 13:54:07,301 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-02-08 13:54:07,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 13:54:07,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 13:54:07,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 13:54:07,301 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 13:54:07,301 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 13:54:07,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 13:54:07,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 13:54:07,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 13:54:07,301 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 13:54:07,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 13:54:07,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 13:54:07,302 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 13:54:07,398 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 13:54:07,400 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 13:54:07,566 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 13:54:07,567 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 13:54:07,719 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 13:54:07,719 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 13:54:07,721 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:54:07 BoogieIcfgContainer [2025-02-08 13:54:07,722 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 13:54:07,725 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 13:54:07,725 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 13:54:07,729 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 13:54:07,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:54:06" (1/3) ... [2025-02-08 13:54:07,730 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cbeeaed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:54:07, skipping insertion in model container [2025-02-08 13:54:07,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:07" (2/3) ... [2025-02-08 13:54:07,731 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cbeeaed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:54:07, skipping insertion in model container [2025-02-08 13:54:07,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:54:07" (3/3) ... [2025-02-08 13:54:07,732 INFO L128 eAbstractionObserver]: Analyzing ICFG 09_fmaxsym.i [2025-02-08 13:54:07,745 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 13:54:07,747 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09_fmaxsym.i that has 2 procedures, 31 locations, 1 initial locations, 3 loop locations, and 6 error locations. [2025-02-08 13:54:07,747 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 13:54:07,798 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 13:54:07,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 34 transitions, 72 flow [2025-02-08 13:54:07,859 INFO L124 PetriNetUnfolderBase]: 3/36 cut-off events. [2025-02-08 13:54:07,864 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 13:54:07,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 36 events. 3/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 47 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2025-02-08 13:54:07,869 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 34 transitions, 72 flow [2025-02-08 13:54:07,873 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 34 transitions, 72 flow [2025-02-08 13:54:07,885 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 13:54:07,898 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;@7caa575e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 13:54:07,899 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-02-08 13:54:07,903 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 13:54:07,904 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-02-08 13:54:07,904 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 13:54:07,904 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:07,906 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 13:54:07,906 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-02-08 13:54:07,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:07,912 INFO L85 PathProgramCache]: Analyzing trace with hash 244415, now seen corresponding path program 1 times [2025-02-08 13:54:07,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:07,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168221896] [2025-02-08 13:54:07,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:07,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:08,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 13:54:08,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 13:54:08,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:08,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:08,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:08,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:54:08,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168221896] [2025-02-08 13:54:08,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168221896] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:54:08,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:54:08,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:54:08,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982812503] [2025-02-08 13:54:08,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:54:08,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:54:08,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:54:08,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:54:08,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:54:08,272 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 34 [2025-02-08 13:54:08,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 34 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:54:08,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:54:08,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 34 [2025-02-08 13:54:08,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:54:08,399 INFO L124 PetriNetUnfolderBase]: 24/89 cut-off events. [2025-02-08 13:54:08,400 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 13:54:08,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 89 events. 24/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 183 event pairs, 20 based on Foata normal form. 4/82 useless extension candidates. Maximal degree in co-relation 128. Up to 64 conditions per place. [2025-02-08 13:54:08,403 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 19 selfloop transitions, 3 changer transitions 0/34 dead transitions. [2025-02-08 13:54:08,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 34 transitions, 116 flow [2025-02-08 13:54:08,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:54:08,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 13:54:08,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2025-02-08 13:54:08,419 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5514705882352942 [2025-02-08 13:54:08,420 INFO L175 Difference]: Start difference. First operand has 34 places, 34 transitions, 72 flow. Second operand 4 states and 75 transitions. [2025-02-08 13:54:08,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 34 transitions, 116 flow [2025-02-08 13:54:08,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 34 transitions, 116 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 13:54:08,428 INFO L231 Difference]: Finished difference. Result has 38 places, 34 transitions, 92 flow [2025-02-08 13:54:08,431 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=92, PETRI_PLACES=38, PETRI_TRANSITIONS=34} [2025-02-08 13:54:08,435 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 4 predicate places. [2025-02-08 13:54:08,436 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 34 transitions, 92 flow [2025-02-08 13:54:08,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:54:08,436 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:08,436 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-02-08 13:54:08,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 13:54:08,437 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-02-08 13:54:08,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:08,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1308374806, now seen corresponding path program 1 times [2025-02-08 13:54:08,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:08,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604219941] [2025-02-08 13:54:08,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:08,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:08,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:54:08,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:54:08,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:08,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:08,615 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:08,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:54:08,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604219941] [2025-02-08 13:54:08,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604219941] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:54:08,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115100845] [2025-02-08 13:54:08,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:08,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:54:08,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:54:08,620 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:54:08,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 13:54:08,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:54:08,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:54:08,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:08,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:08,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 13:54:08,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:54:08,738 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:08,738 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:54:08,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2115100845] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:54:08,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:54:08,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-02-08 13:54:08,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137283361] [2025-02-08 13:54:08,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:54:08,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 13:54:08,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:54:08,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 13:54:08,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-08 13:54:08,749 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 34 [2025-02-08 13:54:08,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 34 transitions, 92 flow. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:54:08,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:54:08,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 34 [2025-02-08 13:54:08,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:54:08,851 INFO L124 PetriNetUnfolderBase]: 24/88 cut-off events. [2025-02-08 13:54:08,851 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 13:54:08,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 88 events. 24/88 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 183 event pairs, 20 based on Foata normal form. 1/78 useless extension candidates. Maximal degree in co-relation 151. Up to 59 conditions per place. [2025-02-08 13:54:08,852 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 15 selfloop transitions, 6 changer transitions 0/33 dead transitions. [2025-02-08 13:54:08,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 33 transitions, 130 flow [2025-02-08 13:54:08,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:54:08,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 13:54:08,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 94 transitions. [2025-02-08 13:54:08,854 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46078431372549017 [2025-02-08 13:54:08,855 INFO L175 Difference]: Start difference. First operand has 38 places, 34 transitions, 92 flow. Second operand 6 states and 94 transitions. [2025-02-08 13:54:08,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 33 transitions, 130 flow [2025-02-08 13:54:08,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 33 transitions, 128 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 13:54:08,858 INFO L231 Difference]: Finished difference. Result has 41 places, 33 transitions, 98 flow [2025-02-08 13:54:08,859 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=98, PETRI_PLACES=41, PETRI_TRANSITIONS=33} [2025-02-08 13:54:08,859 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 7 predicate places. [2025-02-08 13:54:08,859 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 33 transitions, 98 flow [2025-02-08 13:54:08,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:54:08,860 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:08,860 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-02-08 13:54:08,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 13:54:09,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:54:09,065 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-02-08 13:54:09,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:09,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1904913130, now seen corresponding path program 1 times [2025-02-08 13:54:09,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:09,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904883040] [2025-02-08 13:54:09,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:09,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:09,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 13:54:09,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 13:54:09,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:09,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:09,149 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 13:54:09,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:54:09,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904883040] [2025-02-08 13:54:09,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904883040] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:54:09,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:54:09,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:54:09,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742716820] [2025-02-08 13:54:09,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:54:09,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:54:09,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:54:09,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:54:09,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:54:09,155 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 34 [2025-02-08 13:54:09,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 33 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:54:09,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:54:09,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 34 [2025-02-08 13:54:09,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:54:09,233 INFO L124 PetriNetUnfolderBase]: 24/87 cut-off events. [2025-02-08 13:54:09,234 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-08 13:54:09,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171 conditions, 87 events. 24/87 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 181 event pairs, 20 based on Foata normal form. 1/78 useless extension candidates. Maximal degree in co-relation 147. Up to 62 conditions per place. [2025-02-08 13:54:09,235 INFO L140 encePairwiseOnDemand]: 31/34 looper letters, 16 selfloop transitions, 4 changer transitions 0/32 dead transitions. [2025-02-08 13:54:09,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 32 transitions, 134 flow [2025-02-08 13:54:09,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:54:09,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 13:54:09,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2025-02-08 13:54:09,236 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5392156862745098 [2025-02-08 13:54:09,236 INFO L175 Difference]: Start difference. First operand has 41 places, 33 transitions, 98 flow. Second operand 3 states and 55 transitions. [2025-02-08 13:54:09,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 32 transitions, 134 flow [2025-02-08 13:54:09,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 32 transitions, 112 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-02-08 13:54:09,238 INFO L231 Difference]: Finished difference. Result has 36 places, 32 transitions, 80 flow [2025-02-08 13:54:09,238 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=36, PETRI_TRANSITIONS=32} [2025-02-08 13:54:09,239 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 2 predicate places. [2025-02-08 13:54:09,239 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 32 transitions, 80 flow [2025-02-08 13:54:09,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:54:09,239 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:09,239 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:54:09,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 13:54:09,239 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-02-08 13:54:09,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:09,240 INFO L85 PathProgramCache]: Analyzing trace with hash 150896690, now seen corresponding path program 1 times [2025-02-08 13:54:09,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:09,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646585078] [2025-02-08 13:54:09,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:09,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:09,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 13:54:09,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 13:54:09,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:09,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:09,306 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:09,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:54:09,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646585078] [2025-02-08 13:54:09,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646585078] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:54:09,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99226102] [2025-02-08 13:54:09,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:09,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:54:09,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:54:09,309 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:54:09,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 13:54:09,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 13:54:09,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 13:54:09,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:09,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:09,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 13:54:09,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:54:09,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:09,423 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:54:09,458 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:09,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [99226102] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:54:09,458 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:54:09,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-02-08 13:54:09,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160491289] [2025-02-08 13:54:09,458 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:54:09,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 13:54:09,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:54:09,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 13:54:09,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-08 13:54:09,479 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 34 [2025-02-08 13:54:09,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 32 transitions, 80 flow. Second operand has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:54:09,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:54:09,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 34 [2025-02-08 13:54:09,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:54:09,605 INFO L124 PetriNetUnfolderBase]: 24/91 cut-off events. [2025-02-08 13:54:09,606 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-02-08 13:54:09,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174 conditions, 91 events. 24/91 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 172 event pairs, 20 based on Foata normal form. 2/84 useless extension candidates. Maximal degree in co-relation 140. Up to 60 conditions per place. [2025-02-08 13:54:09,606 INFO L140 encePairwiseOnDemand]: 30/34 looper letters, 16 selfloop transitions, 7 changer transitions 0/35 dead transitions. [2025-02-08 13:54:09,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 35 transitions, 141 flow [2025-02-08 13:54:09,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 13:54:09,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 13:54:09,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 109 transitions. [2025-02-08 13:54:09,611 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4579831932773109 [2025-02-08 13:54:09,611 INFO L175 Difference]: Start difference. First operand has 36 places, 32 transitions, 80 flow. Second operand 7 states and 109 transitions. [2025-02-08 13:54:09,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 35 transitions, 141 flow [2025-02-08 13:54:09,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 35 transitions, 127 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 13:54:09,613 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 106 flow [2025-02-08 13:54:09,613 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=106, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2025-02-08 13:54:09,613 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 8 predicate places. [2025-02-08 13:54:09,613 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 106 flow [2025-02-08 13:54:09,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:54:09,616 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:09,616 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1] [2025-02-08 13:54:09,626 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 13:54:09,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:54:09,818 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-02-08 13:54:09,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:09,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1871327214, now seen corresponding path program 2 times [2025-02-08 13:54:09,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:09,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455830813] [2025-02-08 13:54:09,819 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:54:09,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:09,831 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-02-08 13:54:09,845 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 13:54:09,845 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 13:54:09,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:10,002 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:10,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:54:10,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455830813] [2025-02-08 13:54:10,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455830813] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:54:10,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739951089] [2025-02-08 13:54:10,003 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:54:10,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:54:10,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:54:10,005 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:54:10,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 13:54:10,056 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-02-08 13:54:10,074 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 13:54:10,074 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 13:54:10,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:10,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 13:54:10,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:54:10,115 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:10,115 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:54:10,201 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:10,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1739951089] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:54:10,202 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:54:10,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2025-02-08 13:54:10,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795578809] [2025-02-08 13:54:10,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:54:10,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-08 13:54:10,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:54:10,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-08 13:54:10,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-02-08 13:54:10,226 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 34 [2025-02-08 13:54:10,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 106 flow. Second operand has 15 states, 15 states have (on average 13.333333333333334) internal successors, (200), 15 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:54:10,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:54:10,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 34 [2025-02-08 13:54:10,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:54:10,384 INFO L124 PetriNetUnfolderBase]: 24/100 cut-off events. [2025-02-08 13:54:10,385 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-02-08 13:54:10,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 208 conditions, 100 events. 24/100 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 170 event pairs, 20 based on Foata normal form. 3/94 useless extension candidates. Maximal degree in co-relation 142. Up to 60 conditions per place. [2025-02-08 13:54:10,386 INFO L140 encePairwiseOnDemand]: 30/34 looper letters, 16 selfloop transitions, 13 changer transitions 0/41 dead transitions. [2025-02-08 13:54:10,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 41 transitions, 200 flow [2025-02-08 13:54:10,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 13:54:10,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-02-08 13:54:10,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 188 transitions. [2025-02-08 13:54:10,388 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4253393665158371 [2025-02-08 13:54:10,388 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 106 flow. Second operand 13 states and 188 transitions. [2025-02-08 13:54:10,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 41 transitions, 200 flow [2025-02-08 13:54:10,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 41 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 13:54:10,390 INFO L231 Difference]: Finished difference. Result has 55 places, 41 transitions, 179 flow [2025-02-08 13:54:10,391 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=179, PETRI_PLACES=55, PETRI_TRANSITIONS=41} [2025-02-08 13:54:10,391 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 21 predicate places. [2025-02-08 13:54:10,391 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 41 transitions, 179 flow [2025-02-08 13:54:10,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 13.333333333333334) internal successors, (200), 15 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:54:10,393 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:10,393 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 2, 1, 1, 1, 1, 1] [2025-02-08 13:54:10,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 13:54:10,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:54:10,597 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-02-08 13:54:10,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:10,598 INFO L85 PathProgramCache]: Analyzing trace with hash -2007897113, now seen corresponding path program 3 times [2025-02-08 13:54:10,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:10,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133872852] [2025-02-08 13:54:10,598 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 13:54:10,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:10,609 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 7 equivalence classes. [2025-02-08 13:54:10,637 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 13:54:10,637 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-02-08 13:54:10,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 13:54:10,637 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 13:54:10,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 13:54:10,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 13:54:10,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:10,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 13:54:10,695 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 13:54:10,695 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 13:54:10,696 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2025-02-08 13:54:10,697 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 11 remaining) [2025-02-08 13:54:10,698 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 11 remaining) [2025-02-08 13:54:10,698 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 11 remaining) [2025-02-08 13:54:10,698 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 11 remaining) [2025-02-08 13:54:10,698 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 11 remaining) [2025-02-08 13:54:10,699 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 11 remaining) [2025-02-08 13:54:10,699 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 11 remaining) [2025-02-08 13:54:10,699 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 11 remaining) [2025-02-08 13:54:10,699 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 11 remaining) [2025-02-08 13:54:10,699 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 11 remaining) [2025-02-08 13:54:10,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 13:54:10,700 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2025-02-08 13:54:10,702 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 13:54:10,702 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 13:54:10,731 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 13:54:10,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 57 transitions, 124 flow [2025-02-08 13:54:10,745 INFO L124 PetriNetUnfolderBase]: 5/62 cut-off events. [2025-02-08 13:54:10,746 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 13:54:10,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70 conditions, 62 events. 5/62 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 127 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 47. Up to 3 conditions per place. [2025-02-08 13:54:10,746 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 57 transitions, 124 flow [2025-02-08 13:54:10,747 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 57 transitions, 124 flow [2025-02-08 13:54:10,748 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 13:54:10,748 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;@7caa575e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 13:54:10,748 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-02-08 13:54:10,750 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 13:54:10,751 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-02-08 13:54:10,751 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 13:54:10,751 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:10,751 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 13:54:10,751 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-02-08 13:54:10,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:10,752 INFO L85 PathProgramCache]: Analyzing trace with hash 301016, now seen corresponding path program 1 times [2025-02-08 13:54:10,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:10,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311305092] [2025-02-08 13:54:10,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:10,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:10,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 13:54:10,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 13:54:10,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:10,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:10,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:10,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:54:10,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311305092] [2025-02-08 13:54:10,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311305092] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:54:10,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:54:10,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:54:10,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668111989] [2025-02-08 13:54:10,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:54:10,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:54:10,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:54:10,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:54:10,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:54:10,805 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 57 [2025-02-08 13:54:10,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 57 transitions, 124 flow. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:54:10,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:54:10,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 57 [2025-02-08 13:54:10,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:54:11,016 INFO L124 PetriNetUnfolderBase]: 640/1359 cut-off events. [2025-02-08 13:54:11,016 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-02-08 13:54:11,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2442 conditions, 1359 events. 640/1359 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 7801 event pairs, 570 based on Foata normal form. 70/1302 useless extension candidates. Maximal degree in co-relation 1597. Up to 1043 conditions per place. [2025-02-08 13:54:11,026 INFO L140 encePairwiseOnDemand]: 48/57 looper letters, 31 selfloop transitions, 3 changer transitions 0/56 dead transitions. [2025-02-08 13:54:11,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 56 transitions, 190 flow [2025-02-08 13:54:11,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:54:11,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 13:54:11,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 128 transitions. [2025-02-08 13:54:11,027 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5614035087719298 [2025-02-08 13:54:11,027 INFO L175 Difference]: Start difference. First operand has 57 places, 57 transitions, 124 flow. Second operand 4 states and 128 transitions. [2025-02-08 13:54:11,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 56 transitions, 190 flow [2025-02-08 13:54:11,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 56 transitions, 190 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 13:54:11,029 INFO L231 Difference]: Finished difference. Result has 61 places, 56 transitions, 142 flow [2025-02-08 13:54:11,029 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=56, 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=142, PETRI_PLACES=61, PETRI_TRANSITIONS=56} [2025-02-08 13:54:11,029 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 4 predicate places. [2025-02-08 13:54:11,029 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 56 transitions, 142 flow [2025-02-08 13:54:11,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:54:11,030 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:11,030 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-02-08 13:54:11,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 13:54:11,030 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-02-08 13:54:11,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:11,030 INFO L85 PathProgramCache]: Analyzing trace with hash 377882186, now seen corresponding path program 1 times [2025-02-08 13:54:11,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:11,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816766951] [2025-02-08 13:54:11,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:11,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:11,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:54:11,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:54:11,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:11,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:11,113 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:11,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:54:11,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816766951] [2025-02-08 13:54:11,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816766951] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:54:11,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720137392] [2025-02-08 13:54:11,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:11,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:54:11,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:54:11,116 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:54:11,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 13:54:11,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:54:11,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:54:11,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:11,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:11,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 13:54:11,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:54:11,209 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:11,210 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:54:11,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [720137392] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:54:11,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:54:11,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-02-08 13:54:11,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982880995] [2025-02-08 13:54:11,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:54:11,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 13:54:11,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:54:11,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 13:54:11,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-08 13:54:11,219 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 57 [2025-02-08 13:54:11,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 56 transitions, 142 flow. Second operand has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:54:11,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:54:11,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 57 [2025-02-08 13:54:11,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:54:11,450 INFO L124 PetriNetUnfolderBase]: 640/1358 cut-off events. [2025-02-08 13:54:11,450 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-02-08 13:54:11,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2452 conditions, 1358 events. 640/1358 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 7805 event pairs, 570 based on Foata normal form. 1/1232 useless extension candidates. Maximal degree in co-relation 2433. Up to 1038 conditions per place. [2025-02-08 13:54:11,460 INFO L140 encePairwiseOnDemand]: 52/57 looper letters, 27 selfloop transitions, 6 changer transitions 0/55 dead transitions. [2025-02-08 13:54:11,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 55 transitions, 204 flow [2025-02-08 13:54:11,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:54:11,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 13:54:11,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 166 transitions. [2025-02-08 13:54:11,462 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4853801169590643 [2025-02-08 13:54:11,462 INFO L175 Difference]: Start difference. First operand has 61 places, 56 transitions, 142 flow. Second operand 6 states and 166 transitions. [2025-02-08 13:54:11,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 55 transitions, 204 flow [2025-02-08 13:54:11,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 55 transitions, 202 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 13:54:11,464 INFO L231 Difference]: Finished difference. Result has 64 places, 55 transitions, 148 flow [2025-02-08 13:54:11,465 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=148, PETRI_PLACES=64, PETRI_TRANSITIONS=55} [2025-02-08 13:54:11,465 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 7 predicate places. [2025-02-08 13:54:11,465 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 55 transitions, 148 flow [2025-02-08 13:54:11,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:54:11,465 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:11,465 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-02-08 13:54:11,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-08 13:54:11,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-02-08 13:54:11,666 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-02-08 13:54:11,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:11,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1170553873, now seen corresponding path program 1 times [2025-02-08 13:54:11,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:11,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022462238] [2025-02-08 13:54:11,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:11,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:11,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 13:54:11,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 13:54:11,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:11,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:11,704 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 13:54:11,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:54:11,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022462238] [2025-02-08 13:54:11,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022462238] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:54:11,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:54:11,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:54:11,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245941836] [2025-02-08 13:54:11,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:54:11,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:54:11,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:54:11,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:54:11,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:54:11,710 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 57 [2025-02-08 13:54:11,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 55 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 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-02-08 13:54:11,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:54:11,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 57 [2025-02-08 13:54:11,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:54:11,883 INFO L124 PetriNetUnfolderBase]: 640/1357 cut-off events. [2025-02-08 13:54:11,883 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2025-02-08 13:54:11,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2454 conditions, 1357 events. 640/1357 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 7847 event pairs, 570 based on Foata normal form. 1/1232 useless extension candidates. Maximal degree in co-relation 2429. Up to 1041 conditions per place. [2025-02-08 13:54:11,893 INFO L140 encePairwiseOnDemand]: 54/57 looper letters, 28 selfloop transitions, 4 changer transitions 0/54 dead transitions. [2025-02-08 13:54:11,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 54 transitions, 208 flow [2025-02-08 13:54:11,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:54:11,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 13:54:11,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2025-02-08 13:54:11,894 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5672514619883041 [2025-02-08 13:54:11,895 INFO L175 Difference]: Start difference. First operand has 64 places, 55 transitions, 148 flow. Second operand 3 states and 97 transitions. [2025-02-08 13:54:11,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 54 transitions, 208 flow [2025-02-08 13:54:11,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 54 transitions, 186 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-02-08 13:54:11,898 INFO L231 Difference]: Finished difference. Result has 59 places, 54 transitions, 130 flow [2025-02-08 13:54:11,898 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=59, PETRI_TRANSITIONS=54} [2025-02-08 13:54:11,900 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 2 predicate places. [2025-02-08 13:54:11,900 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 54 transitions, 130 flow [2025-02-08 13:54:11,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 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-02-08 13:54:11,901 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:11,901 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:54:11,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 13:54:11,901 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-02-08 13:54:11,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:11,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1115122364, now seen corresponding path program 1 times [2025-02-08 13:54:11,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:11,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084500970] [2025-02-08 13:54:11,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:11,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:11,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 13:54:11,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 13:54:11,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:11,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:11,968 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:11,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:54:11,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084500970] [2025-02-08 13:54:11,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084500970] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:54:11,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132336188] [2025-02-08 13:54:11,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:11,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:54:11,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:54:11,972 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:54:11,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 13:54:12,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 13:54:12,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 13:54:12,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:12,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:12,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 13:54:12,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:54:12,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:12,059 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:54:12,086 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:12,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1132336188] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:54:12,086 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:54:12,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-02-08 13:54:12,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745519607] [2025-02-08 13:54:12,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:54:12,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 13:54:12,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:54:12,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 13:54:12,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-08 13:54:12,100 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 57 [2025-02-08 13:54:12,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 54 transitions, 130 flow. Second operand has 10 states, 10 states have (on average 23.4) internal successors, (234), 10 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:54:12,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:54:12,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 57 [2025-02-08 13:54:12,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:54:12,385 INFO L124 PetriNetUnfolderBase]: 640/1361 cut-off events. [2025-02-08 13:54:12,385 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2025-02-08 13:54:12,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2457 conditions, 1361 events. 640/1361 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 7817 event pairs, 570 based on Foata normal form. 2/1238 useless extension candidates. Maximal degree in co-relation 2422. Up to 1039 conditions per place. [2025-02-08 13:54:12,397 INFO L140 encePairwiseOnDemand]: 53/57 looper letters, 28 selfloop transitions, 7 changer transitions 0/57 dead transitions. [2025-02-08 13:54:12,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 57 transitions, 215 flow [2025-02-08 13:54:12,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 13:54:12,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 13:54:12,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 191 transitions. [2025-02-08 13:54:12,399 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47869674185463656 [2025-02-08 13:54:12,399 INFO L175 Difference]: Start difference. First operand has 59 places, 54 transitions, 130 flow. Second operand 7 states and 191 transitions. [2025-02-08 13:54:12,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 57 transitions, 215 flow [2025-02-08 13:54:12,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 57 transitions, 201 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 13:54:12,402 INFO L231 Difference]: Finished difference. Result has 65 places, 57 transitions, 156 flow [2025-02-08 13:54:12,402 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=156, PETRI_PLACES=65, PETRI_TRANSITIONS=57} [2025-02-08 13:54:12,404 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 8 predicate places. [2025-02-08 13:54:12,404 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 57 transitions, 156 flow [2025-02-08 13:54:12,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 23.4) internal successors, (234), 10 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:54:12,405 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:12,405 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:54:12,413 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-08 13:54:12,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-08 13:54:12,609 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-02-08 13:54:12,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:12,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1017320828, now seen corresponding path program 2 times [2025-02-08 13:54:12,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:12,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676064592] [2025-02-08 13:54:12,610 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:54:12,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:12,623 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-02-08 13:54:12,628 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 16 statements. [2025-02-08 13:54:12,629 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 13:54:12,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:12,709 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 13:54:12,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:54:12,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676064592] [2025-02-08 13:54:12,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676064592] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:54:12,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:54:12,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:54:12,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140190831] [2025-02-08 13:54:12,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:54:12,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:54:12,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:54:12,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:54:12,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:54:12,720 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 57 [2025-02-08 13:54:12,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 57 transitions, 156 flow. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:54:12,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:54:12,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 57 [2025-02-08 13:54:12,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:54:12,916 INFO L124 PetriNetUnfolderBase]: 698/1447 cut-off events. [2025-02-08 13:54:12,916 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2025-02-08 13:54:12,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2647 conditions, 1447 events. 698/1447 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 8306 event pairs, 291 based on Foata normal form. 36/1405 useless extension candidates. Maximal degree in co-relation 2607. Up to 976 conditions per place. [2025-02-08 13:54:12,926 INFO L140 encePairwiseOnDemand]: 54/57 looper letters, 48 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2025-02-08 13:54:12,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 70 transitions, 287 flow [2025-02-08 13:54:12,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:54:12,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 13:54:12,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2025-02-08 13:54:12,927 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6549707602339181 [2025-02-08 13:54:12,927 INFO L175 Difference]: Start difference. First operand has 65 places, 57 transitions, 156 flow. Second operand 3 states and 112 transitions. [2025-02-08 13:54:12,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 70 transitions, 287 flow [2025-02-08 13:54:12,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 70 transitions, 283 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 13:54:12,929 INFO L231 Difference]: Finished difference. Result has 64 places, 56 transitions, 154 flow [2025-02-08 13:54:12,929 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=154, PETRI_PLACES=64, PETRI_TRANSITIONS=56} [2025-02-08 13:54:12,930 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 7 predicate places. [2025-02-08 13:54:12,930 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 56 transitions, 154 flow [2025-02-08 13:54:12,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:54:12,930 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:12,930 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:54:12,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 13:54:12,930 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-02-08 13:54:12,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:12,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1472174307, now seen corresponding path program 1 times [2025-02-08 13:54:12,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:12,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140758934] [2025-02-08 13:54:12,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:12,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:12,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 13:54:12,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 13:54:12,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:12,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:13,008 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 13:54:13,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:54:13,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140758934] [2025-02-08 13:54:13,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140758934] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:54:13,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:54:13,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:54:13,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481248292] [2025-02-08 13:54:13,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:54:13,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:54:13,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:54:13,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:54:13,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:54:13,016 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 57 [2025-02-08 13:54:13,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 56 transitions, 154 flow. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:54:13,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:54:13,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 57 [2025-02-08 13:54:13,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:54:13,216 INFO L124 PetriNetUnfolderBase]: 640/1398 cut-off events. [2025-02-08 13:54:13,216 INFO L125 PetriNetUnfolderBase]: For 116/116 co-relation queries the response was YES. [2025-02-08 13:54:13,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2572 conditions, 1398 events. 640/1398 cut-off events. For 116/116 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 8128 event pairs, 75 based on Foata normal form. 36/1380 useless extension candidates. Maximal degree in co-relation 2533. Up to 882 conditions per place. [2025-02-08 13:54:13,224 INFO L140 encePairwiseOnDemand]: 54/57 looper letters, 47 selfloop transitions, 2 changer transitions 0/69 dead transitions. [2025-02-08 13:54:13,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 69 transitions, 283 flow [2025-02-08 13:54:13,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:54:13,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 13:54:13,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2025-02-08 13:54:13,226 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6491228070175439 [2025-02-08 13:54:13,226 INFO L175 Difference]: Start difference. First operand has 64 places, 56 transitions, 154 flow. Second operand 3 states and 111 transitions. [2025-02-08 13:54:13,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 69 transitions, 283 flow [2025-02-08 13:54:13,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 69 transitions, 279 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 13:54:13,227 INFO L231 Difference]: Finished difference. Result has 63 places, 55 transitions, 152 flow [2025-02-08 13:54:13,228 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=63, PETRI_TRANSITIONS=55} [2025-02-08 13:54:13,228 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 6 predicate places. [2025-02-08 13:54:13,228 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 55 transitions, 152 flow [2025-02-08 13:54:13,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:54:13,228 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:13,228 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1] [2025-02-08 13:54:13,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 13:54:13,229 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-02-08 13:54:13,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:13,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1106338614, now seen corresponding path program 1 times [2025-02-08 13:54:13,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:13,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975330573] [2025-02-08 13:54:13,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:13,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:13,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 13:54:13,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 13:54:13,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:13,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:13,331 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:13,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:54:13,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975330573] [2025-02-08 13:54:13,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975330573] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:54:13,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587187225] [2025-02-08 13:54:13,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:13,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:54:13,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:54:13,335 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:54:13,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 13:54:13,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 13:54:13,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 13:54:13,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:13,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:13,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 13:54:13,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:54:13,448 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:13,449 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:54:13,525 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:13,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587187225] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:54:13,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:54:13,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2025-02-08 13:54:13,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227579420] [2025-02-08 13:54:13,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:54:13,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-08 13:54:13,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:54:13,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-08 13:54:13,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-02-08 13:54:13,539 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 57 [2025-02-08 13:54:13,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 55 transitions, 152 flow. Second operand has 15 states, 15 states have (on average 23.4) internal successors, (351), 15 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:54:13,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:54:13,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 57 [2025-02-08 13:54:13,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:54:13,787 INFO L124 PetriNetUnfolderBase]: 640/1364 cut-off events. [2025-02-08 13:54:13,787 INFO L125 PetriNetUnfolderBase]: For 127/127 co-relation queries the response was YES. [2025-02-08 13:54:13,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2556 conditions, 1364 events. 640/1364 cut-off events. For 127/127 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 7788 event pairs, 570 based on Foata normal form. 3/1248 useless extension candidates. Maximal degree in co-relation 2490. Up to 1039 conditions per place. [2025-02-08 13:54:13,796 INFO L140 encePairwiseOnDemand]: 53/57 looper letters, 28 selfloop transitions, 13 changer transitions 0/61 dead transitions. [2025-02-08 13:54:13,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 61 transitions, 270 flow [2025-02-08 13:54:13,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 13:54:13,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-02-08 13:54:13,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 330 transitions. [2025-02-08 13:54:13,798 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44534412955465585 [2025-02-08 13:54:13,798 INFO L175 Difference]: Start difference. First operand has 63 places, 55 transitions, 152 flow. Second operand 13 states and 330 transitions. [2025-02-08 13:54:13,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 61 transitions, 270 flow [2025-02-08 13:54:13,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 61 transitions, 266 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 13:54:13,800 INFO L231 Difference]: Finished difference. Result has 76 places, 61 transitions, 225 flow [2025-02-08 13:54:13,800 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=225, PETRI_PLACES=76, PETRI_TRANSITIONS=61} [2025-02-08 13:54:13,801 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 19 predicate places. [2025-02-08 13:54:13,801 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 61 transitions, 225 flow [2025-02-08 13:54:13,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 23.4) internal successors, (351), 15 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:54:13,802 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:13,802 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 3, 2, 1, 1, 1, 1, 1] [2025-02-08 13:54:13,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-08 13:54:14,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-08 13:54:14,003 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-02-08 13:54:14,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:14,003 INFO L85 PathProgramCache]: Analyzing trace with hash 691675880, now seen corresponding path program 2 times [2025-02-08 13:54:14,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:14,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535681260] [2025-02-08 13:54:14,003 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:54:14,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:14,011 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-02-08 13:54:14,024 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 13:54:14,024 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 13:54:14,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 13:54:14,024 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 13:54:14,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 13:54:14,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 13:54:14,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:14,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 13:54:14,042 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 13:54:14,042 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 13:54:14,042 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 15 remaining) [2025-02-08 13:54:14,043 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 15 remaining) [2025-02-08 13:54:14,043 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 15 remaining) [2025-02-08 13:54:14,043 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 15 remaining) [2025-02-08 13:54:14,043 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 15 remaining) [2025-02-08 13:54:14,043 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 15 remaining) [2025-02-08 13:54:14,043 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 15 remaining) [2025-02-08 13:54:14,043 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 15 remaining) [2025-02-08 13:54:14,043 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 15 remaining) [2025-02-08 13:54:14,043 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 15 remaining) [2025-02-08 13:54:14,043 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 15 remaining) [2025-02-08 13:54:14,043 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 15 remaining) [2025-02-08 13:54:14,043 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 15 remaining) [2025-02-08 13:54:14,043 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 15 remaining) [2025-02-08 13:54:14,043 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 15 remaining) [2025-02-08 13:54:14,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 13:54:14,044 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1] [2025-02-08 13:54:14,044 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 13:54:14,044 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-08 13:54:14,071 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 13:54:14,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 80 transitions, 178 flow [2025-02-08 13:54:14,084 INFO L124 PetriNetUnfolderBase]: 7/88 cut-off events. [2025-02-08 13:54:14,084 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-08 13:54:14,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 88 events. 7/88 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 232 event pairs, 0 based on Foata normal form. 0/63 useless extension candidates. Maximal degree in co-relation 69. Up to 4 conditions per place. [2025-02-08 13:54:14,085 INFO L82 GeneralOperation]: Start removeDead. Operand has 80 places, 80 transitions, 178 flow [2025-02-08 13:54:14,086 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 80 places, 80 transitions, 178 flow [2025-02-08 13:54:14,088 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 13:54:14,089 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;@7caa575e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 13:54:14,089 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2025-02-08 13:54:14,090 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 13:54:14,090 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-02-08 13:54:14,090 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 13:54:14,090 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:14,091 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 13:54:14,091 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-02-08 13:54:14,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:14,091 INFO L85 PathProgramCache]: Analyzing trace with hash 380456, now seen corresponding path program 1 times [2025-02-08 13:54:14,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:14,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105698627] [2025-02-08 13:54:14,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:14,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:14,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 13:54:14,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 13:54:14,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:14,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:14,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:14,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:54:14,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105698627] [2025-02-08 13:54:14,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105698627] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:54:14,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:54:14,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:54:14,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127972425] [2025-02-08 13:54:14,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:54:14,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:54:14,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:54:14,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:54:14,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:54:14,130 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 80 [2025-02-08 13:54:14,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 80 transitions, 178 flow. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:54:14,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:54:14,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 80 [2025-02-08 13:54:14,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:54:15,665 INFO L124 PetriNetUnfolderBase]: 11409/19214 cut-off events. [2025-02-08 13:54:15,666 INFO L125 PetriNetUnfolderBase]: For 793/793 co-relation queries the response was YES. [2025-02-08 13:54:15,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35544 conditions, 19214 events. 11409/19214 cut-off events. For 793/793 co-relation queries the response was YES. Maximal size of possible extension queue 842. Compared 148406 event pairs, 10250 based on Foata normal form. 1159/18986 useless extension candidates. Maximal degree in co-relation 17138. Up to 15805 conditions per place. [2025-02-08 13:54:15,894 INFO L140 encePairwiseOnDemand]: 70/80 looper letters, 43 selfloop transitions, 3 changer transitions 0/78 dead transitions. [2025-02-08 13:54:15,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 78 transitions, 266 flow [2025-02-08 13:54:15,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:54:15,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 13:54:15,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 181 transitions. [2025-02-08 13:54:15,896 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.565625 [2025-02-08 13:54:15,896 INFO L175 Difference]: Start difference. First operand has 80 places, 80 transitions, 178 flow. Second operand 4 states and 181 transitions. [2025-02-08 13:54:15,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 78 transitions, 266 flow [2025-02-08 13:54:15,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 78 transitions, 264 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-02-08 13:54:15,898 INFO L231 Difference]: Finished difference. Result has 84 places, 78 transitions, 192 flow [2025-02-08 13:54:15,898 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=192, PETRI_PLACES=84, PETRI_TRANSITIONS=78} [2025-02-08 13:54:15,899 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 4 predicate places. [2025-02-08 13:54:15,899 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 78 transitions, 192 flow [2025-02-08 13:54:15,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:54:15,899 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:15,899 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-02-08 13:54:15,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 13:54:15,900 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-02-08 13:54:15,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:15,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1550408630, now seen corresponding path program 1 times [2025-02-08 13:54:15,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:15,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486710459] [2025-02-08 13:54:15,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:15,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:15,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:54:15,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:54:15,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:15,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:15,961 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:15,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:54:15,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486710459] [2025-02-08 13:54:15,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486710459] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:54:15,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148808742] [2025-02-08 13:54:15,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:15,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:54:15,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:54:15,964 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:54:15,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 13:54:16,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:54:16,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:54:16,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:16,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:16,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 13:54:16,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:54:16,054 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:16,054 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:54:16,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [148808742] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:54:16,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:54:16,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-02-08 13:54:16,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124727353] [2025-02-08 13:54:16,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:54:16,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 13:54:16,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:54:16,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 13:54:16,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-08 13:54:16,061 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 80 [2025-02-08 13:54:16,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 78 transitions, 192 flow. Second operand has 6 states, 6 states have (on average 32.833333333333336) internal successors, (197), 6 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:54:16,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:54:16,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 80 [2025-02-08 13:54:16,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:54:17,549 INFO L124 PetriNetUnfolderBase]: 11409/19213 cut-off events. [2025-02-08 13:54:17,549 INFO L125 PetriNetUnfolderBase]: For 436/436 co-relation queries the response was YES. [2025-02-08 13:54:17,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35433 conditions, 19213 events. 11409/19213 cut-off events. For 436/436 co-relation queries the response was YES. Maximal size of possible extension queue 842. Compared 148315 event pairs, 10250 based on Foata normal form. 1/17827 useless extension candidates. Maximal degree in co-relation 35413. Up to 15800 conditions per place. [2025-02-08 13:54:17,702 INFO L140 encePairwiseOnDemand]: 75/80 looper letters, 39 selfloop transitions, 6 changer transitions 0/77 dead transitions. [2025-02-08 13:54:17,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 77 transitions, 278 flow [2025-02-08 13:54:17,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:54:17,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 13:54:17,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 238 transitions. [2025-02-08 13:54:17,704 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49583333333333335 [2025-02-08 13:54:17,704 INFO L175 Difference]: Start difference. First operand has 84 places, 78 transitions, 192 flow. Second operand 6 states and 238 transitions. [2025-02-08 13:54:17,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 77 transitions, 278 flow [2025-02-08 13:54:17,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 77 transitions, 276 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 13:54:17,709 INFO L231 Difference]: Finished difference. Result has 87 places, 77 transitions, 198 flow [2025-02-08 13:54:17,710 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=198, PETRI_PLACES=87, PETRI_TRANSITIONS=77} [2025-02-08 13:54:17,710 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 7 predicate places. [2025-02-08 13:54:17,710 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 77 transitions, 198 flow [2025-02-08 13:54:17,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 32.833333333333336) internal successors, (197), 6 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:54:17,711 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:17,711 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-02-08 13:54:17,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-08 13:54:17,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:54:17,913 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-02-08 13:54:17,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:17,913 INFO L85 PathProgramCache]: Analyzing trace with hash -818026945, now seen corresponding path program 1 times [2025-02-08 13:54:17,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:17,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054687537] [2025-02-08 13:54:17,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:17,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:17,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 13:54:17,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 13:54:17,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:17,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:17,956 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 13:54:17,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:54:17,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054687537] [2025-02-08 13:54:17,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054687537] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:54:17,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:54:17,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:54:17,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549618037] [2025-02-08 13:54:17,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:54:17,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:54:17,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:54:17,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:54:17,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:54:17,961 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 80 [2025-02-08 13:54:17,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 77 transitions, 198 flow. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:54:17,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:54:17,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 80 [2025-02-08 13:54:17,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:54:19,091 INFO L124 PetriNetUnfolderBase]: 11409/19212 cut-off events. [2025-02-08 13:54:19,091 INFO L125 PetriNetUnfolderBase]: For 441/441 co-relation queries the response was YES. [2025-02-08 13:54:19,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35435 conditions, 19212 events. 11409/19212 cut-off events. For 441/441 co-relation queries the response was YES. Maximal size of possible extension queue 842. Compared 148405 event pairs, 10250 based on Foata normal form. 1/17827 useless extension candidates. Maximal degree in co-relation 35409. Up to 15803 conditions per place. [2025-02-08 13:54:19,198 INFO L140 encePairwiseOnDemand]: 77/80 looper letters, 40 selfloop transitions, 4 changer transitions 0/76 dead transitions. [2025-02-08 13:54:19,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 76 transitions, 282 flow [2025-02-08 13:54:19,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:54:19,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 13:54:19,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 139 transitions. [2025-02-08 13:54:19,200 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5791666666666667 [2025-02-08 13:54:19,200 INFO L175 Difference]: Start difference. First operand has 87 places, 77 transitions, 198 flow. Second operand 3 states and 139 transitions. [2025-02-08 13:54:19,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 76 transitions, 282 flow [2025-02-08 13:54:19,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 76 transitions, 260 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-02-08 13:54:19,204 INFO L231 Difference]: Finished difference. Result has 82 places, 76 transitions, 180 flow [2025-02-08 13:54:19,204 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=180, PETRI_PLACES=82, PETRI_TRANSITIONS=76} [2025-02-08 13:54:19,204 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 2 predicate places. [2025-02-08 13:54:19,204 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 76 transitions, 180 flow [2025-02-08 13:54:19,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:54:19,205 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:19,205 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:54:19,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 13:54:19,205 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-02-08 13:54:19,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:19,205 INFO L85 PathProgramCache]: Analyzing trace with hash -179714194, now seen corresponding path program 1 times [2025-02-08 13:54:19,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:19,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335857252] [2025-02-08 13:54:19,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:19,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:19,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 13:54:19,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 13:54:19,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:19,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:19,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:19,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:54:19,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335857252] [2025-02-08 13:54:19,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335857252] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:54:19,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [659948320] [2025-02-08 13:54:19,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:19,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:54:19,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:54:19,256 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:54:19,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-08 13:54:19,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 13:54:19,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 13:54:19,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:19,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:19,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 13:54:19,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:54:19,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:19,492 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:54:19,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:19,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [659948320] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:54:19,520 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:54:19,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-02-08 13:54:19,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456249528] [2025-02-08 13:54:19,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:54:19,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 13:54:19,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:54:19,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 13:54:19,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-08 13:54:19,532 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 80 [2025-02-08 13:54:19,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 76 transitions, 180 flow. Second operand has 10 states, 10 states have (on average 33.4) internal successors, (334), 10 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:54:19,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:54:19,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 80 [2025-02-08 13:54:19,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:54:20,718 INFO L124 PetriNetUnfolderBase]: 11409/19216 cut-off events. [2025-02-08 13:54:20,719 INFO L125 PetriNetUnfolderBase]: For 443/443 co-relation queries the response was YES. [2025-02-08 13:54:20,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35438 conditions, 19216 events. 11409/19216 cut-off events. For 443/443 co-relation queries the response was YES. Maximal size of possible extension queue 842. Compared 148291 event pairs, 10250 based on Foata normal form. 2/17833 useless extension candidates. Maximal degree in co-relation 35402. Up to 15801 conditions per place. [2025-02-08 13:54:20,812 INFO L140 encePairwiseOnDemand]: 76/80 looper letters, 40 selfloop transitions, 7 changer transitions 0/79 dead transitions. [2025-02-08 13:54:20,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 79 transitions, 289 flow [2025-02-08 13:54:20,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 13:54:20,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 13:54:20,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 273 transitions. [2025-02-08 13:54:20,814 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4875 [2025-02-08 13:54:20,814 INFO L175 Difference]: Start difference. First operand has 82 places, 76 transitions, 180 flow. Second operand 7 states and 273 transitions. [2025-02-08 13:54:20,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 79 transitions, 289 flow [2025-02-08 13:54:20,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 79 transitions, 275 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 13:54:20,817 INFO L231 Difference]: Finished difference. Result has 88 places, 79 transitions, 206 flow [2025-02-08 13:54:20,817 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=206, PETRI_PLACES=88, PETRI_TRANSITIONS=79} [2025-02-08 13:54:20,817 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 8 predicate places. [2025-02-08 13:54:20,817 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 79 transitions, 206 flow [2025-02-08 13:54:20,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 33.4) internal successors, (334), 10 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:54:20,818 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:20,818 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:54:20,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-08 13:54:21,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-08 13:54:21,019 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-02-08 13:54:21,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:21,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1702806866, now seen corresponding path program 2 times [2025-02-08 13:54:21,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:21,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99556749] [2025-02-08 13:54:21,019 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:54:21,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:21,030 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-02-08 13:54:21,033 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 16 statements. [2025-02-08 13:54:21,034 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 13:54:21,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:21,080 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 13:54:21,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:54:21,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99556749] [2025-02-08 13:54:21,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99556749] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:54:21,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:54:21,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:54:21,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960464412] [2025-02-08 13:54:21,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:54:21,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:54:21,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:54:21,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:54:21,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:54:21,091 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 80 [2025-02-08 13:54:21,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 79 transitions, 206 flow. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:54:21,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:54:21,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 80 [2025-02-08 13:54:21,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:54:22,509 INFO L124 PetriNetUnfolderBase]: 12446/20587 cut-off events. [2025-02-08 13:54:22,510 INFO L125 PetriNetUnfolderBase]: For 465/465 co-relation queries the response was YES. [2025-02-08 13:54:22,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38288 conditions, 20587 events. 12446/20587 cut-off events. For 465/465 co-relation queries the response was YES. Maximal size of possible extension queue 913. Compared 156845 event pairs, 6896 based on Foata normal form. 399/19948 useless extension candidates. Maximal degree in co-relation 38247. Up to 14759 conditions per place. [2025-02-08 13:54:22,694 INFO L140 encePairwiseOnDemand]: 77/80 looper letters, 72 selfloop transitions, 2 changer transitions 0/104 dead transitions. [2025-02-08 13:54:22,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 104 transitions, 414 flow [2025-02-08 13:54:22,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:54:22,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 13:54:22,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 166 transitions. [2025-02-08 13:54:22,696 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6916666666666667 [2025-02-08 13:54:22,696 INFO L175 Difference]: Start difference. First operand has 88 places, 79 transitions, 206 flow. Second operand 3 states and 166 transitions. [2025-02-08 13:54:22,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 104 transitions, 414 flow [2025-02-08 13:54:22,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 104 transitions, 410 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 13:54:22,698 INFO L231 Difference]: Finished difference. Result has 87 places, 78 transitions, 204 flow [2025-02-08 13:54:22,700 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=204, PETRI_PLACES=87, PETRI_TRANSITIONS=78} [2025-02-08 13:54:22,700 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 7 predicate places. [2025-02-08 13:54:22,701 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 78 transitions, 204 flow [2025-02-08 13:54:22,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:54:22,701 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:22,701 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:54:22,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 13:54:22,701 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-02-08 13:54:22,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:22,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1247404925, now seen corresponding path program 1 times [2025-02-08 13:54:22,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:22,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172901581] [2025-02-08 13:54:22,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:22,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:22,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 13:54:22,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 13:54:22,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:22,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:22,771 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 13:54:22,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:54:22,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172901581] [2025-02-08 13:54:22,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172901581] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:54:22,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:54:22,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:54:22,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512609657] [2025-02-08 13:54:22,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:54:22,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:54:22,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:54:22,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:54:22,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:54:22,779 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 80 [2025-02-08 13:54:22,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 78 transitions, 204 flow. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:54:22,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:54:22,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 80 [2025-02-08 13:54:22,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:54:24,000 INFO L124 PetriNetUnfolderBase]: 11409/19628 cut-off events. [2025-02-08 13:54:24,000 INFO L125 PetriNetUnfolderBase]: For 1223/1223 co-relation queries the response was YES. [2025-02-08 13:54:24,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36654 conditions, 19628 events. 11409/19628 cut-off events. For 1223/1223 co-relation queries the response was YES. Maximal size of possible extension queue 770. Compared 157383 event pairs, 1538 based on Foata normal form. 399/19355 useless extension candidates. Maximal degree in co-relation 36614. Up to 13323 conditions per place. [2025-02-08 13:54:24,060 INFO L140 encePairwiseOnDemand]: 77/80 looper letters, 71 selfloop transitions, 2 changer transitions 0/103 dead transitions. [2025-02-08 13:54:24,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 103 transitions, 410 flow [2025-02-08 13:54:24,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:54:24,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 13:54:24,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 165 transitions. [2025-02-08 13:54:24,061 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6875 [2025-02-08 13:54:24,061 INFO L175 Difference]: Start difference. First operand has 87 places, 78 transitions, 204 flow. Second operand 3 states and 165 transitions. [2025-02-08 13:54:24,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 103 transitions, 410 flow [2025-02-08 13:54:24,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 103 transitions, 406 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 13:54:24,064 INFO L231 Difference]: Finished difference. Result has 86 places, 77 transitions, 202 flow [2025-02-08 13:54:24,064 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=202, PETRI_PLACES=86, PETRI_TRANSITIONS=77} [2025-02-08 13:54:24,065 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 6 predicate places. [2025-02-08 13:54:24,065 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 77 transitions, 202 flow [2025-02-08 13:54:24,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:54:24,065 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:24,065 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:54:24,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 13:54:24,065 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-02-08 13:54:24,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:24,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1932888114, now seen corresponding path program 1 times [2025-02-08 13:54:24,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:24,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134720978] [2025-02-08 13:54:24,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:24,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:24,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 13:54:24,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 13:54:24,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:24,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:24,158 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:24,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:54:24,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134720978] [2025-02-08 13:54:24,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134720978] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:54:24,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800586944] [2025-02-08 13:54:24,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:24,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:54:24,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:54:24,162 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:54:24,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-08 13:54:24,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 13:54:24,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 13:54:24,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:24,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:24,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 13:54:24,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:54:24,282 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:24,282 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:54:24,357 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:24,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1800586944] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:54:24,358 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:54:24,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2025-02-08 13:54:24,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408507003] [2025-02-08 13:54:24,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:54:24,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-08 13:54:24,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:54:24,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-08 13:54:24,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-02-08 13:54:24,375 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 80 [2025-02-08 13:54:24,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 77 transitions, 202 flow. Second operand has 15 states, 15 states have (on average 33.46666666666667) internal successors, (502), 15 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:54:24,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:54:24,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 80 [2025-02-08 13:54:24,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:54:25,419 INFO L124 PetriNetUnfolderBase]: 11409/19219 cut-off events. [2025-02-08 13:54:25,419 INFO L125 PetriNetUnfolderBase]: For 1252/1252 co-relation queries the response was YES. [2025-02-08 13:54:25,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36263 conditions, 19219 events. 11409/19219 cut-off events. For 1252/1252 co-relation queries the response was YES. Maximal size of possible extension queue 842. Compared 148454 event pairs, 10250 based on Foata normal form. 3/17843 useless extension candidates. Maximal degree in co-relation 36196. Up to 15801 conditions per place. [2025-02-08 13:54:25,531 INFO L140 encePairwiseOnDemand]: 76/80 looper letters, 40 selfloop transitions, 13 changer transitions 0/83 dead transitions. [2025-02-08 13:54:25,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 83 transitions, 344 flow [2025-02-08 13:54:25,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 13:54:25,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-02-08 13:54:25,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 472 transitions. [2025-02-08 13:54:25,533 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45384615384615384 [2025-02-08 13:54:25,533 INFO L175 Difference]: Start difference. First operand has 86 places, 77 transitions, 202 flow. Second operand 13 states and 472 transitions. [2025-02-08 13:54:25,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 83 transitions, 344 flow [2025-02-08 13:54:25,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 83 transitions, 340 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 13:54:25,536 INFO L231 Difference]: Finished difference. Result has 99 places, 83 transitions, 275 flow [2025-02-08 13:54:25,536 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=275, PETRI_PLACES=99, PETRI_TRANSITIONS=83} [2025-02-08 13:54:25,536 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 19 predicate places. [2025-02-08 13:54:25,536 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 83 transitions, 275 flow [2025-02-08 13:54:25,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 33.46666666666667) internal successors, (502), 15 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:54:25,537 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:25,537 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:54:25,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-08 13:54:25,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:54:25,737 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-02-08 13:54:25,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:25,738 INFO L85 PathProgramCache]: Analyzing trace with hash -840737488, now seen corresponding path program 2 times [2025-02-08 13:54:25,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:25,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894953976] [2025-02-08 13:54:25,738 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:54:25,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:25,746 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-02-08 13:54:25,749 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 28 statements. [2025-02-08 13:54:25,749 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 13:54:25,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:25,780 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-02-08 13:54:25,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:54:25,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894953976] [2025-02-08 13:54:25,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894953976] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:54:25,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:54:25,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:54:25,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6025128] [2025-02-08 13:54:25,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:54:25,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:54:25,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:54:25,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:54:25,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:54:25,789 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 80 [2025-02-08 13:54:25,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 83 transitions, 275 flow. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:54:25,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:54:25,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 80 [2025-02-08 13:54:25,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:54:26,805 INFO L124 PetriNetUnfolderBase]: 12443/20554 cut-off events. [2025-02-08 13:54:26,805 INFO L125 PetriNetUnfolderBase]: For 498/498 co-relation queries the response was YES. [2025-02-08 13:54:26,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38286 conditions, 20554 events. 12443/20554 cut-off events. For 498/498 co-relation queries the response was YES. Maximal size of possible extension queue 880. Compared 154937 event pairs, 3941 based on Foata normal form. 396/20079 useless extension candidates. Maximal degree in co-relation 38199. Up to 14696 conditions per place. [2025-02-08 13:54:26,920 INFO L140 encePairwiseOnDemand]: 77/80 looper letters, 77 selfloop transitions, 2 changer transitions 0/107 dead transitions. [2025-02-08 13:54:26,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 107 transitions, 486 flow [2025-02-08 13:54:26,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:54:26,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 13:54:26,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 165 transitions. [2025-02-08 13:54:26,921 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6875 [2025-02-08 13:54:26,921 INFO L175 Difference]: Start difference. First operand has 99 places, 83 transitions, 275 flow. Second operand 3 states and 165 transitions. [2025-02-08 13:54:26,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 107 transitions, 486 flow [2025-02-08 13:54:26,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 107 transitions, 476 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-02-08 13:54:26,924 INFO L231 Difference]: Finished difference. Result has 96 places, 82 transitions, 267 flow [2025-02-08 13:54:26,924 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=267, PETRI_PLACES=96, PETRI_TRANSITIONS=82} [2025-02-08 13:54:26,925 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 16 predicate places. [2025-02-08 13:54:26,925 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 82 transitions, 267 flow [2025-02-08 13:54:26,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:54:26,925 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:26,925 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:54:26,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 13:54:26,925 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-02-08 13:54:26,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:26,926 INFO L85 PathProgramCache]: Analyzing trace with hash -293057961, now seen corresponding path program 1 times [2025-02-08 13:54:26,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:26,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115140634] [2025-02-08 13:54:26,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:26,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:26,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 13:54:26,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 13:54:26,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:26,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:27,023 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-02-08 13:54:27,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:54:27,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115140634] [2025-02-08 13:54:27,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115140634] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:54:27,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:54:27,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:54:27,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024825977] [2025-02-08 13:54:27,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:54:27,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:54:27,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:54:27,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:54:27,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:54:27,031 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 80 [2025-02-08 13:54:27,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 82 transitions, 267 flow. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:54:27,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:54:27,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 80 [2025-02-08 13:54:27,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:54:28,034 INFO L124 PetriNetUnfolderBase]: 11409/19553 cut-off events. [2025-02-08 13:54:28,034 INFO L125 PetriNetUnfolderBase]: For 1246/1246 co-relation queries the response was YES. [2025-02-08 13:54:28,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36610 conditions, 19553 events. 11409/19553 cut-off events. For 1246/1246 co-relation queries the response was YES. Maximal size of possible extension queue 798. Compared 153096 event pairs, 2489 based on Foata normal form. 396/19027 useless extension candidates. Maximal degree in co-relation 36527. Up to 13266 conditions per place. [2025-02-08 13:54:28,157 INFO L140 encePairwiseOnDemand]: 77/80 looper letters, 76 selfloop transitions, 2 changer transitions 0/106 dead transitions. [2025-02-08 13:54:28,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 106 transitions, 476 flow [2025-02-08 13:54:28,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:54:28,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 13:54:28,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 164 transitions. [2025-02-08 13:54:28,159 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6833333333333333 [2025-02-08 13:54:28,159 INFO L175 Difference]: Start difference. First operand has 96 places, 82 transitions, 267 flow. Second operand 3 states and 164 transitions. [2025-02-08 13:54:28,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 106 transitions, 476 flow [2025-02-08 13:54:28,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 106 transitions, 472 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 13:54:28,164 INFO L231 Difference]: Finished difference. Result has 95 places, 81 transitions, 265 flow [2025-02-08 13:54:28,164 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=265, PETRI_PLACES=95, PETRI_TRANSITIONS=81} [2025-02-08 13:54:28,165 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 15 predicate places. [2025-02-08 13:54:28,165 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 81 transitions, 265 flow [2025-02-08 13:54:28,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:54:28,165 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:28,165 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 4, 3, 1, 1, 1, 1, 1, 1] [2025-02-08 13:54:28,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 13:54:28,165 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-02-08 13:54:28,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:28,166 INFO L85 PathProgramCache]: Analyzing trace with hash -284366577, now seen corresponding path program 1 times [2025-02-08 13:54:28,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:28,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317103695] [2025-02-08 13:54:28,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:28,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:28,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 13:54:28,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 13:54:28,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:28,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 13:54:28,183 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 13:54:28,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 13:54:28,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 13:54:28,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:28,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 13:54:28,210 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 13:54:28,210 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 13:54:28,211 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 19 remaining) [2025-02-08 13:54:28,211 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 19 remaining) [2025-02-08 13:54:28,212 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 19 remaining) [2025-02-08 13:54:28,212 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 19 remaining) [2025-02-08 13:54:28,212 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 19 remaining) [2025-02-08 13:54:28,212 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 19 remaining) [2025-02-08 13:54:28,212 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 19 remaining) [2025-02-08 13:54:28,212 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 19 remaining) [2025-02-08 13:54:28,212 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 19 remaining) [2025-02-08 13:54:28,212 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 19 remaining) [2025-02-08 13:54:28,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 19 remaining) [2025-02-08 13:54:28,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 19 remaining) [2025-02-08 13:54:28,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 19 remaining) [2025-02-08 13:54:28,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 19 remaining) [2025-02-08 13:54:28,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 19 remaining) [2025-02-08 13:54:28,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 19 remaining) [2025-02-08 13:54:28,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 19 remaining) [2025-02-08 13:54:28,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 19 remaining) [2025-02-08 13:54:28,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 19 remaining) [2025-02-08 13:54:28,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-08 13:54:28,214 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1] [2025-02-08 13:54:28,214 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 13:54:28,214 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-02-08 13:54:28,245 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 13:54:28,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 103 transitions, 234 flow [2025-02-08 13:54:28,256 INFO L124 PetriNetUnfolderBase]: 9/114 cut-off events. [2025-02-08 13:54:28,256 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-02-08 13:54:28,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 114 events. 9/114 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 348 event pairs, 0 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 96. Up to 5 conditions per place. [2025-02-08 13:54:28,257 INFO L82 GeneralOperation]: Start removeDead. Operand has 103 places, 103 transitions, 234 flow [2025-02-08 13:54:28,258 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 103 places, 103 transitions, 234 flow [2025-02-08 13:54:28,262 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 13:54:28,262 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;@7caa575e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 13:54:28,262 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-02-08 13:54:28,263 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 13:54:28,263 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-02-08 13:54:28,263 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 13:54:28,263 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:28,263 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 13:54:28,263 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-02-08 13:54:28,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:28,263 INFO L85 PathProgramCache]: Analyzing trace with hash 482735, now seen corresponding path program 1 times [2025-02-08 13:54:28,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:28,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547541134] [2025-02-08 13:54:28,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:28,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:28,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 13:54:28,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 13:54:28,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:28,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:28,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:28,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:54:28,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547541134] [2025-02-08 13:54:28,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547541134] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:54:28,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:54:28,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:54:28,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951450926] [2025-02-08 13:54:28,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:54:28,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:54:28,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:54:28,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:54:28,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:54:28,300 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 103 [2025-02-08 13:54:28,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 103 transitions, 234 flow. Second operand has 4 states, 4 states have (on average 42.75) internal successors, (171), 4 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:54:28,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:54:28,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 103 [2025-02-08 13:54:28,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:54:43,290 INFO L124 PetriNetUnfolderBase]: 173791/260014 cut-off events. [2025-02-08 13:54:43,290 INFO L125 PetriNetUnfolderBase]: For 14753/14753 co-relation queries the response was YES. [2025-02-08 13:54:43,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 489305 conditions, 260014 events. 173791/260014 cut-off events. For 14753/14753 co-relation queries the response was YES. Maximal size of possible extension queue 8765. Compared 2313314 event pairs, 156660 based on Foata normal form. 17131/261771 useless extension candidates. Maximal degree in co-relation 85844. Up to 222110 conditions per place. [2025-02-08 13:54:44,918 INFO L140 encePairwiseOnDemand]: 92/103 looper letters, 55 selfloop transitions, 3 changer transitions 0/100 dead transitions. [2025-02-08 13:54:44,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 100 transitions, 344 flow [2025-02-08 13:54:44,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:54:44,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 13:54:44,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 234 transitions. [2025-02-08 13:54:44,920 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5679611650485437 [2025-02-08 13:54:44,920 INFO L175 Difference]: Start difference. First operand has 103 places, 103 transitions, 234 flow. Second operand 4 states and 234 transitions. [2025-02-08 13:54:44,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 100 transitions, 344 flow [2025-02-08 13:54:44,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 100 transitions, 338 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-02-08 13:54:44,930 INFO L231 Difference]: Finished difference. Result has 107 places, 100 transitions, 242 flow [2025-02-08 13:54:44,930 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=103, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=242, PETRI_PLACES=107, PETRI_TRANSITIONS=100} [2025-02-08 13:54:44,930 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, 4 predicate places. [2025-02-08 13:54:44,930 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 100 transitions, 242 flow [2025-02-08 13:54:44,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.75) internal successors, (171), 4 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:54:44,931 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:44,931 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-02-08 13:54:44,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-08 13:54:44,931 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-02-08 13:54:44,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:44,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1496687338, now seen corresponding path program 1 times [2025-02-08 13:54:44,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:44,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124224009] [2025-02-08 13:54:44,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:44,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:44,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:54:44,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:54:44,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:44,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:44,977 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:44,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:54:44,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124224009] [2025-02-08 13:54:44,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124224009] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:54:44,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058440328] [2025-02-08 13:54:44,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:44,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:54:44,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:54:44,981 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:54:44,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-08 13:54:45,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:54:45,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:54:45,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:45,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:45,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 13:54:45,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:54:45,092 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:45,092 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:54:45,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058440328] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:54:45,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:54:45,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-02-08 13:54:45,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268040880] [2025-02-08 13:54:45,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:54:45,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 13:54:45,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:54:45,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 13:54:45,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-08 13:54:45,102 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 103 [2025-02-08 13:54:45,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 100 transitions, 242 flow. Second operand has 6 states, 6 states have (on average 42.833333333333336) internal successors, (257), 6 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:54:45,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:54:45,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 103 [2025-02-08 13:54:45,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand