./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_17-arrayloop_nr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/09-regions_17-arrayloop_nr.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 b29c7049a333b10d890b8afae901738020ed1f084c2a7d471b316f0abdba3430 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:20:18,200 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:20:18,246 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:20:18,252 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:20:18,253 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:20:18,276 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:20:18,277 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:20:18,277 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:20:18,277 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:20:18,277 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:20:18,277 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:20:18,278 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:20:18,278 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:20:18,278 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:20:18,279 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:20:18,279 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:20:18,279 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:20:18,279 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:20:18,279 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:20:18,279 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:20:18,279 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:20:18,279 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:20:18,280 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:20:18,280 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:20:18,280 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:20:18,280 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:20:18,280 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:20:18,280 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:20:18,280 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:20:18,280 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:20:18,280 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:20:18,280 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:20:18,280 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:20:18,281 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:20:18,281 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:20:18,281 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:20:18,281 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:20:18,281 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:20:18,281 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:20:18,281 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:20:18,281 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:20:18,281 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:20:18,282 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:20:18,282 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:20:18,282 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:20:18,282 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 -> b29c7049a333b10d890b8afae901738020ed1f084c2a7d471b316f0abdba3430 [2025-03-04 15:20:18,499 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:20:18,507 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:20:18,509 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:20:18,510 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:20:18,511 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:20:18,512 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_17-arrayloop_nr.i [2025-03-04 15:20:19,699 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6f43d256/2b4ed68b087241258b90201041a71cf7/FLAG5346c3fc5 [2025-03-04 15:20:19,982 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:20:19,982 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_17-arrayloop_nr.i [2025-03-04 15:20:19,993 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6f43d256/2b4ed68b087241258b90201041a71cf7/FLAG5346c3fc5 [2025-03-04 15:20:20,006 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6f43d256/2b4ed68b087241258b90201041a71cf7 [2025-03-04 15:20:20,008 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:20:20,009 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:20:20,010 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:20:20,013 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:20:20,019 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:20:20,019 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:20:20" (1/1) ... [2025-03-04 15:20:20,020 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69e28460 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:20:20, skipping insertion in model container [2025-03-04 15:20:20,020 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:20:20" (1/1) ... [2025-03-04 15:20:20,051 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:20:20,330 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:20:20,351 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:20:20,394 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:20:20,449 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:20:20,450 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:20:20 WrapperNode [2025-03-04 15:20:20,450 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:20:20,451 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:20:20,451 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:20:20,452 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:20:20,455 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:20:20" (1/1) ... [2025-03-04 15:20:20,469 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:20:20" (1/1) ... [2025-03-04 15:20:20,487 INFO L138 Inliner]: procedures = 370, calls = 86, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 179 [2025-03-04 15:20:20,487 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:20:20,488 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:20:20,488 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:20:20,488 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:20:20,495 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:20:20" (1/1) ... [2025-03-04 15:20:20,495 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:20:20" (1/1) ... [2025-03-04 15:20:20,499 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:20:20" (1/1) ... [2025-03-04 15:20:20,519 INFO L175 MemorySlicer]: Split 78 memory accesses to 3 slices as follows [50, 14, 14]. 64 percent of accesses are in the largest equivalence class. The 60 initializations are split as follows [50, 10, 0]. The 11 writes are split as follows [0, 1, 10]. [2025-03-04 15:20:20,519 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:20:20" (1/1) ... [2025-03-04 15:20:20,520 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:20:20" (1/1) ... [2025-03-04 15:20:20,528 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:20:20" (1/1) ... [2025-03-04 15:20:20,529 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:20:20" (1/1) ... [2025-03-04 15:20:20,531 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:20:20" (1/1) ... [2025-03-04 15:20:20,531 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:20:20" (1/1) ... [2025-03-04 15:20:20,534 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:20:20,539 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:20:20,540 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:20:20,540 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:20:20,540 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:20:20" (1/1) ... [2025-03-04 15:20:20,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:20:20,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:20:20,567 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:20:20,570 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:20:20,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 15:20:20,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 15:20:20,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 15:20:20,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 15:20:20,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 15:20:20,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 15:20:20,586 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 15:20:20,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:20:20,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:20:20,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 15:20:20,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:20:20,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:20:20,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 15:20:20,587 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 15:20:20,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 15:20:20,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:20:20,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 15:20:20,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 15:20:20,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 15:20:20,587 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-04 15:20:20,587 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-04 15:20:20,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:20:20,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 15:20:20,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 15:20:20,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:20:20,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:20:20,588 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:20:20,739 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:20:20,742 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:20:21,042 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:20:21,042 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:20:21,296 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:20:21,296 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:20:21,296 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:20:21 BoogieIcfgContainer [2025-03-04 15:20:21,297 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:20:21,298 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:20:21,298 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:20:21,301 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:20:21,301 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:20:20" (1/3) ... [2025-03-04 15:20:21,301 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@460ad99e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:20:21, skipping insertion in model container [2025-03-04 15:20:21,301 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:20:20" (2/3) ... [2025-03-04 15:20:21,302 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@460ad99e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:20:21, skipping insertion in model container [2025-03-04 15:20:21,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:20:21" (3/3) ... [2025-03-04 15:20:21,302 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_17-arrayloop_nr.i [2025-03-04 15:20:21,311 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:20:21,312 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_17-arrayloop_nr.i that has 2 procedures, 33 locations, 1 initial locations, 3 loop locations, and 8 error locations. [2025-03-04 15:20:21,312 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:20:21,343 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 15:20:21,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 35 transitions, 74 flow [2025-03-04 15:20:21,390 INFO L124 PetriNetUnfolderBase]: 3/34 cut-off events. [2025-03-04 15:20:21,393 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:20:21,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 34 events. 3/34 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 56 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 26. Up to 2 conditions per place. [2025-03-04 15:20:21,395 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 35 transitions, 74 flow [2025-03-04 15:20:21,398 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 34 transitions, 71 flow [2025-03-04 15:20:21,404 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:20:21,413 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;@29315e9a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:20:21,414 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-03-04 15:20:21,417 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:20:21,418 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-03-04 15:20:21,418 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:20:21,418 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:21,418 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 15:20:21,418 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 15:20:21,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:21,425 INFO L85 PathProgramCache]: Analyzing trace with hash 446103, now seen corresponding path program 1 times [2025-03-04 15:20:21,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:21,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695915393] [2025-03-04 15:20:21,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:20:21,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:21,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:20:21,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:20:21,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:21,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:21,700 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:20:21,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:21,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695915393] [2025-03-04 15:20:21,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695915393] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:21,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:20:21,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:20:21,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226309302] [2025-03-04 15:20:21,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:21,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:20:21,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:21,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:20:21,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:20:21,745 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2025-03-04 15:20:21,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 34 transitions, 71 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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:20:21,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:21,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2025-03-04 15:20:21,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:21,950 INFO L124 PetriNetUnfolderBase]: 86/253 cut-off events. [2025-03-04 15:20:21,950 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:20:21,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 435 conditions, 253 events. 86/253 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1056 event pairs, 36 based on Foata normal form. 8/235 useless extension candidates. Maximal degree in co-relation 410. Up to 106 conditions per place. [2025-03-04 15:20:21,954 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 30 selfloop transitions, 5 changer transitions 0/48 dead transitions. [2025-03-04 15:20:21,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 48 transitions, 169 flow [2025-03-04 15:20:21,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:20:21,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:20:21,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2025-03-04 15:20:21,967 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6785714285714286 [2025-03-04 15:20:21,969 INFO L175 Difference]: Start difference. First operand has 35 places, 34 transitions, 71 flow. Second operand 4 states and 95 transitions. [2025-03-04 15:20:21,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 48 transitions, 169 flow [2025-03-04 15:20:21,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 48 transitions, 168 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:20:21,976 INFO L231 Difference]: Finished difference. Result has 39 places, 37 transitions, 106 flow [2025-03-04 15:20:21,978 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=106, PETRI_PLACES=39, PETRI_TRANSITIONS=37} [2025-03-04 15:20:21,982 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 4 predicate places. [2025-03-04 15:20:21,982 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 37 transitions, 106 flow [2025-03-04 15:20:21,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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:20:21,982 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:21,982 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-04 15:20:21,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:20:21,983 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 15:20:21,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:21,984 INFO L85 PathProgramCache]: Analyzing trace with hash 405319886, now seen corresponding path program 1 times [2025-03-04 15:20:21,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:21,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759573916] [2025-03-04 15:20:21,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:20:21,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:22,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:20:22,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:20:22,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:22,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:22,195 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:20:22,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:22,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759573916] [2025-03-04 15:20:22,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759573916] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:20:22,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [461062493] [2025-03-04 15:20:22,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:20:22,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:20:22,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:20:22,200 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:20:22,201 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:20:22,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:20:22,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:20:22,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:22,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:22,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:20:22,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:20:22,367 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:20:22,367 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:20:22,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [461062493] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:22,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:20:22,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-04 15:20:22,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47347967] [2025-03-04 15:20:22,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:22,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:20:22,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:22,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:20:22,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:20:22,380 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2025-03-04 15:20:22,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 37 transitions, 106 flow. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:20:22,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:22,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2025-03-04 15:20:22,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:22,561 INFO L124 PetriNetUnfolderBase]: 86/242 cut-off events. [2025-03-04 15:20:22,561 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-03-04 15:20:22,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 469 conditions, 242 events. 86/242 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 973 event pairs, 0 based on Foata normal form. 1/225 useless extension candidates. Maximal degree in co-relation 446. Up to 92 conditions per place. [2025-03-04 15:20:22,565 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 34 selfloop transitions, 7 changer transitions 0/54 dead transitions. [2025-03-04 15:20:22,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 54 transitions, 220 flow [2025-03-04 15:20:22,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:20:22,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:20:22,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 126 transitions. [2025-03-04 15:20:22,568 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-03-04 15:20:22,568 INFO L175 Difference]: Start difference. First operand has 39 places, 37 transitions, 106 flow. Second operand 6 states and 126 transitions. [2025-03-04 15:20:22,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 54 transitions, 220 flow [2025-03-04 15:20:22,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 54 transitions, 216 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:20:22,570 INFO L231 Difference]: Finished difference. Result has 42 places, 36 transitions, 112 flow [2025-03-04 15:20:22,571 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=112, PETRI_PLACES=42, PETRI_TRANSITIONS=36} [2025-03-04 15:20:22,571 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 7 predicate places. [2025-03-04 15:20:22,571 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 36 transitions, 112 flow [2025-03-04 15:20:22,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:20:22,572 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:22,572 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-03-04 15:20:22,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 15:20:22,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:20:22,772 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 15:20:22,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:22,773 INFO L85 PathProgramCache]: Analyzing trace with hash -319985055, now seen corresponding path program 1 times [2025-03-04 15:20:22,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:22,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445737675] [2025-03-04 15:20:22,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:20:22,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:22,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:20:22,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:20:22,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:22,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:22,848 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:20:22,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:22,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445737675] [2025-03-04 15:20:22,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445737675] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:22,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:20:22,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:20:22,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213146099] [2025-03-04 15:20:22,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:22,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:20:22,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:22,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:20:22,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:20:22,856 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2025-03-04 15:20:22,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 36 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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:20:22,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:22,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2025-03-04 15:20:22,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:22,944 INFO L124 PetriNetUnfolderBase]: 86/261 cut-off events. [2025-03-04 15:20:22,944 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2025-03-04 15:20:22,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 497 conditions, 261 events. 86/261 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1115 event pairs, 66 based on Foata normal form. 1/234 useless extension candidates. Maximal degree in co-relation 474. Up to 174 conditions per place. [2025-03-04 15:20:22,948 INFO L140 encePairwiseOnDemand]: 32/35 looper letters, 18 selfloop transitions, 4 changer transitions 0/35 dead transitions. [2025-03-04 15:20:22,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 35 transitions, 152 flow [2025-03-04 15:20:22,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:20:22,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:20:22,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2025-03-04 15:20:22,949 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5904761904761905 [2025-03-04 15:20:22,949 INFO L175 Difference]: Start difference. First operand has 42 places, 36 transitions, 112 flow. Second operand 3 states and 62 transitions. [2025-03-04 15:20:22,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 35 transitions, 152 flow [2025-03-04 15:20:22,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 35 transitions, 140 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-03-04 15:20:22,950 INFO L231 Difference]: Finished difference. Result has 39 places, 35 transitions, 104 flow [2025-03-04 15:20:22,950 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=39, PETRI_TRANSITIONS=35} [2025-03-04 15:20:22,951 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 4 predicate places. [2025-03-04 15:20:22,951 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 35 transitions, 104 flow [2025-03-04 15:20:22,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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:20:22,951 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:22,951 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:22,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 15:20:22,952 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 15:20:22,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:22,952 INFO L85 PathProgramCache]: Analyzing trace with hash -111147801, now seen corresponding path program 1 times [2025-03-04 15:20:22,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:22,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453471548] [2025-03-04 15:20:22,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:20:22,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:22,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:20:22,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:20:22,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:22,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:23,050 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:20:23,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:23,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453471548] [2025-03-04 15:20:23,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453471548] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:20:23,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736851888] [2025-03-04 15:20:23,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:20:23,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:20:23,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:20:23,053 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:20:23,055 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:20:23,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:20:23,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:20:23,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:23,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:23,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:20:23,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:20:23,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:20:23,168 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:20:23,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736851888] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:23,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:20:23,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 6 [2025-03-04 15:20:23,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164836664] [2025-03-04 15:20:23,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:23,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:20:23,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:23,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:20:23,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:20:23,174 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2025-03-04 15:20:23,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 35 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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:20:23,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:23,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2025-03-04 15:20:23,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:23,313 INFO L124 PetriNetUnfolderBase]: 194/522 cut-off events. [2025-03-04 15:20:23,313 INFO L125 PetriNetUnfolderBase]: For 83/83 co-relation queries the response was YES. [2025-03-04 15:20:23,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 963 conditions, 522 events. 194/522 cut-off events. For 83/83 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2536 event pairs, 66 based on Foata normal form. 12/473 useless extension candidates. Maximal degree in co-relation 936. Up to 192 conditions per place. [2025-03-04 15:20:23,317 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 35 selfloop transitions, 4 changer transitions 0/50 dead transitions. [2025-03-04 15:20:23,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 50 transitions, 221 flow [2025-03-04 15:20:23,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:20:23,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:20:23,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2025-03-04 15:20:23,318 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7428571428571429 [2025-03-04 15:20:23,318 INFO L175 Difference]: Start difference. First operand has 39 places, 35 transitions, 104 flow. Second operand 3 states and 78 transitions. [2025-03-04 15:20:23,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 50 transitions, 221 flow [2025-03-04 15:20:23,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 50 transitions, 213 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:20:23,320 INFO L231 Difference]: Finished difference. Result has 41 places, 38 transitions, 126 flow [2025-03-04 15:20:23,320 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=41, PETRI_TRANSITIONS=38} [2025-03-04 15:20:23,320 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 6 predicate places. [2025-03-04 15:20:23,320 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 38 transitions, 126 flow [2025-03-04 15:20:23,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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:20:23,320 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:23,321 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:23,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 15:20:23,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-04 15:20:23,524 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 15:20:23,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:23,524 INFO L85 PathProgramCache]: Analyzing trace with hash 849385873, now seen corresponding path program 1 times [2025-03-04 15:20:23,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:23,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883143585] [2025-03-04 15:20:23,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:20:23,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:23,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:20:23,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:20:23,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:23,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:23,598 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:20:23,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:23,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883143585] [2025-03-04 15:20:23,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883143585] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:20:23,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1781401961] [2025-03-04 15:20:23,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:20:23,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:20:23,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:20:23,601 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:20:23,602 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:20:23,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:20:23,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:20:23,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:23,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:23,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:20:23,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:20:23,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:20:23,710 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:20:23,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1781401961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:23,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:20:23,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 6 [2025-03-04 15:20:23,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081404664] [2025-03-04 15:20:23,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:23,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:20:23,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:23,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:20:23,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:20:23,716 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2025-03-04 15:20:23,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 38 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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:20:23,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:23,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2025-03-04 15:20:23,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:23,829 INFO L124 PetriNetUnfolderBase]: 170/498 cut-off events. [2025-03-04 15:20:23,829 INFO L125 PetriNetUnfolderBase]: For 248/248 co-relation queries the response was YES. [2025-03-04 15:20:23,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1032 conditions, 498 events. 170/498 cut-off events. For 248/248 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2553 event pairs, 77 based on Foata normal form. 24/483 useless extension candidates. Maximal degree in co-relation 1001. Up to 200 conditions per place. [2025-03-04 15:20:23,831 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 34 selfloop transitions, 3 changer transitions 0/48 dead transitions. [2025-03-04 15:20:23,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 48 transitions, 225 flow [2025-03-04 15:20:23,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:20:23,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:20:23,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2025-03-04 15:20:23,832 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2025-03-04 15:20:23,832 INFO L175 Difference]: Start difference. First operand has 41 places, 38 transitions, 126 flow. Second operand 3 states and 77 transitions. [2025-03-04 15:20:23,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 48 transitions, 225 flow [2025-03-04 15:20:23,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 48 transitions, 217 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:20:23,834 INFO L231 Difference]: Finished difference. Result has 41 places, 36 transitions, 116 flow [2025-03-04 15:20:23,834 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=41, PETRI_TRANSITIONS=36} [2025-03-04 15:20:23,835 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 6 predicate places. [2025-03-04 15:20:23,835 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 36 transitions, 116 flow [2025-03-04 15:20:23,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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:20:23,835 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:23,835 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:23,842 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 15:20:24,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:20:24,036 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 15:20:24,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:24,036 INFO L85 PathProgramCache]: Analyzing trace with hash 252027512, now seen corresponding path program 1 times [2025-03-04 15:20:24,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:24,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785851377] [2025-03-04 15:20:24,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:20:24,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:24,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:20:24,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:20:24,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:24,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:24,136 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:20:24,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:24,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785851377] [2025-03-04 15:20:24,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785851377] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:20:24,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462578039] [2025-03-04 15:20:24,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:20:24,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:20:24,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:20:24,139 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:20:24,141 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:20:24,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:20:24,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:20:24,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:24,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:24,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:20:24,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:20:24,269 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:20:24,269 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:20:24,293 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:20:24,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [462578039] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:20:24,293 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:20:24,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-04 15:20:24,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890317921] [2025-03-04 15:20:24,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:20:24,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 15:20:24,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:24,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 15:20:24,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 15:20:24,308 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2025-03-04 15:20:24,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 36 transitions, 116 flow. Second operand has 10 states, 10 states have (on average 14.8) internal successors, (148), 10 states have internal predecessors, (148), 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:20:24,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:24,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2025-03-04 15:20:24,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:24,529 INFO L124 PetriNetUnfolderBase]: 170/449 cut-off events. [2025-03-04 15:20:24,530 INFO L125 PetriNetUnfolderBase]: For 182/182 co-relation queries the response was YES. [2025-03-04 15:20:24,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 953 conditions, 449 events. 170/449 cut-off events. For 182/182 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2131 event pairs, 22 based on Foata normal form. 2/417 useless extension candidates. Maximal degree in co-relation 910. Up to 145 conditions per place. [2025-03-04 15:20:24,532 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 37 selfloop transitions, 11 changer transitions 0/60 dead transitions. [2025-03-04 15:20:24,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 60 transitions, 294 flow [2025-03-04 15:20:24,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:20:24,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 15:20:24,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 138 transitions. [2025-03-04 15:20:24,534 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.563265306122449 [2025-03-04 15:20:24,534 INFO L175 Difference]: Start difference. First operand has 41 places, 36 transitions, 116 flow. Second operand 7 states and 138 transitions. [2025-03-04 15:20:24,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 60 transitions, 294 flow [2025-03-04 15:20:24,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 60 transitions, 294 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:20:24,540 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 178 flow [2025-03-04 15:20:24,540 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=178, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2025-03-04 15:20:24,540 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 15 predicate places. [2025-03-04 15:20:24,541 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 178 flow [2025-03-04 15:20:24,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.8) internal successors, (148), 10 states have internal predecessors, (148), 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:20:24,541 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:24,541 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:24,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 15:20:24,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:20:24,742 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 15:20:24,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:24,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1291524888, now seen corresponding path program 2 times [2025-03-04 15:20:24,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:24,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203505468] [2025-03-04 15:20:24,742 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:20:24,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:24,762 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-04 15:20:24,767 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 19 statements. [2025-03-04 15:20:24,767 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:20:24,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:24,797 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 15:20:24,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:24,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203505468] [2025-03-04 15:20:24,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203505468] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:24,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:20:24,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:20:24,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76326422] [2025-03-04 15:20:24,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:24,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:20:24,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:24,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:20:24,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:20:24,805 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2025-03-04 15:20:24,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 178 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:20:24,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:24,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2025-03-04 15:20:24,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:24,913 INFO L124 PetriNetUnfolderBase]: 170/486 cut-off events. [2025-03-04 15:20:24,913 INFO L125 PetriNetUnfolderBase]: For 350/350 co-relation queries the response was YES. [2025-03-04 15:20:24,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1097 conditions, 486 events. 170/486 cut-off events. For 350/350 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2364 event pairs, 88 based on Foata normal form. 24/488 useless extension candidates. Maximal degree in co-relation 1041. Up to 220 conditions per place. [2025-03-04 15:20:24,916 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 35 selfloop transitions, 7 changer transitions 1/55 dead transitions. [2025-03-04 15:20:24,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 55 transitions, 318 flow [2025-03-04 15:20:24,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:20:24,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:20:24,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2025-03-04 15:20:24,917 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6642857142857143 [2025-03-04 15:20:24,917 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 178 flow. Second operand 4 states and 93 transitions. [2025-03-04 15:20:24,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 55 transitions, 318 flow [2025-03-04 15:20:24,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 55 transitions, 306 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-04 15:20:24,919 INFO L231 Difference]: Finished difference. Result has 50 places, 39 transitions, 178 flow [2025-03-04 15:20:24,919 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=178, PETRI_PLACES=50, PETRI_TRANSITIONS=39} [2025-03-04 15:20:24,919 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 15 predicate places. [2025-03-04 15:20:24,920 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 39 transitions, 178 flow [2025-03-04 15:20:24,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:20:24,920 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:24,920 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:24,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 15:20:24,920 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 15:20:24,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:24,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1382566241, now seen corresponding path program 1 times [2025-03-04 15:20:24,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:24,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345466381] [2025-03-04 15:20:24,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:20:24,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:24,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 15:20:24,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:20:24,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:24,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:25,013 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 15:20:25,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:25,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345466381] [2025-03-04 15:20:25,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345466381] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:25,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:20:25,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:20:25,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340912301] [2025-03-04 15:20:25,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:25,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:20:25,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:25,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:20:25,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:20:25,020 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2025-03-04 15:20:25,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 39 transitions, 178 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:20:25,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:25,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2025-03-04 15:20:25,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:25,142 INFO L124 PetriNetUnfolderBase]: 158/432 cut-off events. [2025-03-04 15:20:25,142 INFO L125 PetriNetUnfolderBase]: For 369/369 co-relation queries the response was YES. [2025-03-04 15:20:25,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1036 conditions, 432 events. 158/432 cut-off events. For 369/369 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1961 event pairs, 85 based on Foata normal form. 12/425 useless extension candidates. Maximal degree in co-relation 980. Up to 201 conditions per place. [2025-03-04 15:20:25,144 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 42 selfloop transitions, 5 changer transitions 0/59 dead transitions. [2025-03-04 15:20:25,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 59 transitions, 338 flow [2025-03-04 15:20:25,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:20:25,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:20:25,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 98 transitions. [2025-03-04 15:20:25,146 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7 [2025-03-04 15:20:25,146 INFO L175 Difference]: Start difference. First operand has 50 places, 39 transitions, 178 flow. Second operand 4 states and 98 transitions. [2025-03-04 15:20:25,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 59 transitions, 338 flow [2025-03-04 15:20:25,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 59 transitions, 326 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:20:25,148 INFO L231 Difference]: Finished difference. Result has 53 places, 40 transitions, 190 flow [2025-03-04 15:20:25,148 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=190, PETRI_PLACES=53, PETRI_TRANSITIONS=40} [2025-03-04 15:20:25,148 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 18 predicate places. [2025-03-04 15:20:25,149 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 40 transitions, 190 flow [2025-03-04 15:20:25,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:20:25,149 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:25,149 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:25,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 15:20:25,149 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 15:20:25,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:25,149 INFO L85 PathProgramCache]: Analyzing trace with hash 632267913, now seen corresponding path program 1 times [2025-03-04 15:20:25,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:25,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001682742] [2025-03-04 15:20:25,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:20:25,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:25,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 15:20:25,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 15:20:25,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:25,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:25,272 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 15:20:25,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:25,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001682742] [2025-03-04 15:20:25,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001682742] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:25,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:20:25,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:20:25,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597171330] [2025-03-04 15:20:25,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:25,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:20:25,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:25,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:20:25,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:20:25,284 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 35 [2025-03-04 15:20:25,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 40 transitions, 190 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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:20:25,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:25,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 35 [2025-03-04 15:20:25,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:25,410 INFO L124 PetriNetUnfolderBase]: 194/493 cut-off events. [2025-03-04 15:20:25,411 INFO L125 PetriNetUnfolderBase]: For 595/595 co-relation queries the response was YES. [2025-03-04 15:20:25,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1280 conditions, 493 events. 194/493 cut-off events. For 595/595 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2308 event pairs, 110 based on Foata normal form. 24/512 useless extension candidates. Maximal degree in co-relation 1220. Up to 275 conditions per place. [2025-03-04 15:20:25,413 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 50 selfloop transitions, 3 changer transitions 0/62 dead transitions. [2025-03-04 15:20:25,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 62 transitions, 396 flow [2025-03-04 15:20:25,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:20:25,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:20:25,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2025-03-04 15:20:25,414 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6571428571428571 [2025-03-04 15:20:25,414 INFO L175 Difference]: Start difference. First operand has 53 places, 40 transitions, 190 flow. Second operand 4 states and 92 transitions. [2025-03-04 15:20:25,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 62 transitions, 396 flow [2025-03-04 15:20:25,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 62 transitions, 388 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:20:25,415 INFO L231 Difference]: Finished difference. Result has 57 places, 41 transitions, 204 flow [2025-03-04 15:20:25,416 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=204, PETRI_PLACES=57, PETRI_TRANSITIONS=41} [2025-03-04 15:20:25,416 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 22 predicate places. [2025-03-04 15:20:25,416 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 41 transitions, 204 flow [2025-03-04 15:20:25,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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:20:25,416 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:25,416 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:25,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 15:20:25,416 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 15:20:25,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:25,417 INFO L85 PathProgramCache]: Analyzing trace with hash -337490086, now seen corresponding path program 1 times [2025-03-04 15:20:25,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:25,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347785099] [2025-03-04 15:20:25,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:20:25,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:25,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 15:20:25,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 15:20:25,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:25,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:25,512 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 15:20:25,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:25,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347785099] [2025-03-04 15:20:25,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347785099] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:20:25,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [364086070] [2025-03-04 15:20:25,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:20:25,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:20:25,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:20:25,514 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:20:25,516 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:20:25,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 15:20:25,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 15:20:25,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:25,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:25,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 15:20:25,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:20:25,703 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 15:20:25,704 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:20:25,784 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 15:20:25,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [364086070] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:20:25,784 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:20:25,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8, 8] total 19 [2025-03-04 15:20:25,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345850000] [2025-03-04 15:20:25,784 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:20:25,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 15:20:25,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:25,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 15:20:25,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2025-03-04 15:20:25,854 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2025-03-04 15:20:25,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 41 transitions, 204 flow. Second operand has 19 states, 19 states have (on average 10.947368421052632) internal successors, (208), 19 states have internal predecessors, (208), 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:20:25,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:25,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2025-03-04 15:20:25,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:26,492 INFO L124 PetriNetUnfolderBase]: 352/815 cut-off events. [2025-03-04 15:20:26,493 INFO L125 PetriNetUnfolderBase]: For 1081/1081 co-relation queries the response was YES. [2025-03-04 15:20:26,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2288 conditions, 815 events. 352/815 cut-off events. For 1081/1081 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 3805 event pairs, 26 based on Foata normal form. 18/830 useless extension candidates. Maximal degree in co-relation 2179. Up to 120 conditions per place. [2025-03-04 15:20:26,497 INFO L140 encePairwiseOnDemand]: 22/35 looper letters, 100 selfloop transitions, 49 changer transitions 0/156 dead transitions. [2025-03-04 15:20:26,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 156 transitions, 988 flow [2025-03-04 15:20:26,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 15:20:26,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-03-04 15:20:26,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 372 transitions. [2025-03-04 15:20:26,501 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44285714285714284 [2025-03-04 15:20:26,501 INFO L175 Difference]: Start difference. First operand has 57 places, 41 transitions, 204 flow. Second operand 24 states and 372 transitions. [2025-03-04 15:20:26,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 156 transitions, 988 flow [2025-03-04 15:20:26,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 156 transitions, 955 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:20:26,505 INFO L231 Difference]: Finished difference. Result has 86 places, 76 transitions, 606 flow [2025-03-04 15:20:26,506 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=606, PETRI_PLACES=86, PETRI_TRANSITIONS=76} [2025-03-04 15:20:26,507 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 51 predicate places. [2025-03-04 15:20:26,507 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 76 transitions, 606 flow [2025-03-04 15:20:26,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 10.947368421052632) internal successors, (208), 19 states have internal predecessors, (208), 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:20:26,507 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:26,507 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:26,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 15:20:26,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-04 15:20:26,708 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 15:20:26,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:26,709 INFO L85 PathProgramCache]: Analyzing trace with hash 78669502, now seen corresponding path program 1 times [2025-03-04 15:20:26,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:26,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324741067] [2025-03-04 15:20:26,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:20:26,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:26,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 15:20:26,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 15:20:26,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:26,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:26,812 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2025-03-04 15:20:26,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:26,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324741067] [2025-03-04 15:20:26,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324741067] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:26,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:20:26,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:20:26,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130712021] [2025-03-04 15:20:26,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:26,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:20:26,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:26,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:20:26,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:20:26,818 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2025-03-04 15:20:26,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 76 transitions, 606 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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:20:26,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:26,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2025-03-04 15:20:26,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:26,924 INFO L124 PetriNetUnfolderBase]: 271/721 cut-off events. [2025-03-04 15:20:26,925 INFO L125 PetriNetUnfolderBase]: For 2012/2014 co-relation queries the response was YES. [2025-03-04 15:20:26,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2197 conditions, 721 events. 271/721 cut-off events. For 2012/2014 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3354 event pairs, 105 based on Foata normal form. 26/741 useless extension candidates. Maximal degree in co-relation 2053. Up to 410 conditions per place. [2025-03-04 15:20:26,928 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 61 selfloop transitions, 11 changer transitions 0/85 dead transitions. [2025-03-04 15:20:26,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 85 transitions, 813 flow [2025-03-04 15:20:26,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:20:26,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:20:26,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2025-03-04 15:20:26,930 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6571428571428571 [2025-03-04 15:20:26,931 INFO L175 Difference]: Start difference. First operand has 86 places, 76 transitions, 606 flow. Second operand 3 states and 69 transitions. [2025-03-04 15:20:26,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 85 transitions, 813 flow [2025-03-04 15:20:26,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 85 transitions, 771 flow, removed 5 selfloop flow, removed 6 redundant places. [2025-03-04 15:20:26,939 INFO L231 Difference]: Finished difference. Result has 82 places, 73 transitions, 575 flow [2025-03-04 15:20:26,939 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=575, PETRI_PLACES=82, PETRI_TRANSITIONS=73} [2025-03-04 15:20:26,939 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 47 predicate places. [2025-03-04 15:20:26,940 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 73 transitions, 575 flow [2025-03-04 15:20:26,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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:20:26,940 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:26,941 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:26,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 15:20:26,941 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 15:20:26,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:26,941 INFO L85 PathProgramCache]: Analyzing trace with hash 414401669, now seen corresponding path program 1 times [2025-03-04 15:20:26,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:26,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037064557] [2025-03-04 15:20:26,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:20:26,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:26,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 15:20:26,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 15:20:26,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:26,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:27,074 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2025-03-04 15:20:27,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:27,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037064557] [2025-03-04 15:20:27,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037064557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:27,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:20:27,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:20:27,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757311049] [2025-03-04 15:20:27,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:27,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:20:27,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:27,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:20:27,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:20:27,080 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2025-03-04 15:20:27,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 73 transitions, 575 flow. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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:20:27,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:27,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2025-03-04 15:20:27,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:27,215 INFO L124 PetriNetUnfolderBase]: 254/703 cut-off events. [2025-03-04 15:20:27,215 INFO L125 PetriNetUnfolderBase]: For 1950/1950 co-relation queries the response was YES. [2025-03-04 15:20:27,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2167 conditions, 703 events. 254/703 cut-off events. For 1950/1950 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3248 event pairs, 117 based on Foata normal form. 17/711 useless extension candidates. Maximal degree in co-relation 2031. Up to 324 conditions per place. [2025-03-04 15:20:27,219 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 43 selfloop transitions, 33 changer transitions 8/94 dead transitions. [2025-03-04 15:20:27,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 94 transitions, 895 flow [2025-03-04 15:20:27,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:20:27,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:20:27,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2025-03-04 15:20:27,220 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6357142857142857 [2025-03-04 15:20:27,220 INFO L175 Difference]: Start difference. First operand has 82 places, 73 transitions, 575 flow. Second operand 4 states and 89 transitions. [2025-03-04 15:20:27,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 94 transitions, 895 flow [2025-03-04 15:20:27,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 94 transitions, 871 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:20:27,225 INFO L231 Difference]: Finished difference. Result has 82 places, 68 transitions, 591 flow [2025-03-04 15:20:27,225 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=555, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=591, PETRI_PLACES=82, PETRI_TRANSITIONS=68} [2025-03-04 15:20:27,226 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 47 predicate places. [2025-03-04 15:20:27,226 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 68 transitions, 591 flow [2025-03-04 15:20:27,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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:20:27,226 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:27,226 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:27,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 15:20:27,226 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 15:20:27,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:27,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1408541796, now seen corresponding path program 1 times [2025-03-04 15:20:27,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:27,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571220967] [2025-03-04 15:20:27,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:20:27,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:27,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 15:20:27,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 15:20:27,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:27,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:27,604 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 15:20:27,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:27,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571220967] [2025-03-04 15:20:27,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571220967] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:20:27,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805157626] [2025-03-04 15:20:27,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:20:27,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:20:27,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:20:27,607 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:20:27,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 15:20:27,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 15:20:27,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 15:20:27,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:27,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:27,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 740 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 15:20:27,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:20:27,873 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 15:20:27,874 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:20:28,019 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 15:20:28,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1805157626] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:20:28,019 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:20:28,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 22 [2025-03-04 15:20:28,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564869834] [2025-03-04 15:20:28,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:20:28,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 15:20:28,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:28,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 15:20:28,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-03-04 15:20:28,041 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2025-03-04 15:20:28,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 68 transitions, 591 flow. Second operand has 23 states, 23 states have (on average 14.391304347826088) internal successors, (331), 23 states have internal predecessors, (331), 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:20:28,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:28,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2025-03-04 15:20:28,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:28,382 INFO L124 PetriNetUnfolderBase]: 226/611 cut-off events. [2025-03-04 15:20:28,382 INFO L125 PetriNetUnfolderBase]: For 1968/1968 co-relation queries the response was YES. [2025-03-04 15:20:28,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2015 conditions, 611 events. 226/611 cut-off events. For 1968/1968 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2702 event pairs, 80 based on Foata normal form. 3/607 useless extension candidates. Maximal degree in co-relation 1810. Up to 193 conditions per place. [2025-03-04 15:20:28,385 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 40 selfloop transitions, 37 changer transitions 0/87 dead transitions. [2025-03-04 15:20:28,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 87 transitions, 885 flow [2025-03-04 15:20:28,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 15:20:28,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-04 15:20:28,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 332 transitions. [2025-03-04 15:20:28,387 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45170068027210886 [2025-03-04 15:20:28,387 INFO L175 Difference]: Start difference. First operand has 82 places, 68 transitions, 591 flow. Second operand 21 states and 332 transitions. [2025-03-04 15:20:28,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 87 transitions, 885 flow [2025-03-04 15:20:28,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 87 transitions, 780 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-03-04 15:20:28,391 INFO L231 Difference]: Finished difference. Result has 99 places, 74 transitions, 673 flow [2025-03-04 15:20:28,392 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=673, PETRI_PLACES=99, PETRI_TRANSITIONS=74} [2025-03-04 15:20:28,392 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 64 predicate places. [2025-03-04 15:20:28,392 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 74 transitions, 673 flow [2025-03-04 15:20:28,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 14.391304347826088) internal successors, (331), 23 states have internal predecessors, (331), 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:20:28,393 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:28,393 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:28,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 15:20:28,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:20:28,593 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 15:20:28,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:28,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1211567579, now seen corresponding path program 2 times [2025-03-04 15:20:28,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:28,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574964017] [2025-03-04 15:20:28,594 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:20:28,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:28,629 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 51 statements into 2 equivalence classes. [2025-03-04 15:20:28,649 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 15:20:28,650 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:20:28,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:28,769 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 15:20:28,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:28,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574964017] [2025-03-04 15:20:28,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574964017] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:20:28,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943488900] [2025-03-04 15:20:28,769 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:20:28,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:20:28,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:20:28,771 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:20:28,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 15:20:28,938 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 51 statements into 2 equivalence classes. [2025-03-04 15:20:29,019 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 15:20:29,019 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:20:29,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:29,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 911 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:20:29,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:20:29,056 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 15:20:29,056 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:20:29,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943488900] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:29,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:20:29,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-03-04 15:20:29,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515751705] [2025-03-04 15:20:29,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:29,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:20:29,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:29,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:20:29,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-04 15:20:29,065 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2025-03-04 15:20:29,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 74 transitions, 673 flow. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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:20:29,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:29,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2025-03-04 15:20:29,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:29,184 INFO L124 PetriNetUnfolderBase]: 258/625 cut-off events. [2025-03-04 15:20:29,184 INFO L125 PetriNetUnfolderBase]: For 1828/1831 co-relation queries the response was YES. [2025-03-04 15:20:29,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2031 conditions, 625 events. 258/625 cut-off events. For 1828/1831 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2574 event pairs, 83 based on Foata normal form. 38/656 useless extension candidates. Maximal degree in co-relation 1823. Up to 303 conditions per place. [2025-03-04 15:20:29,187 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 68 selfloop transitions, 14 changer transitions 0/93 dead transitions. [2025-03-04 15:20:29,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 93 transitions, 969 flow [2025-03-04 15:20:29,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:20:29,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:20:29,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2025-03-04 15:20:29,188 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2025-03-04 15:20:29,188 INFO L175 Difference]: Start difference. First operand has 99 places, 74 transitions, 673 flow. Second operand 4 states and 80 transitions. [2025-03-04 15:20:29,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 93 transitions, 969 flow [2025-03-04 15:20:29,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 93 transitions, 875 flow, removed 4 selfloop flow, removed 14 redundant places. [2025-03-04 15:20:29,193 INFO L231 Difference]: Finished difference. Result has 86 places, 72 transitions, 607 flow [2025-03-04 15:20:29,193 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=579, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=607, PETRI_PLACES=86, PETRI_TRANSITIONS=72} [2025-03-04 15:20:29,194 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 51 predicate places. [2025-03-04 15:20:29,194 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 72 transitions, 607 flow [2025-03-04 15:20:29,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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:20:29,195 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:29,195 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:29,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 15:20:29,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:20:29,395 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 15:20:29,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:29,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1096111129, now seen corresponding path program 1 times [2025-03-04 15:20:29,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:29,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463626150] [2025-03-04 15:20:29,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:20:29,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:29,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 15:20:29,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 15:20:29,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:29,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:29,541 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-03-04 15:20:29,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:29,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463626150] [2025-03-04 15:20:29,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463626150] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:29,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:20:29,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:20:29,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727449157] [2025-03-04 15:20:29,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:29,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:20:29,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:29,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:20:29,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:20:29,550 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2025-03-04 15:20:29,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 72 transitions, 607 flow. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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:20:29,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:29,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2025-03-04 15:20:29,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:29,676 INFO L124 PetriNetUnfolderBase]: 234/604 cut-off events. [2025-03-04 15:20:29,676 INFO L125 PetriNetUnfolderBase]: For 1697/1698 co-relation queries the response was YES. [2025-03-04 15:20:29,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1918 conditions, 604 events. 234/604 cut-off events. For 1697/1698 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2470 event pairs, 72 based on Foata normal form. 25/624 useless extension candidates. Maximal degree in co-relation 1735. Up to 313 conditions per place. [2025-03-04 15:20:29,678 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 0 selfloop transitions, 0 changer transitions 95/95 dead transitions. [2025-03-04 15:20:29,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 95 transitions, 939 flow [2025-03-04 15:20:29,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:20:29,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:20:29,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2025-03-04 15:20:29,679 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5642857142857143 [2025-03-04 15:20:29,679 INFO L175 Difference]: Start difference. First operand has 86 places, 72 transitions, 607 flow. Second operand 4 states and 79 transitions. [2025-03-04 15:20:29,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 95 transitions, 939 flow [2025-03-04 15:20:29,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 95 transitions, 905 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 15:20:29,683 INFO L231 Difference]: Finished difference. Result has 84 places, 0 transitions, 0 flow [2025-03-04 15:20:29,684 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=569, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=84, PETRI_TRANSITIONS=0} [2025-03-04 15:20:29,684 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 49 predicate places. [2025-03-04 15:20:29,684 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 0 transitions, 0 flow [2025-03-04 15:20:29,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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:20:29,686 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 13 remaining) [2025-03-04 15:20:29,687 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 13 remaining) [2025-03-04 15:20:29,687 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 13 remaining) [2025-03-04 15:20:29,687 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 13 remaining) [2025-03-04 15:20:29,687 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 13 remaining) [2025-03-04 15:20:29,687 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 13 remaining) [2025-03-04 15:20:29,687 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 13 remaining) [2025-03-04 15:20:29,687 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 13 remaining) [2025-03-04 15:20:29,687 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 13 remaining) [2025-03-04 15:20:29,688 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 13 remaining) [2025-03-04 15:20:29,688 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 13 remaining) [2025-03-04 15:20:29,688 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 13 remaining) [2025-03-04 15:20:29,688 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 13 remaining) [2025-03-04 15:20:29,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 15:20:29,688 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:29,692 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 15:20:29,692 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 15:20:29,697 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 03:20:29 BasicIcfg [2025-03-04 15:20:29,698 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 15:20:29,698 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 15:20:29,698 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 15:20:29,698 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 15:20:29,699 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:20:21" (3/4) ... [2025-03-04 15:20:29,700 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 15:20:29,702 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t_fun [2025-03-04 15:20:29,706 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 61 nodes and edges [2025-03-04 15:20:29,707 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2025-03-04 15:20:29,708 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-03-04 15:20:29,708 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-04 15:20:29,708 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-04 15:20:29,709 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 15:20:29,773 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 15:20:29,773 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 15:20:29,773 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 15:20:29,774 INFO L158 Benchmark]: Toolchain (without parser) took 9764.84ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 110.4MB in the beginning and 262.9MB in the end (delta: -152.5MB). Peak memory consumption was 129.2MB. Max. memory is 16.1GB. [2025-03-04 15:20:29,775 INFO L158 Benchmark]: CDTParser took 1.21ms. Allocated memory is still 201.3MB. Free memory is still 123.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:20:29,775 INFO L158 Benchmark]: CACSL2BoogieTranslator took 440.28ms. Allocated memory is still 142.6MB. Free memory was 110.4MB in the beginning and 70.8MB in the end (delta: 39.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-04 15:20:29,775 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.33ms. Allocated memory is still 142.6MB. Free memory was 70.8MB in the beginning and 67.7MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:20:29,776 INFO L158 Benchmark]: Boogie Preprocessor took 46.61ms. Allocated memory is still 142.6MB. Free memory was 67.7MB in the beginning and 64.9MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:20:29,776 INFO L158 Benchmark]: IcfgBuilder took 757.12ms. Allocated memory is still 142.6MB. Free memory was 64.4MB in the beginning and 89.8MB in the end (delta: -25.3MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2025-03-04 15:20:29,777 INFO L158 Benchmark]: TraceAbstraction took 8399.77ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 89.8MB in the beginning and 271.3MB in the end (delta: -181.5MB). Peak memory consumption was 97.9MB. Max. memory is 16.1GB. [2025-03-04 15:20:29,777 INFO L158 Benchmark]: Witness Printer took 75.04ms. Allocated memory is still 427.8MB. Free memory was 271.3MB in the beginning and 262.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:20:29,778 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.21ms. Allocated memory is still 201.3MB. Free memory is still 123.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 440.28ms. Allocated memory is still 142.6MB. Free memory was 110.4MB in the beginning and 70.8MB in the end (delta: 39.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.33ms. Allocated memory is still 142.6MB. Free memory was 70.8MB in the beginning and 67.7MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 46.61ms. Allocated memory is still 142.6MB. Free memory was 67.7MB in the beginning and 64.9MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 757.12ms. Allocated memory is still 142.6MB. Free memory was 64.4MB in the beginning and 89.8MB in the end (delta: -25.3MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 8399.77ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 89.8MB in the beginning and 271.3MB in the end (delta: -181.5MB). Peak memory consumption was 97.9MB. Max. memory is 16.1GB. * Witness Printer took 75.04ms. Allocated memory is still 427.8MB. Free memory was 271.3MB in the beginning and 262.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1253]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1253]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1258]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1258]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1244]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1244]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1242]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1242]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 49 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.3s, OverallIterations: 15, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 695 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 619 mSDsluCounter, 446 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 410 mSDsCounter, 66 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1973 IncrementalHoareTripleChecker+Invalid, 2039 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 66 mSolverCounterUnsat, 36 mSDtfsCounter, 1973 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 330 GetRequests, 205 SyntacticMatches, 11 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 521 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=673occurred in iteration=13, InterpolantAutomatonStates: 98, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 522 NumberOfCodeBlocks, 513 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 578 ConstructedInterpolants, 0 QuantifiedInterpolants, 1010 SizeOfPredicates, 14 NumberOfNonLiveVariables, 3191 ConjunctsInSsa, 41 ConjunctsInUnsatCore, 25 InterpolantComputations, 12 PerfectInterpolantSequences, 691/944 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 15:20:29,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE