./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/pthread/queue_longer.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread/queue_longer.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9f874a9872f93f025fac23ebed37f94a1f3b80bd0133ea4d7e298577c4fec427 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:07:33,908 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:07:33,956 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:07:33,960 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:07:33,961 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:07:33,982 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:07:33,984 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:07:33,984 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:07:33,984 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:07:33,984 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:07:33,985 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:07:33,985 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:07:33,985 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:07:33,985 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:07:33,986 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:07:33,986 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:07:33,986 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:07:33,986 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:07:33,986 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:07:33,986 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:07:33,986 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:07:33,987 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:07:33,987 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:07:33,987 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:07:33,987 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:07:33,987 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:07:33,987 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:07:33,987 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:07:33,987 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:07:33,987 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:07:33,988 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:07:33,988 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:07:33,988 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:07:33,988 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:07:33,988 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:07:33,988 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:07:33,988 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:07:33,989 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:07:33,989 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:07:33,989 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:07:33,989 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:07:33,989 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:07:33,989 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:07:33,989 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:07:33,989 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:07:33,989 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9f874a9872f93f025fac23ebed37f94a1f3b80bd0133ea4d7e298577c4fec427 [2025-03-04 15:07:34,197 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:07:34,204 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:07:34,206 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:07:34,207 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:07:34,207 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:07:34,209 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/queue_longer.i [2025-03-04 15:07:35,370 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a25aece54/9f71455985f94795bcd41821b63e5135/FLAGa8284c6fb [2025-03-04 15:07:35,737 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:07:35,737 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue_longer.i [2025-03-04 15:07:35,751 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a25aece54/9f71455985f94795bcd41821b63e5135/FLAGa8284c6fb [2025-03-04 15:07:35,761 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a25aece54/9f71455985f94795bcd41821b63e5135 [2025-03-04 15:07:35,762 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:07:35,763 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:07:35,764 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:07:35,764 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:07:35,766 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:07:35,767 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:07:35" (1/1) ... [2025-03-04 15:07:35,767 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ff81ca5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:07:35, skipping insertion in model container [2025-03-04 15:07:35,767 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:07:35" (1/1) ... [2025-03-04 15:07:35,796 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:07:36,049 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:07:36,091 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:07:36,141 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:07:36,212 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:07:36,213 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:07:36 WrapperNode [2025-03-04 15:07:36,213 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:07:36,214 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:07:36,214 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:07:36,214 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:07:36,218 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:07:36" (1/1) ... [2025-03-04 15:07:36,234 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:07:36" (1/1) ... [2025-03-04 15:07:36,283 INFO L138 Inliner]: procedures = 274, calls = 859, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 1058 [2025-03-04 15:07:36,284 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:07:36,284 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:07:36,284 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:07:36,285 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:07:36,292 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:07:36" (1/1) ... [2025-03-04 15:07:36,292 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:07:36" (1/1) ... [2025-03-04 15:07:36,303 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:07:36" (1/1) ... [2025-03-04 15:07:36,328 INFO L175 MemorySlicer]: Split 844 memory accesses to 4 slices as follows [2, 5, 403, 434]. 51 percent of accesses are in the largest equivalence class. The 810 initializations are split as follows [2, 5, 400, 403]. The 16 writes are split as follows [0, 0, 2, 14]. [2025-03-04 15:07:36,329 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:07:36" (1/1) ... [2025-03-04 15:07:36,330 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:07:36" (1/1) ... [2025-03-04 15:07:36,362 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:07:36" (1/1) ... [2025-03-04 15:07:36,369 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:07:36" (1/1) ... [2025-03-04 15:07:36,373 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:07:36" (1/1) ... [2025-03-04 15:07:36,379 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:07:36" (1/1) ... [2025-03-04 15:07:36,385 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:07:36,386 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:07:36,386 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:07:36,386 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:07:36,387 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:07:36" (1/1) ... [2025-03-04 15:07:36,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:07:36,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:07:36,412 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 15:07:36,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 15:07:36,430 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-04 15:07:36,430 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-04 15:07:36,430 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-04 15:07:36,430 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-04 15:07:36,431 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 15:07:36,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:07:36,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:07:36,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 15:07:36,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 15:07:36,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:07:36,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:07:36,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 15:07:36,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 15:07:36,431 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 15:07:36,431 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:07:36,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:07:36,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 15:07:36,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 15:07:36,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 15:07:36,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:07:36,432 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:07:36,433 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 15:07:36,525 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:07:36,526 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:07:37,469 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:07:37,470 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:07:42,640 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:07:42,642 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:07:42,642 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:07:42 BoogieIcfgContainer [2025-03-04 15:07:42,642 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:07:42,644 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:07:42,644 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:07:42,647 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:07:42,647 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:07:35" (1/3) ... [2025-03-04 15:07:42,649 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2731fef0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:07:42, skipping insertion in model container [2025-03-04 15:07:42,649 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:07:36" (2/3) ... [2025-03-04 15:07:42,649 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2731fef0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:07:42, skipping insertion in model container [2025-03-04 15:07:42,649 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:07:42" (3/3) ... [2025-03-04 15:07:42,650 INFO L128 eAbstractionObserver]: Analyzing ICFG queue_longer.i [2025-03-04 15:07:42,661 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:07:42,662 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG queue_longer.i that has 3 procedures, 75 locations, 1 initial locations, 2 loop locations, and 18 error locations. [2025-03-04 15:07:42,662 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:07:42,732 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 15:07:42,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 83 transitions, 180 flow [2025-03-04 15:07:42,798 INFO L124 PetriNetUnfolderBase]: 9/81 cut-off events. [2025-03-04 15:07:42,799 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 15:07:42,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 81 events. 9/81 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 210 event pairs, 0 based on Foata normal form. 0/54 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2025-03-04 15:07:42,802 INFO L82 GeneralOperation]: Start removeDead. Operand has 81 places, 83 transitions, 180 flow [2025-03-04 15:07:42,804 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 77 places, 79 transitions, 167 flow [2025-03-04 15:07:42,809 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:07:42,816 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;@104dcec8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:07:42,816 INFO L334 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2025-03-04 15:07:42,834 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:07:42,835 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2025-03-04 15:07:42,835 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:07:42,835 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:07:42,835 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 15:07:42,836 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-04 15:07:42,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:07:42,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1888016666, now seen corresponding path program 1 times [2025-03-04 15:07:42,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:07:42,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794498098] [2025-03-04 15:07:42,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:07:42,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:07:42,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:07:43,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:07:43,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:07:43,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:07:44,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:07:44,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:07:44,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794498098] [2025-03-04 15:07:44,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794498098] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:07:44,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:07:44,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:07:44,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333833895] [2025-03-04 15:07:44,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:07:44,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:07:44,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:07:44,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:07:44,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:07:44,187 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 83 [2025-03-04 15:07:44,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 79 transitions, 167 flow. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 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-03-04 15:07:44,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:07:44,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 83 [2025-03-04 15:07:44,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:07:44,721 INFO L124 PetriNetUnfolderBase]: 1236/2546 cut-off events. [2025-03-04 15:07:44,721 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2025-03-04 15:07:44,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4529 conditions, 2546 events. 1236/2546 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 15940 event pairs, 205 based on Foata normal form. 48/2217 useless extension candidates. Maximal degree in co-relation 4460. Up to 1613 conditions per place. [2025-03-04 15:07:44,736 INFO L140 encePairwiseOnDemand]: 75/83 looper letters, 73 selfloop transitions, 6 changer transitions 0/109 dead transitions. [2025-03-04 15:07:44,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 109 transitions, 391 flow [2025-03-04 15:07:44,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:07:44,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:07:44,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 209 transitions. [2025-03-04 15:07:44,747 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6295180722891566 [2025-03-04 15:07:44,748 INFO L175 Difference]: Start difference. First operand has 77 places, 79 transitions, 167 flow. Second operand 4 states and 209 transitions. [2025-03-04 15:07:44,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 109 transitions, 391 flow [2025-03-04 15:07:44,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 109 transitions, 384 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:07:44,757 INFO L231 Difference]: Finished difference. Result has 80 places, 82 transitions, 202 flow [2025-03-04 15:07:44,758 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=202, PETRI_PLACES=80, PETRI_TRANSITIONS=82} [2025-03-04 15:07:44,761 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 3 predicate places. [2025-03-04 15:07:44,761 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 82 transitions, 202 flow [2025-03-04 15:07:44,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 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-03-04 15:07:44,762 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:07:44,762 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:07:44,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:07:44,762 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-04 15:07:44,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:07:44,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1601027720, now seen corresponding path program 1 times [2025-03-04 15:07:44,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:07:44,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898035252] [2025-03-04 15:07:44,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:07:44,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:07:44,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:07:44,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:07:44,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:07:44,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:07:45,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:07:45,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:07:45,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898035252] [2025-03-04 15:07:45,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898035252] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:07:45,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:07:45,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:07:45,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61335290] [2025-03-04 15:07:45,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:07:45,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:07:45,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:07:45,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:07:45,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:07:45,574 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 83 [2025-03-04 15:07:45,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 82 transitions, 202 flow. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 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-03-04 15:07:45,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:07:45,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 83 [2025-03-04 15:07:45,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:07:46,017 INFO L124 PetriNetUnfolderBase]: 1242/2599 cut-off events. [2025-03-04 15:07:46,017 INFO L125 PetriNetUnfolderBase]: For 456/460 co-relation queries the response was YES. [2025-03-04 15:07:46,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4908 conditions, 2599 events. 1242/2599 cut-off events. For 456/460 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 16708 event pairs, 264 based on Foata normal form. 40/2317 useless extension candidates. Maximal degree in co-relation 4140. Up to 1757 conditions per place. [2025-03-04 15:07:46,030 INFO L140 encePairwiseOnDemand]: 78/83 looper letters, 81 selfloop transitions, 6 changer transitions 0/117 dead transitions. [2025-03-04 15:07:46,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 117 transitions, 456 flow [2025-03-04 15:07:46,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:07:46,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:07:46,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 249 transitions. [2025-03-04 15:07:46,032 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-03-04 15:07:46,032 INFO L175 Difference]: Start difference. First operand has 80 places, 82 transitions, 202 flow. Second operand 5 states and 249 transitions. [2025-03-04 15:07:46,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 117 transitions, 456 flow [2025-03-04 15:07:46,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 117 transitions, 450 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:07:46,035 INFO L231 Difference]: Finished difference. Result has 84 places, 83 transitions, 219 flow [2025-03-04 15:07:46,035 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=219, PETRI_PLACES=84, PETRI_TRANSITIONS=83} [2025-03-04 15:07:46,036 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 7 predicate places. [2025-03-04 15:07:46,036 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 83 transitions, 219 flow [2025-03-04 15:07:46,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 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-03-04 15:07:46,036 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:07:46,036 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:07:46,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 15:07:46,037 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-04 15:07:46,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:07:46,037 INFO L85 PathProgramCache]: Analyzing trace with hash 989420076, now seen corresponding path program 1 times [2025-03-04 15:07:46,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:07:46,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141373686] [2025-03-04 15:07:46,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:07:46,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:07:46,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:07:46,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:07:46,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:07:46,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:07:46,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:07:46,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:07:46,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141373686] [2025-03-04 15:07:46,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141373686] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:07:46,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:07:46,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:07:46,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055756859] [2025-03-04 15:07:46,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:07:46,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:07:46,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:07:46,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:07:46,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:07:46,632 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 83 [2025-03-04 15:07:46,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 83 transitions, 219 flow. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:07:46,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:07:46,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 83 [2025-03-04 15:07:46,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:07:47,129 INFO L124 PetriNetUnfolderBase]: 1322/2709 cut-off events. [2025-03-04 15:07:47,129 INFO L125 PetriNetUnfolderBase]: For 536/554 co-relation queries the response was YES. [2025-03-04 15:07:47,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5217 conditions, 2709 events. 1322/2709 cut-off events. For 536/554 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 17314 event pairs, 266 based on Foata normal form. 44/2399 useless extension candidates. Maximal degree in co-relation 4439. Up to 1803 conditions per place. [2025-03-04 15:07:47,144 INFO L140 encePairwiseOnDemand]: 74/83 looper letters, 102 selfloop transitions, 11 changer transitions 0/143 dead transitions. [2025-03-04 15:07:47,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 143 transitions, 585 flow [2025-03-04 15:07:47,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:07:47,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 15:07:47,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 340 transitions. [2025-03-04 15:07:47,147 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5851979345955249 [2025-03-04 15:07:47,147 INFO L175 Difference]: Start difference. First operand has 84 places, 83 transitions, 219 flow. Second operand 7 states and 340 transitions. [2025-03-04 15:07:47,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 143 transitions, 585 flow [2025-03-04 15:07:47,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 143 transitions, 571 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-03-04 15:07:47,153 INFO L231 Difference]: Finished difference. Result has 90 places, 89 transitions, 274 flow [2025-03-04 15:07:47,153 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=274, PETRI_PLACES=90, PETRI_TRANSITIONS=89} [2025-03-04 15:07:47,154 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 13 predicate places. [2025-03-04 15:07:47,154 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 89 transitions, 274 flow [2025-03-04 15:07:47,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:07:47,155 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:07:47,155 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:07:47,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 15:07:47,155 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-04 15:07:47,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:07:47,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1804963147, now seen corresponding path program 1 times [2025-03-04 15:07:47,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:07:47,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642372727] [2025-03-04 15:07:47,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:07:47,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:07:47,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:07:47,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:07:47,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:07:47,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:07:47,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:07:47,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:07:47,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642372727] [2025-03-04 15:07:47,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642372727] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:07:47,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:07:47,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:07:47,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547059115] [2025-03-04 15:07:47,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:07:47,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:07:47,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:07:47,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:07:47,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:07:47,364 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 83 [2025-03-04 15:07:47,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 89 transitions, 274 flow. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:07:47,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:07:47,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 83 [2025-03-04 15:07:47,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:07:47,701 INFO L124 PetriNetUnfolderBase]: 1023/2391 cut-off events. [2025-03-04 15:07:47,702 INFO L125 PetriNetUnfolderBase]: For 554/554 co-relation queries the response was YES. [2025-03-04 15:07:47,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4362 conditions, 2391 events. 1023/2391 cut-off events. For 554/554 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 14112 event pairs, 483 based on Foata normal form. 41/2131 useless extension candidates. Maximal degree in co-relation 4352. Up to 884 conditions per place. [2025-03-04 15:07:47,715 INFO L140 encePairwiseOnDemand]: 79/83 looper letters, 63 selfloop transitions, 3 changer transitions 0/96 dead transitions. [2025-03-04 15:07:47,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 96 transitions, 370 flow [2025-03-04 15:07:47,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:07:47,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:07:47,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 175 transitions. [2025-03-04 15:07:47,717 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7028112449799196 [2025-03-04 15:07:47,717 INFO L175 Difference]: Start difference. First operand has 90 places, 89 transitions, 274 flow. Second operand 3 states and 175 transitions. [2025-03-04 15:07:47,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 96 transitions, 370 flow [2025-03-04 15:07:47,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 96 transitions, 331 flow, removed 4 selfloop flow, removed 13 redundant places. [2025-03-04 15:07:47,721 INFO L231 Difference]: Finished difference. Result has 74 places, 75 transitions, 167 flow [2025-03-04 15:07:47,721 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=167, PETRI_PLACES=74, PETRI_TRANSITIONS=75} [2025-03-04 15:07:47,721 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, -3 predicate places. [2025-03-04 15:07:47,721 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 75 transitions, 167 flow [2025-03-04 15:07:47,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:07:47,722 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:07:47,722 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:07:47,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 15:07:47,722 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-04 15:07:47,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:07:47,722 INFO L85 PathProgramCache]: Analyzing trace with hash -597161202, now seen corresponding path program 1 times [2025-03-04 15:07:47,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:07:47,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937333574] [2025-03-04 15:07:47,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:07:47,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:07:47,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:07:47,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:07:47,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:07:47,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:07:47,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:07:47,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:07:47,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937333574] [2025-03-04 15:07:47,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937333574] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:07:47,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:07:47,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:07:47,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351391581] [2025-03-04 15:07:47,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:07:47,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:07:47,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:07:47,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:07:47,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:07:47,873 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 83 [2025-03-04 15:07:47,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 75 transitions, 167 flow. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:07:47,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:07:47,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 83 [2025-03-04 15:07:47,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:07:48,394 INFO L124 PetriNetUnfolderBase]: 1890/4146 cut-off events. [2025-03-04 15:07:48,395 INFO L125 PetriNetUnfolderBase]: For 190/190 co-relation queries the response was YES. [2025-03-04 15:07:48,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7399 conditions, 4146 events. 1890/4146 cut-off events. For 190/190 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 26808 event pairs, 949 based on Foata normal form. 138/3773 useless extension candidates. Maximal degree in co-relation 7394. Up to 1977 conditions per place. [2025-03-04 15:07:48,417 INFO L140 encePairwiseOnDemand]: 77/83 looper letters, 112 selfloop transitions, 3 changer transitions 0/143 dead transitions. [2025-03-04 15:07:48,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 143 transitions, 550 flow [2025-03-04 15:07:48,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:07:48,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:07:48,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 251 transitions. [2025-03-04 15:07:48,420 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7560240963855421 [2025-03-04 15:07:48,420 INFO L175 Difference]: Start difference. First operand has 74 places, 75 transitions, 167 flow. Second operand 4 states and 251 transitions. [2025-03-04 15:07:48,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 143 transitions, 550 flow [2025-03-04 15:07:48,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 143 transitions, 544 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:07:48,423 INFO L231 Difference]: Finished difference. Result has 78 places, 77 transitions, 188 flow [2025-03-04 15:07:48,423 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=188, PETRI_PLACES=78, PETRI_TRANSITIONS=77} [2025-03-04 15:07:48,427 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 1 predicate places. [2025-03-04 15:07:48,427 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 77 transitions, 188 flow [2025-03-04 15:07:48,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:07:48,427 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:07:48,427 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:07:48,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:07:48,427 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-04 15:07:48,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:07:48,428 INFO L85 PathProgramCache]: Analyzing trace with hash -712344046, now seen corresponding path program 1 times [2025-03-04 15:07:48,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:07:48,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128560458] [2025-03-04 15:07:48,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:07:48,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:07:48,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 15:07:48,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 15:07:48,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:07:48,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:07:48,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:07:48,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:07:48,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128560458] [2025-03-04 15:07:48,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128560458] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:07:48,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:07:48,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:07:48,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505032305] [2025-03-04 15:07:48,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:07:48,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:07:48,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:07:48,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:07:48,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:07:48,919 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 83 [2025-03-04 15:07:48,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 77 transitions, 188 flow. Second operand has 5 states, 5 states have (on average 38.8) internal successors, (194), 5 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:07:48,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:07:48,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 83 [2025-03-04 15:07:48,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:07:49,325 INFO L124 PetriNetUnfolderBase]: 1823/4036 cut-off events. [2025-03-04 15:07:49,325 INFO L125 PetriNetUnfolderBase]: For 832/960 co-relation queries the response was YES. [2025-03-04 15:07:49,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7759 conditions, 4036 events. 1823/4036 cut-off events. For 832/960 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 26310 event pairs, 263 based on Foata normal form. 0/3590 useless extension candidates. Maximal degree in co-relation 7752. Up to 2417 conditions per place. [2025-03-04 15:07:49,342 INFO L140 encePairwiseOnDemand]: 73/83 looper letters, 88 selfloop transitions, 9 changer transitions 0/127 dead transitions. [2025-03-04 15:07:49,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 127 transitions, 558 flow [2025-03-04 15:07:49,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:07:49,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:07:49,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 303 transitions. [2025-03-04 15:07:49,343 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.608433734939759 [2025-03-04 15:07:49,343 INFO L175 Difference]: Start difference. First operand has 78 places, 77 transitions, 188 flow. Second operand 6 states and 303 transitions. [2025-03-04 15:07:49,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 127 transitions, 558 flow [2025-03-04 15:07:49,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 127 transitions, 548 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:07:49,346 INFO L231 Difference]: Finished difference. Result has 83 places, 79 transitions, 220 flow [2025-03-04 15:07:49,346 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=220, PETRI_PLACES=83, PETRI_TRANSITIONS=79} [2025-03-04 15:07:49,346 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 6 predicate places. [2025-03-04 15:07:49,346 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 79 transitions, 220 flow [2025-03-04 15:07:49,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.8) internal successors, (194), 5 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:07:49,347 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:07:49,347 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:07:49,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 15:07:49,347 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-04 15:07:49,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:07:49,347 INFO L85 PathProgramCache]: Analyzing trace with hash 992093941, now seen corresponding path program 1 times [2025-03-04 15:07:49,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:07:49,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652464737] [2025-03-04 15:07:49,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:07:49,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:07:49,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 15:07:49,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:07:49,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:07:49,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:07:50,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:07:50,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:07:50,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652464737] [2025-03-04 15:07:50,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652464737] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:07:50,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:07:50,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 15:07:50,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880262081] [2025-03-04 15:07:50,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:07:50,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 15:07:50,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:07:50,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 15:07:50,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:07:50,880 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 83 [2025-03-04 15:07:50,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 79 transitions, 220 flow. Second operand has 8 states, 8 states have (on average 30.0) internal successors, (240), 8 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:07:50,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:07:50,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 83 [2025-03-04 15:07:50,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:07:51,602 INFO L124 PetriNetUnfolderBase]: 2417/5007 cut-off events. [2025-03-04 15:07:51,602 INFO L125 PetriNetUnfolderBase]: For 1219/1379 co-relation queries the response was YES. [2025-03-04 15:07:51,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10434 conditions, 5007 events. 2417/5007 cut-off events. For 1219/1379 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 32847 event pairs, 444 based on Foata normal form. 22/4553 useless extension candidates. Maximal degree in co-relation 10426. Up to 2624 conditions per place. [2025-03-04 15:07:51,622 INFO L140 encePairwiseOnDemand]: 74/83 looper letters, 137 selfloop transitions, 8 changer transitions 0/171 dead transitions. [2025-03-04 15:07:51,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 171 transitions, 815 flow [2025-03-04 15:07:51,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 15:07:51,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 15:07:51,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 378 transitions. [2025-03-04 15:07:51,624 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5060240963855421 [2025-03-04 15:07:51,624 INFO L175 Difference]: Start difference. First operand has 83 places, 79 transitions, 220 flow. Second operand 9 states and 378 transitions. [2025-03-04 15:07:51,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 171 transitions, 815 flow [2025-03-04 15:07:51,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 171 transitions, 803 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 15:07:51,628 INFO L231 Difference]: Finished difference. Result has 90 places, 82 transitions, 245 flow [2025-03-04 15:07:51,628 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=245, PETRI_PLACES=90, PETRI_TRANSITIONS=82} [2025-03-04 15:07:51,628 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 13 predicate places. [2025-03-04 15:07:51,628 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 82 transitions, 245 flow [2025-03-04 15:07:51,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 30.0) internal successors, (240), 8 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:07:51,629 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:07:51,629 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:07:51,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 15:07:51,629 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-04 15:07:51,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:07:51,629 INFO L85 PathProgramCache]: Analyzing trace with hash -2143017277, now seen corresponding path program 1 times [2025-03-04 15:07:51,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:07:51,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85089495] [2025-03-04 15:07:51,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:07:51,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:07:51,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 15:07:51,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:07:51,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:07:51,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:07:51,751 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:07:51,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:07:51,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85089495] [2025-03-04 15:07:51,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85089495] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:07:51,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412500977] [2025-03-04 15:07:51,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:07:51,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:07:51,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:07:51,753 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:07:51,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 15:07:51,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 15:07:51,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:07:51,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:07:51,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:07:51,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 1762 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:07:51,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:07:52,030 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:07:52,030 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:07:52,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1412500977] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:07:52,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:07:52,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-04 15:07:52,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497892438] [2025-03-04 15:07:52,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:07:52,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:07:52,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:07:52,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:07:52,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:07:52,039 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 83 [2025-03-04 15:07:52,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 82 transitions, 245 flow. Second operand has 6 states, 6 states have (on average 36.166666666666664) internal successors, (217), 6 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:07:52,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:07:52,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 83 [2025-03-04 15:07:52,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:07:52,613 INFO L124 PetriNetUnfolderBase]: 1958/4225 cut-off events. [2025-03-04 15:07:52,613 INFO L125 PetriNetUnfolderBase]: For 1252/1322 co-relation queries the response was YES. [2025-03-04 15:07:52,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8970 conditions, 4225 events. 1958/4225 cut-off events. For 1252/1322 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 27960 event pairs, 120 based on Foata normal form. 87/4003 useless extension candidates. Maximal degree in co-relation 8960. Up to 1289 conditions per place. [2025-03-04 15:07:52,630 INFO L140 encePairwiseOnDemand]: 79/83 looper letters, 181 selfloop transitions, 5 changer transitions 0/215 dead transitions. [2025-03-04 15:07:52,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 215 transitions, 1037 flow [2025-03-04 15:07:52,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:07:52,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:07:52,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 367 transitions. [2025-03-04 15:07:52,631 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7369477911646586 [2025-03-04 15:07:52,631 INFO L175 Difference]: Start difference. First operand has 90 places, 82 transitions, 245 flow. Second operand 6 states and 367 transitions. [2025-03-04 15:07:52,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 215 transitions, 1037 flow [2025-03-04 15:07:52,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 215 transitions, 1001 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 15:07:52,636 INFO L231 Difference]: Finished difference. Result has 90 places, 81 transitions, 243 flow [2025-03-04 15:07:52,636 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=243, PETRI_PLACES=90, PETRI_TRANSITIONS=81} [2025-03-04 15:07:52,637 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 13 predicate places. [2025-03-04 15:07:52,637 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 81 transitions, 243 flow [2025-03-04 15:07:52,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 36.166666666666664) internal successors, (217), 6 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:07:52,637 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:07:52,637 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:07:52,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 15:07:52,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:07:52,838 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-04 15:07:52,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:07:52,838 INFO L85 PathProgramCache]: Analyzing trace with hash 690143348, now seen corresponding path program 1 times [2025-03-04 15:07:52,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:07:52,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428514617] [2025-03-04 15:07:52,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:07:52,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:07:52,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 15:07:52,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 15:07:52,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:07:52,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:07:54,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:07:54,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:07:54,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428514617] [2025-03-04 15:07:54,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428514617] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:07:54,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:07:54,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 15:07:54,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356631666] [2025-03-04 15:07:54,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:07:54,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 15:07:54,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:07:54,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 15:07:54,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:07:54,234 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 83 [2025-03-04 15:07:54,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 81 transitions, 243 flow. Second operand has 8 states, 8 states have (on average 30.0) internal successors, (240), 8 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:07:54,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:07:54,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 83 [2025-03-04 15:07:54,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:07:54,829 INFO L124 PetriNetUnfolderBase]: 2385/4933 cut-off events. [2025-03-04 15:07:54,829 INFO L125 PetriNetUnfolderBase]: For 2620/2696 co-relation queries the response was YES. [2025-03-04 15:07:54,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11034 conditions, 4933 events. 2385/4933 cut-off events. For 2620/2696 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 32350 event pairs, 444 based on Foata normal form. 22/4550 useless extension candidates. Maximal degree in co-relation 11023. Up to 2624 conditions per place. [2025-03-04 15:07:54,845 INFO L140 encePairwiseOnDemand]: 74/83 looper letters, 136 selfloop transitions, 8 changer transitions 0/169 dead transitions. [2025-03-04 15:07:54,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 169 transitions, 896 flow [2025-03-04 15:07:54,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 15:07:54,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 15:07:54,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 377 transitions. [2025-03-04 15:07:54,847 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5046854082998661 [2025-03-04 15:07:54,847 INFO L175 Difference]: Start difference. First operand has 90 places, 81 transitions, 243 flow. Second operand 9 states and 377 transitions. [2025-03-04 15:07:54,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 169 transitions, 896 flow [2025-03-04 15:07:54,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 169 transitions, 853 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 15:07:54,850 INFO L231 Difference]: Finished difference. Result has 94 places, 80 transitions, 247 flow [2025-03-04 15:07:54,850 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=247, PETRI_PLACES=94, PETRI_TRANSITIONS=80} [2025-03-04 15:07:54,851 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 17 predicate places. [2025-03-04 15:07:54,851 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 80 transitions, 247 flow [2025-03-04 15:07:54,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 30.0) internal successors, (240), 8 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:07:54,851 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:07:54,851 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:07:54,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 15:07:54,851 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-04 15:07:54,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:07:54,852 INFO L85 PathProgramCache]: Analyzing trace with hash -2009023864, now seen corresponding path program 1 times [2025-03-04 15:07:54,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:07:54,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597117624] [2025-03-04 15:07:54,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:07:54,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:07:54,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 15:07:54,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 15:07:54,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:07:54,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:07:54,924 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:07:54,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:07:54,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597117624] [2025-03-04 15:07:54,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597117624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:07:54,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:07:54,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:07:54,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560202545] [2025-03-04 15:07:54,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:07:54,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:07:54,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:07:54,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:07:54,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:07:54,928 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 83 [2025-03-04 15:07:54,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 80 transitions, 247 flow. Second operand has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:07:54,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:07:54,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 83 [2025-03-04 15:07:54,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:07:55,278 INFO L124 PetriNetUnfolderBase]: 2102/4426 cut-off events. [2025-03-04 15:07:55,278 INFO L125 PetriNetUnfolderBase]: For 1803/1847 co-relation queries the response was YES. [2025-03-04 15:07:55,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9696 conditions, 4426 events. 2102/4426 cut-off events. For 1803/1847 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 28879 event pairs, 394 based on Foata normal form. 87/4256 useless extension candidates. Maximal degree in co-relation 9685. Up to 2113 conditions per place. [2025-03-04 15:07:55,293 INFO L140 encePairwiseOnDemand]: 78/83 looper letters, 103 selfloop transitions, 6 changer transitions 6/142 dead transitions. [2025-03-04 15:07:55,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 142 transitions, 679 flow [2025-03-04 15:07:55,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:07:55,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:07:55,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 232 transitions. [2025-03-04 15:07:55,294 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6987951807228916 [2025-03-04 15:07:55,294 INFO L175 Difference]: Start difference. First operand has 94 places, 80 transitions, 247 flow. Second operand 4 states and 232 transitions. [2025-03-04 15:07:55,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 142 transitions, 679 flow [2025-03-04 15:07:55,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 142 transitions, 641 flow, removed 1 selfloop flow, removed 7 redundant places. [2025-03-04 15:07:55,299 INFO L231 Difference]: Finished difference. Result has 90 places, 78 transitions, 243 flow [2025-03-04 15:07:55,299 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=243, PETRI_PLACES=90, PETRI_TRANSITIONS=78} [2025-03-04 15:07:55,299 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 13 predicate places. [2025-03-04 15:07:55,299 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 78 transitions, 243 flow [2025-03-04 15:07:55,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:07:55,299 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:07:55,300 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:07:55,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 15:07:55,300 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-04 15:07:55,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:07:55,300 INFO L85 PathProgramCache]: Analyzing trace with hash -80421192, now seen corresponding path program 1 times [2025-03-04 15:07:55,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:07:55,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321270557] [2025-03-04 15:07:55,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:07:55,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:07:55,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 15:07:55,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 15:07:55,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:07:55,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:07:55,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:07:55,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:07:55,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321270557] [2025-03-04 15:07:55,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321270557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:07:55,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:07:55,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:07:55,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050848638] [2025-03-04 15:07:55,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:07:55,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:07:55,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:07:55,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:07:55,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:07:55,411 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 83 [2025-03-04 15:07:55,411 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 78 transitions, 243 flow. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:07:55,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:07:55,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 83 [2025-03-04 15:07:55,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:07:55,827 INFO L124 PetriNetUnfolderBase]: 2969/6064 cut-off events. [2025-03-04 15:07:55,827 INFO L125 PetriNetUnfolderBase]: For 3940/3950 co-relation queries the response was YES. [2025-03-04 15:07:55,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14003 conditions, 6064 events. 2969/6064 cut-off events. For 3940/3950 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 41810 event pairs, 1613 based on Foata normal form. 144/5904 useless extension candidates. Maximal degree in co-relation 13992. Up to 3799 conditions per place. [2025-03-04 15:07:55,848 INFO L140 encePairwiseOnDemand]: 75/83 looper letters, 96 selfloop transitions, 3 changer transitions 0/124 dead transitions. [2025-03-04 15:07:55,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 124 transitions, 625 flow [2025-03-04 15:07:55,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:07:55,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:07:55,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 219 transitions. [2025-03-04 15:07:55,850 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6596385542168675 [2025-03-04 15:07:55,850 INFO L175 Difference]: Start difference. First operand has 90 places, 78 transitions, 243 flow. Second operand 4 states and 219 transitions. [2025-03-04 15:07:55,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 124 transitions, 625 flow [2025-03-04 15:07:55,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 124 transitions, 603 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:07:55,855 INFO L231 Difference]: Finished difference. Result has 92 places, 80 transitions, 263 flow [2025-03-04 15:07:55,855 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=263, PETRI_PLACES=92, PETRI_TRANSITIONS=80} [2025-03-04 15:07:55,855 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 15 predicate places. [2025-03-04 15:07:55,855 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 80 transitions, 263 flow [2025-03-04 15:07:55,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:07:55,855 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:07:55,856 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:07:55,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 15:07:55,856 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-04 15:07:55,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:07:55,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1802867898, now seen corresponding path program 1 times [2025-03-04 15:07:55,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:07:55,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486558906] [2025-03-04 15:07:55,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:07:55,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:07:55,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 15:07:55,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 15:07:55,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:07:55,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:07:56,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:07:56,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:07:56,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486558906] [2025-03-04 15:07:56,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486558906] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:07:56,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:07:56,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 15:07:56,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763132753] [2025-03-04 15:07:56,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:07:56,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 15:07:56,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:07:56,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 15:07:56,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:07:56,658 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 83 [2025-03-04 15:07:56,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 80 transitions, 263 flow. Second operand has 8 states, 8 states have (on average 34.25) internal successors, (274), 8 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:07:56,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:07:56,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 83 [2025-03-04 15:07:56,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:07:57,407 INFO L124 PetriNetUnfolderBase]: 2889/6035 cut-off events. [2025-03-04 15:07:57,408 INFO L125 PetriNetUnfolderBase]: For 2846/2912 co-relation queries the response was YES. [2025-03-04 15:07:57,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14215 conditions, 6035 events. 2889/6035 cut-off events. For 2846/2912 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 42210 event pairs, 484 based on Foata normal form. 44/5813 useless extension candidates. Maximal degree in co-relation 14201. Up to 2574 conditions per place. [2025-03-04 15:07:57,428 INFO L140 encePairwiseOnDemand]: 68/83 looper letters, 147 selfloop transitions, 15 changer transitions 2/191 dead transitions. [2025-03-04 15:07:57,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 191 transitions, 1027 flow [2025-03-04 15:07:57,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:07:57,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 15:07:57,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 461 transitions. [2025-03-04 15:07:57,430 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.555421686746988 [2025-03-04 15:07:57,430 INFO L175 Difference]: Start difference. First operand has 92 places, 80 transitions, 263 flow. Second operand 10 states and 461 transitions. [2025-03-04 15:07:57,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 191 transitions, 1027 flow [2025-03-04 15:07:57,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 191 transitions, 1024 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:07:57,436 INFO L231 Difference]: Finished difference. Result has 103 places, 85 transitions, 334 flow [2025-03-04 15:07:57,436 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=334, PETRI_PLACES=103, PETRI_TRANSITIONS=85} [2025-03-04 15:07:57,436 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 26 predicate places. [2025-03-04 15:07:57,436 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 85 transitions, 334 flow [2025-03-04 15:07:57,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 34.25) internal successors, (274), 8 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:07:57,437 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:07:57,437 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:07:57,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 15:07:57,437 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-04 15:07:57,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:07:57,437 INFO L85 PathProgramCache]: Analyzing trace with hash 54332250, now seen corresponding path program 1 times [2025-03-04 15:07:57,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:07:57,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983098296] [2025-03-04 15:07:57,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:07:57,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:07:57,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 15:07:57,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 15:07:57,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:07:57,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:07:58,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:07:58,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:07:58,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983098296] [2025-03-04 15:07:58,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983098296] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:07:58,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:07:58,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 15:07:58,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812839005] [2025-03-04 15:07:58,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:07:58,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 15:07:58,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:07:58,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 15:07:58,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:07:58,167 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 83 [2025-03-04 15:07:58,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 85 transitions, 334 flow. Second operand has 8 states, 8 states have (on average 34.25) internal successors, (274), 8 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:07:58,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:07:58,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 83 [2025-03-04 15:07:58,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:07:58,791 INFO L124 PetriNetUnfolderBase]: 2825/5929 cut-off events. [2025-03-04 15:07:58,792 INFO L125 PetriNetUnfolderBase]: For 3970/4036 co-relation queries the response was YES. [2025-03-04 15:07:58,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15039 conditions, 5929 events. 2825/5929 cut-off events. For 3970/4036 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 41419 event pairs, 518 based on Foata normal form. 44/5811 useless extension candidates. Maximal degree in co-relation 15023. Up to 2837 conditions per place. [2025-03-04 15:07:58,813 INFO L140 encePairwiseOnDemand]: 69/83 looper letters, 131 selfloop transitions, 13 changer transitions 2/173 dead transitions. [2025-03-04 15:07:58,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 173 transitions, 978 flow [2025-03-04 15:07:58,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 15:07:58,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 15:07:58,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 413 transitions. [2025-03-04 15:07:58,814 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5528781793842035 [2025-03-04 15:07:58,815 INFO L175 Difference]: Start difference. First operand has 103 places, 85 transitions, 334 flow. Second operand 9 states and 413 transitions. [2025-03-04 15:07:58,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 173 transitions, 978 flow [2025-03-04 15:07:58,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 173 transitions, 966 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 15:07:58,823 INFO L231 Difference]: Finished difference. Result has 106 places, 84 transitions, 344 flow [2025-03-04 15:07:58,823 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=344, PETRI_PLACES=106, PETRI_TRANSITIONS=84} [2025-03-04 15:07:58,824 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 29 predicate places. [2025-03-04 15:07:58,824 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 84 transitions, 344 flow [2025-03-04 15:07:58,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 34.25) internal successors, (274), 8 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:07:58,824 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:07:58,824 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:07:58,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 15:07:58,824 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-04 15:07:58,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:07:58,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1731141011, now seen corresponding path program 1 times [2025-03-04 15:07:58,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:07:58,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933016188] [2025-03-04 15:07:58,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:07:58,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:07:58,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 15:07:58,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 15:07:58,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:07:58,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:07:58,944 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:07:58,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:07:58,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933016188] [2025-03-04 15:07:58,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933016188] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:07:58,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967782619] [2025-03-04 15:07:58,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:07:58,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:07:58,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:07:58,947 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:07:58,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 15:07:59,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 15:07:59,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 15:07:59,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:07:59,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:07:59,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 1820 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:07:59,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:07:59,175 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:07:59,175 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:07:59,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967782619] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:07:59,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:07:59,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-03-04 15:07:59,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895528604] [2025-03-04 15:07:59,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:07:59,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:07:59,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:07:59,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:07:59,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-04 15:07:59,185 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 83 [2025-03-04 15:07:59,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 84 transitions, 344 flow. Second operand has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:07:59,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:07:59,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 83 [2025-03-04 15:07:59,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:07:59,685 INFO L124 PetriNetUnfolderBase]: 3112/6123 cut-off events. [2025-03-04 15:07:59,685 INFO L125 PetriNetUnfolderBase]: For 4392/4426 co-relation queries the response was YES. [2025-03-04 15:07:59,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16067 conditions, 6123 events. 3112/6123 cut-off events. For 4392/4426 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 40781 event pairs, 692 based on Foata normal form. 150/6027 useless extension candidates. Maximal degree in co-relation 16050. Up to 3380 conditions per place. [2025-03-04 15:07:59,706 INFO L140 encePairwiseOnDemand]: 78/83 looper letters, 81 selfloop transitions, 5 changer transitions 0/110 dead transitions. [2025-03-04 15:07:59,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 110 transitions, 618 flow [2025-03-04 15:07:59,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:07:59,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:07:59,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 194 transitions. [2025-03-04 15:07:59,707 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5843373493975904 [2025-03-04 15:07:59,707 INFO L175 Difference]: Start difference. First operand has 106 places, 84 transitions, 344 flow. Second operand 4 states and 194 transitions. [2025-03-04 15:07:59,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 110 transitions, 618 flow [2025-03-04 15:07:59,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 110 transitions, 598 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-03-04 15:07:59,715 INFO L231 Difference]: Finished difference. Result has 100 places, 82 transitions, 326 flow [2025-03-04 15:07:59,715 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=326, PETRI_PLACES=100, PETRI_TRANSITIONS=82} [2025-03-04 15:07:59,716 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 23 predicate places. [2025-03-04 15:07:59,716 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 82 transitions, 326 flow [2025-03-04 15:07:59,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:07:59,716 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:07:59,716 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:07:59,724 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 15:07:59,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-04 15:07:59,917 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-04 15:07:59,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:07:59,917 INFO L85 PathProgramCache]: Analyzing trace with hash -2125761534, now seen corresponding path program 1 times [2025-03-04 15:07:59,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:07:59,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75256590] [2025-03-04 15:07:59,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:07:59,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:07:59,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 15:07:59,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 15:07:59,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:07:59,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:07:59,997 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:07:59,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:07:59,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75256590] [2025-03-04 15:07:59,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75256590] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:07:59,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:07:59,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:07:59,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120888237] [2025-03-04 15:07:59,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:07:59,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:07:59,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:07:59,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:07:59,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:08:00,011 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 83 [2025-03-04 15:08:00,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 82 transitions, 326 flow. Second operand has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:00,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:00,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 83 [2025-03-04 15:08:00,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:00,466 INFO L124 PetriNetUnfolderBase]: 2756/5657 cut-off events. [2025-03-04 15:08:00,466 INFO L125 PetriNetUnfolderBase]: For 4259/4279 co-relation queries the response was YES. [2025-03-04 15:08:00,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14718 conditions, 5657 events. 2756/5657 cut-off events. For 4259/4279 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 38134 event pairs, 736 based on Foata normal form. 150/5667 useless extension candidates. Maximal degree in co-relation 14701. Up to 2857 conditions per place. [2025-03-04 15:08:00,487 INFO L140 encePairwiseOnDemand]: 77/83 looper letters, 85 selfloop transitions, 6 changer transitions 0/115 dead transitions. [2025-03-04 15:08:00,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 115 transitions, 632 flow [2025-03-04 15:08:00,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:08:00,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:08:00,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 199 transitions. [2025-03-04 15:08:00,488 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5993975903614458 [2025-03-04 15:08:00,488 INFO L175 Difference]: Start difference. First operand has 100 places, 82 transitions, 326 flow. Second operand 4 states and 199 transitions. [2025-03-04 15:08:00,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 115 transitions, 632 flow [2025-03-04 15:08:00,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 115 transitions, 622 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:08:00,496 INFO L231 Difference]: Finished difference. Result has 99 places, 81 transitions, 328 flow [2025-03-04 15:08:00,496 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=328, PETRI_PLACES=99, PETRI_TRANSITIONS=81} [2025-03-04 15:08:00,497 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 22 predicate places. [2025-03-04 15:08:00,497 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 81 transitions, 328 flow [2025-03-04 15:08:00,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:00,497 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:00,497 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:00,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 15:08:00,497 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-04 15:08:00,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:00,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1488322251, now seen corresponding path program 1 times [2025-03-04 15:08:00,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:00,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257085319] [2025-03-04 15:08:00,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:00,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:00,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 15:08:00,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 15:08:00,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:00,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:00,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:00,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:00,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257085319] [2025-03-04 15:08:00,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257085319] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:00,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:08:00,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:08:00,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977971608] [2025-03-04 15:08:00,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:00,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:08:00,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:00,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:08:00,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:08:00,625 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 83 [2025-03-04 15:08:00,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 81 transitions, 328 flow. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:00,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:00,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 83 [2025-03-04 15:08:00,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:00,899 INFO L124 PetriNetUnfolderBase]: 1742/3959 cut-off events. [2025-03-04 15:08:00,899 INFO L125 PetriNetUnfolderBase]: For 3964/3964 co-relation queries the response was YES. [2025-03-04 15:08:00,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10637 conditions, 3959 events. 1742/3959 cut-off events. For 3964/3964 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 25916 event pairs, 514 based on Foata normal form. 168/4049 useless extension candidates. Maximal degree in co-relation 10620. Up to 1962 conditions per place. [2025-03-04 15:08:00,913 INFO L140 encePairwiseOnDemand]: 77/83 looper letters, 64 selfloop transitions, 6 changer transitions 0/96 dead transitions. [2025-03-04 15:08:00,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 96 transitions, 535 flow [2025-03-04 15:08:00,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:08:00,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:08:00,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 165 transitions. [2025-03-04 15:08:00,914 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6626506024096386 [2025-03-04 15:08:00,914 INFO L175 Difference]: Start difference. First operand has 99 places, 81 transitions, 328 flow. Second operand 3 states and 165 transitions. [2025-03-04 15:08:00,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 96 transitions, 535 flow [2025-03-04 15:08:00,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 96 transitions, 516 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-04 15:08:00,920 INFO L231 Difference]: Finished difference. Result has 99 places, 79 transitions, 310 flow [2025-03-04 15:08:00,920 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=310, PETRI_PLACES=99, PETRI_TRANSITIONS=79} [2025-03-04 15:08:00,920 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 22 predicate places. [2025-03-04 15:08:00,920 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 79 transitions, 310 flow [2025-03-04 15:08:00,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:00,921 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:00,921 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:00,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 15:08:00,921 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-04 15:08:00,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:00,921 INFO L85 PathProgramCache]: Analyzing trace with hash -2081050219, now seen corresponding path program 1 times [2025-03-04 15:08:00,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:00,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126434686] [2025-03-04 15:08:00,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:00,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:00,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 15:08:00,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 15:08:00,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:00,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:01,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:01,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:01,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126434686] [2025-03-04 15:08:01,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126434686] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:01,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:08:01,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 15:08:01,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253003905] [2025-03-04 15:08:01,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:01,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 15:08:01,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:01,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 15:08:01,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:08:01,777 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 83 [2025-03-04 15:08:01,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 79 transitions, 310 flow. Second operand has 8 states, 8 states have (on average 35.125) internal successors, (281), 8 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:01,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:01,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 83 [2025-03-04 15:08:01,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:02,294 INFO L124 PetriNetUnfolderBase]: 1776/3898 cut-off events. [2025-03-04 15:08:02,295 INFO L125 PetriNetUnfolderBase]: For 3454/3456 co-relation queries the response was YES. [2025-03-04 15:08:02,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10657 conditions, 3898 events. 1776/3898 cut-off events. For 3454/3456 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 24559 event pairs, 316 based on Foata normal form. 36/3842 useless extension candidates. Maximal degree in co-relation 10639. Up to 1804 conditions per place. [2025-03-04 15:08:02,308 INFO L140 encePairwiseOnDemand]: 73/83 looper letters, 109 selfloop transitions, 9 changer transitions 2/144 dead transitions. [2025-03-04 15:08:02,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 144 transitions, 843 flow [2025-03-04 15:08:02,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 15:08:02,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 15:08:02,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 356 transitions. [2025-03-04 15:08:02,309 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.536144578313253 [2025-03-04 15:08:02,309 INFO L175 Difference]: Start difference. First operand has 99 places, 79 transitions, 310 flow. Second operand 8 states and 356 transitions. [2025-03-04 15:08:02,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 144 transitions, 843 flow [2025-03-04 15:08:02,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 144 transitions, 826 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:08:02,316 INFO L231 Difference]: Finished difference. Result has 104 places, 78 transitions, 311 flow [2025-03-04 15:08:02,316 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=311, PETRI_PLACES=104, PETRI_TRANSITIONS=78} [2025-03-04 15:08:02,316 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 27 predicate places. [2025-03-04 15:08:02,316 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 78 transitions, 311 flow [2025-03-04 15:08:02,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 35.125) internal successors, (281), 8 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:02,317 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:02,317 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:02,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 15:08:02,317 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-04 15:08:02,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:02,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1254290162, now seen corresponding path program 1 times [2025-03-04 15:08:02,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:02,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893815518] [2025-03-04 15:08:02,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:02,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:02,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 15:08:02,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 15:08:02,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:02,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:03,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:03,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:03,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893815518] [2025-03-04 15:08:03,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893815518] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:03,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:08:03,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 15:08:03,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863882050] [2025-03-04 15:08:03,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:03,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 15:08:03,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:03,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 15:08:03,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-04 15:08:03,766 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 83 [2025-03-04 15:08:03,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 78 transitions, 311 flow. Second operand has 10 states, 10 states have (on average 31.7) internal successors, (317), 10 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:03,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:03,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 83 [2025-03-04 15:08:03,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:04,447 INFO L124 PetriNetUnfolderBase]: 2162/4620 cut-off events. [2025-03-04 15:08:04,447 INFO L125 PetriNetUnfolderBase]: For 4212/4214 co-relation queries the response was YES. [2025-03-04 15:08:04,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12508 conditions, 4620 events. 2162/4620 cut-off events. For 4212/4214 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 29261 event pairs, 213 based on Foata normal form. 0/4488 useless extension candidates. Maximal degree in co-relation 12489. Up to 1544 conditions per place. [2025-03-04 15:08:04,467 INFO L140 encePairwiseOnDemand]: 72/83 looper letters, 146 selfloop transitions, 12 changer transitions 2/181 dead transitions. [2025-03-04 15:08:04,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 181 transitions, 1074 flow [2025-03-04 15:08:04,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 15:08:04,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 15:08:04,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 454 transitions. [2025-03-04 15:08:04,468 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49726177437020813 [2025-03-04 15:08:04,468 INFO L175 Difference]: Start difference. First operand has 104 places, 78 transitions, 311 flow. Second operand 11 states and 454 transitions. [2025-03-04 15:08:04,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 181 transitions, 1074 flow [2025-03-04 15:08:04,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 181 transitions, 1058 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 15:08:04,476 INFO L231 Difference]: Finished difference. Result has 111 places, 82 transitions, 349 flow [2025-03-04 15:08:04,476 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=349, PETRI_PLACES=111, PETRI_TRANSITIONS=82} [2025-03-04 15:08:04,476 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 34 predicate places. [2025-03-04 15:08:04,476 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 82 transitions, 349 flow [2025-03-04 15:08:04,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 31.7) internal successors, (317), 10 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:04,476 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:04,476 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:04,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 15:08:04,476 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-04 15:08:04,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:04,477 INFO L85 PathProgramCache]: Analyzing trace with hash 635254112, now seen corresponding path program 1 times [2025-03-04 15:08:04,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:04,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222312813] [2025-03-04 15:08:04,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:04,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:04,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 15:08:04,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 15:08:04,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:04,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:04,628 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:04,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:04,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222312813] [2025-03-04 15:08:04,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222312813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:04,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:08:04,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:08:04,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684845096] [2025-03-04 15:08:04,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:04,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:08:04,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:04,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:08:04,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:08:04,630 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 83 [2025-03-04 15:08:04,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 82 transitions, 349 flow. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:04,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:04,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 83 [2025-03-04 15:08:04,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:05,023 INFO L124 PetriNetUnfolderBase]: 1680/3801 cut-off events. [2025-03-04 15:08:05,023 INFO L125 PetriNetUnfolderBase]: For 3823/3829 co-relation queries the response was YES. [2025-03-04 15:08:05,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10276 conditions, 3801 events. 1680/3801 cut-off events. For 3823/3829 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 23457 event pairs, 1011 based on Foata normal form. 30/3743 useless extension candidates. Maximal degree in co-relation 10255. Up to 1854 conditions per place. [2025-03-04 15:08:05,039 INFO L140 encePairwiseOnDemand]: 80/83 looper letters, 70 selfloop transitions, 2 changer transitions 0/99 dead transitions. [2025-03-04 15:08:05,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 99 transitions, 563 flow [2025-03-04 15:08:05,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:08:05,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:08:05,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 165 transitions. [2025-03-04 15:08:05,040 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6626506024096386 [2025-03-04 15:08:05,040 INFO L175 Difference]: Start difference. First operand has 111 places, 82 transitions, 349 flow. Second operand 3 states and 165 transitions. [2025-03-04 15:08:05,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 99 transitions, 563 flow [2025-03-04 15:08:05,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 99 transitions, 548 flow, removed 1 selfloop flow, removed 6 redundant places. [2025-03-04 15:08:05,046 INFO L231 Difference]: Finished difference. Result has 108 places, 80 transitions, 330 flow [2025-03-04 15:08:05,047 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=330, PETRI_PLACES=108, PETRI_TRANSITIONS=80} [2025-03-04 15:08:05,047 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 31 predicate places. [2025-03-04 15:08:05,047 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 80 transitions, 330 flow [2025-03-04 15:08:05,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:05,047 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:05,047 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:05,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 15:08:05,047 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-04 15:08:05,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:05,048 INFO L85 PathProgramCache]: Analyzing trace with hash 647448155, now seen corresponding path program 1 times [2025-03-04 15:08:05,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:05,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079105333] [2025-03-04 15:08:05,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:05,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:05,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 15:08:05,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 15:08:05,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:05,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:07,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:07,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:07,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079105333] [2025-03-04 15:08:07,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079105333] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:07,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:08:07,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 15:08:07,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466780637] [2025-03-04 15:08:07,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:07,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 15:08:07,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:07,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 15:08:07,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-04 15:08:07,642 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 83 [2025-03-04 15:08:07,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 80 transitions, 330 flow. Second operand has 11 states, 11 states have (on average 28.454545454545453) internal successors, (313), 11 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:07,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:07,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 83 [2025-03-04 15:08:07,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:08,363 INFO L124 PetriNetUnfolderBase]: 1764/3824 cut-off events. [2025-03-04 15:08:08,363 INFO L125 PetriNetUnfolderBase]: For 3590/3590 co-relation queries the response was YES. [2025-03-04 15:08:08,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10483 conditions, 3824 events. 1764/3824 cut-off events. For 3590/3590 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 22916 event pairs, 381 based on Foata normal form. 35/3785 useless extension candidates. Maximal degree in co-relation 10460. Up to 1596 conditions per place. [2025-03-04 15:08:08,374 INFO L140 encePairwiseOnDemand]: 71/83 looper letters, 126 selfloop transitions, 13 changer transitions 10/170 dead transitions. [2025-03-04 15:08:08,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 170 transitions, 1032 flow [2025-03-04 15:08:08,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 15:08:08,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 15:08:08,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 435 transitions. [2025-03-04 15:08:08,376 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4367469879518072 [2025-03-04 15:08:08,376 INFO L175 Difference]: Start difference. First operand has 108 places, 80 transitions, 330 flow. Second operand 12 states and 435 transitions. [2025-03-04 15:08:08,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 170 transitions, 1032 flow [2025-03-04 15:08:08,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 170 transitions, 1028 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:08:08,382 INFO L231 Difference]: Finished difference. Result has 116 places, 79 transitions, 350 flow [2025-03-04 15:08:08,382 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=350, PETRI_PLACES=116, PETRI_TRANSITIONS=79} [2025-03-04 15:08:08,382 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 39 predicate places. [2025-03-04 15:08:08,382 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 79 transitions, 350 flow [2025-03-04 15:08:08,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 28.454545454545453) internal successors, (313), 11 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:08,382 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:08,383 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:08,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 15:08:08,383 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-04 15:08:08,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:08,383 INFO L85 PathProgramCache]: Analyzing trace with hash 345004121, now seen corresponding path program 1 times [2025-03-04 15:08:08,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:08,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238816514] [2025-03-04 15:08:08,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:08,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:08,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 15:08:08,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 15:08:08,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:08,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:09,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:09,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:09,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238816514] [2025-03-04 15:08:09,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238816514] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:09,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:08:09,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 15:08:09,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646943854] [2025-03-04 15:08:09,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:09,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 15:08:09,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:09,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 15:08:09,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-04 15:08:09,901 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 83 [2025-03-04 15:08:09,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 79 transitions, 350 flow. Second operand has 10 states, 10 states have (on average 32.9) internal successors, (329), 10 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:09,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:09,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 83 [2025-03-04 15:08:09,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:10,458 INFO L124 PetriNetUnfolderBase]: 1808/3873 cut-off events. [2025-03-04 15:08:10,459 INFO L125 PetriNetUnfolderBase]: For 4042/4044 co-relation queries the response was YES. [2025-03-04 15:08:10,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10815 conditions, 3873 events. 1808/3873 cut-off events. For 4042/4044 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 22745 event pairs, 265 based on Foata normal form. 26/3833 useless extension candidates. Maximal degree in co-relation 10792. Up to 972 conditions per place. [2025-03-04 15:08:10,473 INFO L140 encePairwiseOnDemand]: 68/83 looper letters, 136 selfloop transitions, 13 changer transitions 16/187 dead transitions. [2025-03-04 15:08:10,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 187 transitions, 1150 flow [2025-03-04 15:08:10,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 15:08:10,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 15:08:10,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 498 transitions. [2025-03-04 15:08:10,474 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-03-04 15:08:10,474 INFO L175 Difference]: Start difference. First operand has 116 places, 79 transitions, 350 flow. Second operand 12 states and 498 transitions. [2025-03-04 15:08:10,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 187 transitions, 1150 flow [2025-03-04 15:08:10,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 187 transitions, 1129 flow, removed 0 selfloop flow, removed 10 redundant places. [2025-03-04 15:08:10,482 INFO L231 Difference]: Finished difference. Result has 120 places, 83 transitions, 384 flow [2025-03-04 15:08:10,482 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=384, PETRI_PLACES=120, PETRI_TRANSITIONS=83} [2025-03-04 15:08:10,482 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 43 predicate places. [2025-03-04 15:08:10,482 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 83 transitions, 384 flow [2025-03-04 15:08:10,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 32.9) internal successors, (329), 10 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:10,482 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:10,483 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:10,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 15:08:10,483 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-04 15:08:10,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:10,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1788655832, now seen corresponding path program 1 times [2025-03-04 15:08:10,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:10,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683226530] [2025-03-04 15:08:10,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:10,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:10,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 15:08:10,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 15:08:10,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:10,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:11,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:11,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:11,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683226530] [2025-03-04 15:08:11,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683226530] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:11,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:08:11,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 15:08:11,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128622500] [2025-03-04 15:08:11,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:11,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 15:08:11,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:11,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 15:08:11,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 15:08:11,094 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 83 [2025-03-04 15:08:11,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 83 transitions, 384 flow. Second operand has 7 states, 7 states have (on average 32.42857142857143) internal successors, (227), 7 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:11,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:11,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 83 [2025-03-04 15:08:11,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:11,576 INFO L124 PetriNetUnfolderBase]: 2048/4307 cut-off events. [2025-03-04 15:08:11,577 INFO L125 PetriNetUnfolderBase]: For 4624/4624 co-relation queries the response was YES. [2025-03-04 15:08:11,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12374 conditions, 4307 events. 2048/4307 cut-off events. For 4624/4624 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 25536 event pairs, 424 based on Foata normal form. 12/4290 useless extension candidates. Maximal degree in co-relation 12348. Up to 1823 conditions per place. [2025-03-04 15:08:11,592 INFO L140 encePairwiseOnDemand]: 70/83 looper letters, 111 selfloop transitions, 20 changer transitions 1/151 dead transitions. [2025-03-04 15:08:11,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 151 transitions, 946 flow [2025-03-04 15:08:11,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 15:08:11,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 15:08:11,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 350 transitions. [2025-03-04 15:08:11,593 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4685408299866131 [2025-03-04 15:08:11,593 INFO L175 Difference]: Start difference. First operand has 120 places, 83 transitions, 384 flow. Second operand 9 states and 350 transitions. [2025-03-04 15:08:11,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 151 transitions, 946 flow [2025-03-04 15:08:11,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 151 transitions, 919 flow, removed 0 selfloop flow, removed 10 redundant places. [2025-03-04 15:08:11,602 INFO L231 Difference]: Finished difference. Result has 117 places, 86 transitions, 420 flow [2025-03-04 15:08:11,602 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=420, PETRI_PLACES=117, PETRI_TRANSITIONS=86} [2025-03-04 15:08:11,602 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 40 predicate places. [2025-03-04 15:08:11,602 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 86 transitions, 420 flow [2025-03-04 15:08:11,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 32.42857142857143) internal successors, (227), 7 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:11,604 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:11,604 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:11,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 15:08:11,605 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-04 15:08:11,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:11,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1114650849, now seen corresponding path program 1 times [2025-03-04 15:08:11,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:11,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545834891] [2025-03-04 15:08:11,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:11,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:11,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 15:08:11,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 15:08:11,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:11,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:13,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:13,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:13,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545834891] [2025-03-04 15:08:13,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545834891] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:13,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:08:13,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 15:08:13,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485007089] [2025-03-04 15:08:13,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:13,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 15:08:13,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:13,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 15:08:13,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-04 15:08:13,168 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 83 [2025-03-04 15:08:13,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 86 transitions, 420 flow. Second operand has 11 states, 11 states have (on average 35.09090909090909) internal successors, (386), 11 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:13,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:13,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 83 [2025-03-04 15:08:13,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:13,896 INFO L124 PetriNetUnfolderBase]: 1894/4120 cut-off events. [2025-03-04 15:08:13,896 INFO L125 PetriNetUnfolderBase]: For 4670/4670 co-relation queries the response was YES. [2025-03-04 15:08:13,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11714 conditions, 4120 events. 1894/4120 cut-off events. For 4670/4670 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 24488 event pairs, 332 based on Foata normal form. 26/4111 useless extension candidates. Maximal degree in co-relation 11689. Up to 1179 conditions per place. [2025-03-04 15:08:13,915 INFO L140 encePairwiseOnDemand]: 69/83 looper letters, 138 selfloop transitions, 13 changer transitions 15/191 dead transitions. [2025-03-04 15:08:13,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 191 transitions, 1218 flow [2025-03-04 15:08:13,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 15:08:13,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 15:08:13,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 519 transitions. [2025-03-04 15:08:13,917 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5210843373493976 [2025-03-04 15:08:13,917 INFO L175 Difference]: Start difference. First operand has 117 places, 86 transitions, 420 flow. Second operand 12 states and 519 transitions. [2025-03-04 15:08:13,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 191 transitions, 1218 flow [2025-03-04 15:08:13,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 191 transitions, 1198 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-03-04 15:08:13,927 INFO L231 Difference]: Finished difference. Result has 124 places, 85 transitions, 422 flow [2025-03-04 15:08:13,927 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=422, PETRI_PLACES=124, PETRI_TRANSITIONS=85} [2025-03-04 15:08:13,927 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 47 predicate places. [2025-03-04 15:08:13,927 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 85 transitions, 422 flow [2025-03-04 15:08:13,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 35.09090909090909) internal successors, (386), 11 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:13,928 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:13,928 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:13,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 15:08:13,928 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-04 15:08:13,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:13,928 INFO L85 PathProgramCache]: Analyzing trace with hash 582155299, now seen corresponding path program 1 times [2025-03-04 15:08:13,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:13,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10603939] [2025-03-04 15:08:13,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:13,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:13,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 15:08:13,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 15:08:13,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:13,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:15,550 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:15,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:15,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10603939] [2025-03-04 15:08:15,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10603939] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:08:15,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461803530] [2025-03-04 15:08:15,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:15,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:08:15,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:08:15,553 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:08:15,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 15:08:15,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 15:08:15,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 15:08:15,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:15,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:15,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 1973 conjuncts, 72 conjuncts are in the unsatisfiable core [2025-03-04 15:08:15,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:08:15,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2025-03-04 15:08:15,968 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 15:08:15,980 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2025-03-04 15:08:15,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 36 [2025-03-04 15:08:16,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-03-04 15:08:16,108 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:08:16,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 32 [2025-03-04 15:08:16,264 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 15:08:16,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 47 [2025-03-04 15:08:16,338 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:08:16,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 30 [2025-03-04 15:08:16,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 42 [2025-03-04 15:08:16,403 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:08:16,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 28 [2025-03-04 15:08:16,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:16,407 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:08:16,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1461803530] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:16,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:08:16,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [12] total 24 [2025-03-04 15:08:16,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164900577] [2025-03-04 15:08:16,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:16,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 15:08:16,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:16,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 15:08:16,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=562, Unknown=0, NotChecked=0, Total=650 [2025-03-04 15:08:16,470 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 83 [2025-03-04 15:08:16,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 85 transitions, 422 flow. Second operand has 15 states, 15 states have (on average 29.4) internal successors, (441), 15 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:16,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:16,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 83 [2025-03-04 15:08:16,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:17,458 INFO L124 PetriNetUnfolderBase]: 1855/4073 cut-off events. [2025-03-04 15:08:17,458 INFO L125 PetriNetUnfolderBase]: For 4828/4828 co-relation queries the response was YES. [2025-03-04 15:08:17,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11739 conditions, 4073 events. 1855/4073 cut-off events. For 4828/4828 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 24466 event pairs, 206 based on Foata normal form. 12/4056 useless extension candidates. Maximal degree in co-relation 11715. Up to 1670 conditions per place. [2025-03-04 15:08:17,475 INFO L140 encePairwiseOnDemand]: 67/83 looper letters, 100 selfloop transitions, 26 changer transitions 3/153 dead transitions. [2025-03-04 15:08:17,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 153 transitions, 984 flow [2025-03-04 15:08:17,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:08:17,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 15:08:17,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 369 transitions. [2025-03-04 15:08:17,476 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44457831325301206 [2025-03-04 15:08:17,476 INFO L175 Difference]: Start difference. First operand has 124 places, 85 transitions, 422 flow. Second operand 10 states and 369 transitions. [2025-03-04 15:08:17,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 153 transitions, 984 flow [2025-03-04 15:08:17,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 153 transitions, 956 flow, removed 0 selfloop flow, removed 12 redundant places. [2025-03-04 15:08:17,485 INFO L231 Difference]: Finished difference. Result has 119 places, 84 transitions, 442 flow [2025-03-04 15:08:17,486 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=442, PETRI_PLACES=119, PETRI_TRANSITIONS=84} [2025-03-04 15:08:17,486 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 42 predicate places. [2025-03-04 15:08:17,486 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 84 transitions, 442 flow [2025-03-04 15:08:17,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 29.4) internal successors, (441), 15 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:17,487 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:17,487 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:17,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 15:08:17,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:08:17,691 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-04 15:08:17,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:17,692 INFO L85 PathProgramCache]: Analyzing trace with hash 453609329, now seen corresponding path program 1 times [2025-03-04 15:08:17,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:17,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092598298] [2025-03-04 15:08:17,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:17,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:17,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 15:08:17,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 15:08:17,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:17,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:18,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:18,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:18,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092598298] [2025-03-04 15:08:18,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092598298] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:18,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:08:18,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 15:08:18,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108151288] [2025-03-04 15:08:18,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:18,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 15:08:18,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:18,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 15:08:18,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:08:18,523 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 83 [2025-03-04 15:08:18,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 84 transitions, 442 flow. Second operand has 8 states, 8 states have (on average 35.0) internal successors, (280), 8 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:18,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:18,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 83 [2025-03-04 15:08:18,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:19,034 INFO L124 PetriNetUnfolderBase]: 1929/4181 cut-off events. [2025-03-04 15:08:19,034 INFO L125 PetriNetUnfolderBase]: For 4973/4973 co-relation queries the response was YES. [2025-03-04 15:08:19,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12213 conditions, 4181 events. 1929/4181 cut-off events. For 4973/4973 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 24879 event pairs, 1084 based on Foata normal form. 12/4154 useless extension candidates. Maximal degree in co-relation 12190. Up to 2130 conditions per place. [2025-03-04 15:08:19,051 INFO L140 encePairwiseOnDemand]: 71/83 looper letters, 67 selfloop transitions, 19 changer transitions 0/108 dead transitions. [2025-03-04 15:08:19,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 108 transitions, 723 flow [2025-03-04 15:08:19,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:08:19,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:08:19,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 244 transitions. [2025-03-04 15:08:19,053 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4899598393574297 [2025-03-04 15:08:19,053 INFO L175 Difference]: Start difference. First operand has 119 places, 84 transitions, 442 flow. Second operand 6 states and 244 transitions. [2025-03-04 15:08:19,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 108 transitions, 723 flow [2025-03-04 15:08:19,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 108 transitions, 675 flow, removed 2 selfloop flow, removed 9 redundant places. [2025-03-04 15:08:19,061 INFO L231 Difference]: Finished difference. Result has 114 places, 83 transitions, 428 flow [2025-03-04 15:08:19,061 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=428, PETRI_PLACES=114, PETRI_TRANSITIONS=83} [2025-03-04 15:08:19,061 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 37 predicate places. [2025-03-04 15:08:19,061 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 83 transitions, 428 flow [2025-03-04 15:08:19,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 35.0) internal successors, (280), 8 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:19,062 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:19,062 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:19,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 15:08:19,062 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-04 15:08:19,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:19,062 INFO L85 PathProgramCache]: Analyzing trace with hash -529057409, now seen corresponding path program 1 times [2025-03-04 15:08:19,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:19,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388132836] [2025-03-04 15:08:19,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:19,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:19,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-04 15:08:19,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 15:08:19,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:19,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:20,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:20,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:20,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388132836] [2025-03-04 15:08:20,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388132836] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:20,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:08:20,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 15:08:20,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454138778] [2025-03-04 15:08:20,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:20,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 15:08:20,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:20,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 15:08:20,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-04 15:08:20,805 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 83 [2025-03-04 15:08:20,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 83 transitions, 428 flow. Second operand has 12 states, 12 states have (on average 35.166666666666664) internal successors, (422), 12 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:20,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:20,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 83 [2025-03-04 15:08:20,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:21,629 INFO L124 PetriNetUnfolderBase]: 2000/4353 cut-off events. [2025-03-04 15:08:21,630 INFO L125 PetriNetUnfolderBase]: For 5636/5636 co-relation queries the response was YES. [2025-03-04 15:08:21,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12465 conditions, 4353 events. 2000/4353 cut-off events. For 5636/5636 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 25589 event pairs, 309 based on Foata normal form. 12/4322 useless extension candidates. Maximal degree in co-relation 12444. Up to 881 conditions per place. [2025-03-04 15:08:21,647 INFO L140 encePairwiseOnDemand]: 69/83 looper letters, 142 selfloop transitions, 17 changer transitions 14/197 dead transitions. [2025-03-04 15:08:21,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 197 transitions, 1289 flow [2025-03-04 15:08:21,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 15:08:21,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 15:08:21,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 560 transitions. [2025-03-04 15:08:21,648 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5189990732159406 [2025-03-04 15:08:21,648 INFO L175 Difference]: Start difference. First operand has 114 places, 83 transitions, 428 flow. Second operand 13 states and 560 transitions. [2025-03-04 15:08:21,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 197 transitions, 1289 flow [2025-03-04 15:08:21,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 197 transitions, 1245 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 15:08:21,657 INFO L231 Difference]: Finished difference. Result has 126 places, 88 transitions, 479 flow [2025-03-04 15:08:21,657 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=479, PETRI_PLACES=126, PETRI_TRANSITIONS=88} [2025-03-04 15:08:21,657 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 49 predicate places. [2025-03-04 15:08:21,657 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 88 transitions, 479 flow [2025-03-04 15:08:21,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 35.166666666666664) internal successors, (422), 12 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:21,658 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:21,658 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:21,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 15:08:21,658 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-04 15:08:21,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:21,659 INFO L85 PathProgramCache]: Analyzing trace with hash 868919190, now seen corresponding path program 1 times [2025-03-04 15:08:21,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:21,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590518471] [2025-03-04 15:08:21,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:21,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:21,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-04 15:08:21,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-04 15:08:21,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:21,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:23,232 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:23,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:23,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590518471] [2025-03-04 15:08:23,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590518471] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:08:23,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [311947769] [2025-03-04 15:08:23,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:23,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:08:23,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:08:23,234 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:08:23,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 15:08:23,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-04 15:08:23,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-04 15:08:23,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:23,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:23,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 2037 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-04 15:08:23,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:08:23,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 15:08:23,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-04 15:08:23,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 15:08:23,686 INFO L349 Elim1Store]: treesize reduction 48, result has 39.2 percent of original size [2025-03-04 15:08:23,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 58 [2025-03-04 15:08:23,814 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 15:08:23,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 15:08:23,815 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 15:08:23,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 36 [2025-03-04 15:08:23,862 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:08:23,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 27 [2025-03-04 15:08:23,920 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:08:23,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 12 [2025-03-04 15:08:23,932 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:08:23,933 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:08:23,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [311947769] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:23,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:08:23,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 20 [2025-03-04 15:08:23,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728270135] [2025-03-04 15:08:23,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:23,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 15:08:23,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:23,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 15:08:23,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2025-03-04 15:08:23,973 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 83 [2025-03-04 15:08:23,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 88 transitions, 479 flow. Second operand has 11 states, 11 states have (on average 37.18181818181818) internal successors, (409), 11 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:23,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:23,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 83 [2025-03-04 15:08:23,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:24,765 INFO L124 PetriNetUnfolderBase]: 2020/4365 cut-off events. [2025-03-04 15:08:24,765 INFO L125 PetriNetUnfolderBase]: For 5968/5968 co-relation queries the response was YES. [2025-03-04 15:08:24,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12717 conditions, 4365 events. 2020/4365 cut-off events. For 5968/5968 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 25672 event pairs, 298 based on Foata normal form. 9/4343 useless extension candidates. Maximal degree in co-relation 12692. Up to 1830 conditions per place. [2025-03-04 15:08:24,784 INFO L140 encePairwiseOnDemand]: 68/83 looper letters, 119 selfloop transitions, 25 changer transitions 1/166 dead transitions. [2025-03-04 15:08:24,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 166 transitions, 1106 flow [2025-03-04 15:08:24,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 15:08:24,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 15:08:24,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 477 transitions. [2025-03-04 15:08:24,785 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5224534501642936 [2025-03-04 15:08:24,785 INFO L175 Difference]: Start difference. First operand has 126 places, 88 transitions, 479 flow. Second operand 11 states and 477 transitions. [2025-03-04 15:08:24,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 166 transitions, 1106 flow [2025-03-04 15:08:24,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 166 transitions, 1090 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-03-04 15:08:24,795 INFO L231 Difference]: Finished difference. Result has 130 places, 88 transitions, 517 flow [2025-03-04 15:08:24,795 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=463, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=517, PETRI_PLACES=130, PETRI_TRANSITIONS=88} [2025-03-04 15:08:24,795 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 53 predicate places. [2025-03-04 15:08:24,795 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 88 transitions, 517 flow [2025-03-04 15:08:24,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 37.18181818181818) internal successors, (409), 11 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:24,796 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:24,796 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:24,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 15:08:24,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-04 15:08:24,996 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-04 15:08:24,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:24,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1337487845, now seen corresponding path program 1 times [2025-03-04 15:08:24,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:24,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304659536] [2025-03-04 15:08:24,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:24,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:25,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-04 15:08:25,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-04 15:08:25,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:25,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:25,854 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:25,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:25,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304659536] [2025-03-04 15:08:25,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304659536] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:25,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:08:25,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 15:08:25,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145692477] [2025-03-04 15:08:25,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:25,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 15:08:25,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:25,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 15:08:25,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-04 15:08:25,874 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 83 [2025-03-04 15:08:25,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 88 transitions, 517 flow. Second operand has 10 states, 10 states have (on average 33.7) internal successors, (337), 10 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:25,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:25,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 83 [2025-03-04 15:08:25,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:26,446 INFO L124 PetriNetUnfolderBase]: 2026/4365 cut-off events. [2025-03-04 15:08:26,446 INFO L125 PetriNetUnfolderBase]: For 6426/6426 co-relation queries the response was YES. [2025-03-04 15:08:26,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12888 conditions, 4365 events. 2026/4365 cut-off events. For 6426/6426 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 25617 event pairs, 917 based on Foata normal form. 9/4317 useless extension candidates. Maximal degree in co-relation 12861. Up to 1798 conditions per place. [2025-03-04 15:08:26,468 INFO L140 encePairwiseOnDemand]: 72/83 looper letters, 92 selfloop transitions, 21 changer transitions 1/135 dead transitions. [2025-03-04 15:08:26,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 135 transitions, 953 flow [2025-03-04 15:08:26,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 15:08:26,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 15:08:26,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 312 transitions. [2025-03-04 15:08:26,469 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46987951807228917 [2025-03-04 15:08:26,469 INFO L175 Difference]: Start difference. First operand has 130 places, 88 transitions, 517 flow. Second operand 8 states and 312 transitions. [2025-03-04 15:08:26,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 135 transitions, 953 flow [2025-03-04 15:08:26,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 135 transitions, 910 flow, removed 2 selfloop flow, removed 9 redundant places. [2025-03-04 15:08:26,480 INFO L231 Difference]: Finished difference. Result has 127 places, 87 transitions, 510 flow [2025-03-04 15:08:26,480 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=468, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=510, PETRI_PLACES=127, PETRI_TRANSITIONS=87} [2025-03-04 15:08:26,481 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 50 predicate places. [2025-03-04 15:08:26,481 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 87 transitions, 510 flow [2025-03-04 15:08:26,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 33.7) internal successors, (337), 10 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:26,481 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:26,481 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:26,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-04 15:08:26,481 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-04 15:08:26,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:26,482 INFO L85 PathProgramCache]: Analyzing trace with hash 757821511, now seen corresponding path program 1 times [2025-03-04 15:08:26,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:26,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785093692] [2025-03-04 15:08:26,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:26,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:26,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-04 15:08:26,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-04 15:08:26,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:26,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:28,226 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:28,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:28,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785093692] [2025-03-04 15:08:28,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785093692] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:28,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:08:28,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 15:08:28,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071634282] [2025-03-04 15:08:28,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:28,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 15:08:28,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:28,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 15:08:28,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-04 15:08:28,264 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 83 [2025-03-04 15:08:28,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 87 transitions, 510 flow. Second operand has 12 states, 12 states have (on average 35.833333333333336) internal successors, (430), 12 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:28,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:28,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 83 [2025-03-04 15:08:28,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:28,994 INFO L124 PetriNetUnfolderBase]: 1938/4229 cut-off events. [2025-03-04 15:08:28,994 INFO L125 PetriNetUnfolderBase]: For 6535/6535 co-relation queries the response was YES. [2025-03-04 15:08:29,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12440 conditions, 4229 events. 1938/4229 cut-off events. For 6535/6535 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 23932 event pairs, 368 based on Foata normal form. 12/4200 useless extension candidates. Maximal degree in co-relation 12415. Up to 881 conditions per place. [2025-03-04 15:08:29,011 INFO L140 encePairwiseOnDemand]: 69/83 looper letters, 152 selfloop transitions, 17 changer transitions 15/207 dead transitions. [2025-03-04 15:08:29,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 207 transitions, 1404 flow [2025-03-04 15:08:29,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 15:08:29,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 15:08:29,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 600 transitions. [2025-03-04 15:08:29,012 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5163511187607573 [2025-03-04 15:08:29,012 INFO L175 Difference]: Start difference. First operand has 127 places, 87 transitions, 510 flow. Second operand 14 states and 600 transitions. [2025-03-04 15:08:29,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 207 transitions, 1404 flow [2025-03-04 15:08:29,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 207 transitions, 1356 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-04 15:08:29,023 INFO L231 Difference]: Finished difference. Result has 132 places, 86 transitions, 485 flow [2025-03-04 15:08:29,023 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=451, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=485, PETRI_PLACES=132, PETRI_TRANSITIONS=86} [2025-03-04 15:08:29,023 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 55 predicate places. [2025-03-04 15:08:29,023 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 86 transitions, 485 flow [2025-03-04 15:08:29,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 35.833333333333336) internal successors, (430), 12 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:29,024 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:29,024 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:29,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-04 15:08:29,024 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-04 15:08:29,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:29,025 INFO L85 PathProgramCache]: Analyzing trace with hash -904263168, now seen corresponding path program 1 times [2025-03-04 15:08:29,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:29,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889090999] [2025-03-04 15:08:29,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:29,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:29,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 15:08:29,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 15:08:29,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:29,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:29,951 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:29,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:29,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889090999] [2025-03-04 15:08:29,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889090999] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:29,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:08:29,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 15:08:29,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569135866] [2025-03-04 15:08:29,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:29,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 15:08:29,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:29,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 15:08:29,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-04 15:08:29,955 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 83 [2025-03-04 15:08:29,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 86 transitions, 485 flow. Second operand has 9 states, 9 states have (on average 38.44444444444444) internal successors, (346), 9 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:29,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:29,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 83 [2025-03-04 15:08:29,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:30,428 INFO L124 PetriNetUnfolderBase]: 1959/4295 cut-off events. [2025-03-04 15:08:30,428 INFO L125 PetriNetUnfolderBase]: For 6285/6285 co-relation queries the response was YES. [2025-03-04 15:08:30,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12685 conditions, 4295 events. 1959/4295 cut-off events. For 6285/6285 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 24551 event pairs, 1122 based on Foata normal form. 9/4256 useless extension candidates. Maximal degree in co-relation 12660. Up to 2202 conditions per place. [2025-03-04 15:08:30,444 INFO L140 encePairwiseOnDemand]: 74/83 looper letters, 71 selfloop transitions, 17 changer transitions 0/109 dead transitions. [2025-03-04 15:08:30,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 109 transitions, 768 flow [2025-03-04 15:08:30,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:08:30,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:08:30,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 260 transitions. [2025-03-04 15:08:30,445 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5220883534136547 [2025-03-04 15:08:30,445 INFO L175 Difference]: Start difference. First operand has 132 places, 86 transitions, 485 flow. Second operand 6 states and 260 transitions. [2025-03-04 15:08:30,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 109 transitions, 768 flow [2025-03-04 15:08:30,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 109 transitions, 736 flow, removed 0 selfloop flow, removed 12 redundant places. [2025-03-04 15:08:30,454 INFO L231 Difference]: Finished difference. Result has 124 places, 86 transitions, 491 flow [2025-03-04 15:08:30,454 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=449, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=491, PETRI_PLACES=124, PETRI_TRANSITIONS=86} [2025-03-04 15:08:30,454 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 47 predicate places. [2025-03-04 15:08:30,454 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 86 transitions, 491 flow [2025-03-04 15:08:30,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 38.44444444444444) internal successors, (346), 9 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:30,455 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:30,455 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:30,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-04 15:08:30,455 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-04 15:08:30,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:30,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1858902868, now seen corresponding path program 1 times [2025-03-04 15:08:30,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:30,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699502516] [2025-03-04 15:08:30,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:30,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:30,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 15:08:30,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 15:08:30,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:30,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:33,149 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:33,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:33,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699502516] [2025-03-04 15:08:33,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699502516] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:08:33,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317962187] [2025-03-04 15:08:33,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:33,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:08:33,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:08:33,151 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:08:33,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 15:08:33,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 15:08:33,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 15:08:33,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:33,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:33,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 2056 conjuncts, 82 conjuncts are in the unsatisfiable core [2025-03-04 15:08:33,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:08:33,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2025-03-04 15:08:33,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2025-03-04 15:08:33,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2025-03-04 15:08:33,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-03-04 15:08:33,693 INFO L349 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2025-03-04 15:08:33,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 39 [2025-03-04 15:08:33,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-03-04 15:08:33,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 23 [2025-03-04 15:08:33,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-03-04 15:08:33,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-03-04 15:08:33,990 INFO L349 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2025-03-04 15:08:33,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 39 [2025-03-04 15:08:34,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-03-04 15:08:34,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-03-04 15:08:34,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-04 15:08:34,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 15:08:34,140 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:34,140 INFO L312 TraceCheckSpWp]: Computing backward predicates...