./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-overflow.prp --file ../../../trunk/examples/svcomp/goblint-regression/09-regions_11-arraylist_nr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version da043454 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 ../../../trunk/examples/svcomp/goblint-regression/09-regions_11-arraylist_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 c4f9d381010c40c0aeec814019363f065d1b11569cf33ee927950bcd4ef29f20 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:18:54,900 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:18:54,951 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-04-30 10:18:54,956 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:18:54,956 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:18:54,973 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:18:54,974 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:18:54,974 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:18:54,975 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-30 10:18:54,975 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-30 10:18:54,976 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:18:54,976 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:18:54,976 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:18:54,976 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:18:54,977 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:18:54,977 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:18:54,977 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-30 10:18:54,977 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:18:54,977 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:18:54,977 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:18:54,977 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:18:54,977 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-30 10:18:54,977 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:18:54,977 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-30 10:18:54,977 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-04-30 10:18:54,978 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:18:54,978 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:18:54,978 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-30 10:18:54,978 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:18:54,978 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:18:54,978 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:18:54,978 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:18:54,978 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:18:54,978 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:18:54,978 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:18:54,979 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:18:54,979 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:18:54,979 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:18:54,979 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:18:54,979 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:18:54,979 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:18:54,979 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:18:54,979 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-30 10:18:54,979 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-30 10:18:54,979 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:18:54,979 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:18:54,980 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:18:54,980 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:18:54,980 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:18:54,980 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 -> c4f9d381010c40c0aeec814019363f065d1b11569cf33ee927950bcd4ef29f20 [2025-04-30 10:18:55,192 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:18:55,198 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:18:55,200 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:18:55,200 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:18:55,201 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:18:55,201 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/09-regions_11-arraylist_nr.i [2025-04-30 10:18:56,546 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f12998999/a5e486d18b924bc19f0e5d83ee9725d5/FLAG0d3ba22da [2025-04-30 10:18:56,810 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:18:56,810 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/09-regions_11-arraylist_nr.i [2025-04-30 10:18:56,827 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f12998999/a5e486d18b924bc19f0e5d83ee9725d5/FLAG0d3ba22da [2025-04-30 10:18:57,547 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f12998999/a5e486d18b924bc19f0e5d83ee9725d5 [2025-04-30 10:18:57,549 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:18:57,550 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:18:57,552 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:18:57,552 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:18:57,555 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:18:57,556 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:18:57" (1/1) ... [2025-04-30 10:18:57,556 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c870ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:57, skipping insertion in model container [2025-04-30 10:18:57,556 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:18:57" (1/1) ... [2025-04-30 10:18:57,580 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:18:57,988 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:18:58,019 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:18:58,089 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:18:58,154 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:18:58,155 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:58 WrapperNode [2025-04-30 10:18:58,155 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:18:58,156 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:18:58,156 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:18:58,156 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:18:58,161 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:58" (1/1) ... [2025-04-30 10:18:58,177 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:58" (1/1) ... [2025-04-30 10:18:58,198 INFO L138 Inliner]: procedures = 372, calls = 88, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 186 [2025-04-30 10:18:58,198 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:18:58,199 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:18:58,199 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:18:58,199 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:18:58,210 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:58" (1/1) ... [2025-04-30 10:18:58,210 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:58" (1/1) ... [2025-04-30 10:18:58,213 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:58" (1/1) ... [2025-04-30 10:18:58,232 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-04-30 10:18:58,232 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:58" (1/1) ... [2025-04-30 10:18:58,232 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:58" (1/1) ... [2025-04-30 10:18:58,242 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:58" (1/1) ... [2025-04-30 10:18:58,245 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:58" (1/1) ... [2025-04-30 10:18:58,247 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:58" (1/1) ... [2025-04-30 10:18:58,248 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:58" (1/1) ... [2025-04-30 10:18:58,248 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:58" (1/1) ... [2025-04-30 10:18:58,252 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:18:58,253 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:18:58,253 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:18:58,253 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:18:58,253 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:58" (1/1) ... [2025-04-30 10:18:58,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:18:58,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:18:58,278 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-04-30 10:18:58,280 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-04-30 10:18:58,295 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-30 10:18:58,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-30 10:18:58,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-04-30 10:18:58,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-30 10:18:58,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-30 10:18:58,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-04-30 10:18:58,296 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-30 10:18:58,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-30 10:18:58,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-30 10:18:58,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-30 10:18:58,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-30 10:18:58,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-30 10:18:58,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-30 10:18:58,297 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-30 10:18:58,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-30 10:18:58,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:18:58,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-30 10:18:58,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-30 10:18:58,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-04-30 10:18:58,298 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-30 10:18:58,298 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-30 10:18:58,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-30 10:18:58,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-30 10:18:58,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-30 10:18:58,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:18:58,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:18:58,300 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-30 10:18:58,425 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:18:58,427 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:18:58,724 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-30 10:18:58,724 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:18:59,021 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:18:59,022 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-30 10:18:59,022 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:18:59 BoogieIcfgContainer [2025-04-30 10:18:59,022 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:18:59,023 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:18:59,023 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:18:59,026 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:18:59,027 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:18:57" (1/3) ... [2025-04-30 10:18:59,027 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ecdba19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:18:59, skipping insertion in model container [2025-04-30 10:18:59,027 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:58" (2/3) ... [2025-04-30 10:18:59,028 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ecdba19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:18:59, skipping insertion in model container [2025-04-30 10:18:59,029 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:18:59" (3/3) ... [2025-04-30 10:18:59,030 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_11-arraylist_nr.i [2025-04-30 10:18:59,040 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:18:59,041 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_11-arraylist_nr.i that has 2 procedures, 24 locations, 24 edges, 1 initial locations, 2 loop locations, and 4 error locations. [2025-04-30 10:18:59,041 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-30 10:18:59,074 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-30 10:18:59,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 25 transitions, 54 flow [2025-04-30 10:18:59,120 INFO L116 PetriNetUnfolderBase]: 2/24 cut-off events. [2025-04-30 10:18:59,123 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:18:59,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28 conditions, 24 events. 2/24 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 44 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 13. Up to 2 conditions per place. [2025-04-30 10:18:59,127 INFO L82 GeneralOperation]: Start removeDead. Operand has 27 places, 25 transitions, 54 flow [2025-04-30 10:18:59,128 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 11 places, 12 transitions, 24 flow [2025-04-30 10:18:59,136 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:18:59,149 INFO L340 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;@7a11a3c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:18:59,149 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-30 10:18:59,153 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-30 10:18:59,154 INFO L116 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-04-30 10:18:59,154 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:18:59,154 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:18:59,154 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-04-30 10:18:59,155 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2025-04-30 10:18:59,158 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:18:59,158 INFO L85 PathProgramCache]: Analyzing trace with hash 493539, now seen corresponding path program 1 times [2025-04-30 10:18:59,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:18:59,164 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776554518] [2025-04-30 10:18:59,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:59,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:18:59,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-30 10:18:59,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-30 10:18:59,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:59,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:59,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:18:59,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:18:59,419 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776554518] [2025-04-30 10:18:59,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776554518] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:18:59,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:18:59,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:18:59,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171426943] [2025-04-30 10:18:59,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:18:59,427 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:18:59,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:18:59,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:18:59,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:18:59,477 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 25 [2025-04-30 10:18:59,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 11 places, 12 transitions, 24 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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-04-30 10:18:59,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:18:59,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 25 [2025-04-30 10:18:59,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:18:59,545 INFO L116 PetriNetUnfolderBase]: 2/15 cut-off events. [2025-04-30 10:18:59,545 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:18:59,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 15 events. 2/15 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 13 event pairs, 0 based on Foata normal form. 1/13 useless extension candidates. Maximal degree in co-relation 0. Up to 9 conditions per place. [2025-04-30 10:18:59,546 INFO L140 encePairwiseOnDemand]: 19/25 looper letters, 7 selfloop transitions, 3 changer transitions 0/14 dead transitions. [2025-04-30 10:18:59,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 14 places, 14 transitions, 48 flow [2025-04-30 10:18:59,547 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:18:59,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-30 10:18:59,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2025-04-30 10:18:59,555 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.33 [2025-04-30 10:18:59,556 INFO L175 Difference]: Start difference. First operand has 11 places, 12 transitions, 24 flow. Second operand 4 states and 33 transitions. [2025-04-30 10:18:59,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 14 places, 14 transitions, 48 flow [2025-04-30 10:18:59,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 14 places, 14 transitions, 48 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:18:59,562 INFO L231 Difference]: Finished difference. Result has 16 places, 14 transitions, 48 flow [2025-04-30 10:18:59,564 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=24, PETRI_DIFFERENCE_MINUEND_PLACES=11, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=12, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=48, PETRI_PLACES=16, PETRI_TRANSITIONS=14} [2025-04-30 10:18:59,566 INFO L279 CegarLoopForPetriNet]: 11 programPoint places, 5 predicate places. [2025-04-30 10:18:59,567 INFO L485 AbstractCegarLoop]: Abstraction has has 16 places, 14 transitions, 48 flow [2025-04-30 10:18:59,567 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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-04-30 10:18:59,567 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:18:59,568 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-04-30 10:18:59,568 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:18:59,568 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2025-04-30 10:18:59,568 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:18:59,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1818595663, now seen corresponding path program 1 times [2025-04-30 10:18:59,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:18:59,569 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753225108] [2025-04-30 10:18:59,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:59,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:18:59,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-30 10:18:59,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-30 10:18:59,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:59,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:59,694 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:18:59,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:18:59,694 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753225108] [2025-04-30 10:18:59,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753225108] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:18:59,694 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344540828] [2025-04-30 10:18:59,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:59,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:18:59,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:18:59,696 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-04-30 10:18:59,698 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-04-30 10:18:59,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-30 10:18:59,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-30 10:18:59,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:59,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:59,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-30 10:18:59,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:18:59,818 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:18:59,819 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:18:59,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1344540828] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:18:59,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:18:59,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-04-30 10:18:59,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228567588] [2025-04-30 10:18:59,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:18:59,821 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:18:59,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:18:59,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:18:59,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:18:59,830 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 25 [2025-04-30 10:18:59,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 16 places, 14 transitions, 48 flow. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 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-04-30 10:18:59,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:18:59,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 25 [2025-04-30 10:18:59,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:18:59,907 INFO L116 PetriNetUnfolderBase]: 2/14 cut-off events. [2025-04-30 10:18:59,907 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-30 10:18:59,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 14 events. 2/14 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 9 event pairs, 0 based on Foata normal form. 1/12 useless extension candidates. Maximal degree in co-relation 20. Up to 4 conditions per place. [2025-04-30 10:18:59,908 INFO L140 encePairwiseOnDemand]: 20/25 looper letters, 3 selfloop transitions, 6 changer transitions 0/13 dead transitions. [2025-04-30 10:18:59,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 13 transitions, 62 flow [2025-04-30 10:18:59,909 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:18:59,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:18:59,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2025-04-30 10:18:59,909 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.26666666666666666 [2025-04-30 10:18:59,909 INFO L175 Difference]: Start difference. First operand has 16 places, 14 transitions, 48 flow. Second operand 6 states and 40 transitions. [2025-04-30 10:18:59,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 13 transitions, 62 flow [2025-04-30 10:18:59,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 13 transitions, 60 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:18:59,910 INFO L231 Difference]: Finished difference. Result has 19 places, 13 transitions, 54 flow [2025-04-30 10:18:59,910 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=14, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=13, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=7, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=54, PETRI_PLACES=19, PETRI_TRANSITIONS=13} [2025-04-30 10:18:59,911 INFO L279 CegarLoopForPetriNet]: 11 programPoint places, 8 predicate places. [2025-04-30 10:18:59,911 INFO L485 AbstractCegarLoop]: Abstraction has has 19 places, 13 transitions, 54 flow [2025-04-30 10:18:59,911 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 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-04-30 10:18:59,911 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:18:59,911 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-04-30 10:18:59,918 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-30 10:19:00,111 WARN L466 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-04-30 10:19:00,112 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2025-04-30 10:19:00,112 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:19:00,112 INFO L85 PathProgramCache]: Analyzing trace with hash 541891185, now seen corresponding path program 1 times [2025-04-30 10:19:00,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:19:00,112 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444434424] [2025-04-30 10:19:00,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:19:00,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:19:00,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:19:00,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:19:00,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:19:00,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:19:00,182 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:19:00,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:19:00,182 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444434424] [2025-04-30 10:19:00,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444434424] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:19:00,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:19:00,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:19:00,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095395762] [2025-04-30 10:19:00,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:19:00,183 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:19:00,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:19:00,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:19:00,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:19:00,187 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 25 [2025-04-30 10:19:00,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 13 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-04-30 10:19:00,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:19:00,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 25 [2025-04-30 10:19:00,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:19:00,231 INFO L116 PetriNetUnfolderBase]: 2/13 cut-off events. [2025-04-30 10:19:00,231 INFO L117 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-04-30 10:19:00,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 13 events. 2/13 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 6 event pairs, 0 based on Foata normal form. 1/12 useless extension candidates. Maximal degree in co-relation 16. Up to 7 conditions per place. [2025-04-30 10:19:00,232 INFO L140 encePairwiseOnDemand]: 22/25 looper letters, 4 selfloop transitions, 4 changer transitions 0/12 dead transitions. [2025-04-30 10:19:00,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 12 transitions, 66 flow [2025-04-30 10:19:00,233 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:19:00,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:19:00,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2025-04-30 10:19:00,234 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.29333333333333333 [2025-04-30 10:19:00,234 INFO L175 Difference]: Start difference. First operand has 19 places, 13 transitions, 54 flow. Second operand 3 states and 22 transitions. [2025-04-30 10:19:00,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 12 transitions, 66 flow [2025-04-30 10:19:00,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 14 places, 12 transitions, 44 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-04-30 10:19:00,235 INFO L231 Difference]: Finished difference. Result has 14 places, 12 transitions, 36 flow [2025-04-30 10:19:00,235 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=28, PETRI_DIFFERENCE_MINUEND_PLACES=12, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=12, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=36, PETRI_PLACES=14, PETRI_TRANSITIONS=12} [2025-04-30 10:19:00,235 INFO L279 CegarLoopForPetriNet]: 11 programPoint places, 3 predicate places. [2025-04-30 10:19:00,236 INFO L485 AbstractCegarLoop]: Abstraction has has 14 places, 12 transitions, 36 flow [2025-04-30 10:19:00,236 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-04-30 10:19:00,236 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:19:00,236 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:19:00,236 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:19:00,237 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2025-04-30 10:19:00,237 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:19:00,237 INFO L85 PathProgramCache]: Analyzing trace with hash 541891976, now seen corresponding path program 1 times [2025-04-30 10:19:00,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:19:00,238 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478756107] [2025-04-30 10:19:00,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:19:00,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:19:00,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:19:00,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:19:00,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:19:00,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:19:00,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:19:00,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:19:00,376 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478756107] [2025-04-30 10:19:00,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478756107] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:19:00,376 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [704513266] [2025-04-30 10:19:00,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:19:00,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:19:00,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:19:00,381 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-04-30 10:19:00,382 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-04-30 10:19:00,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:19:00,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:19:00,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:19:00,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:19:00,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-30 10:19:00,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:19:00,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:19:00,505 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:19:00,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:19:00,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [704513266] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:19:00,529 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:19:00,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-04-30 10:19:00,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3265958] [2025-04-30 10:19:00,529 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:19:00,529 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:19:00,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:19:00,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:19:00,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:19:00,541 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 25 [2025-04-30 10:19:00,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 14 places, 12 transitions, 36 flow. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 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-04-30 10:19:00,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:19:00,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 25 [2025-04-30 10:19:00,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:19:00,675 INFO L116 PetriNetUnfolderBase]: 2/17 cut-off events. [2025-04-30 10:19:00,675 INFO L117 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-04-30 10:19:00,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 17 events. 2/17 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 3 event pairs, 0 based on Foata normal form. 2/18 useless extension candidates. Maximal degree in co-relation 9. Up to 5 conditions per place. [2025-04-30 10:19:00,675 INFO L140 encePairwiseOnDemand]: 21/25 looper letters, 4 selfloop transitions, 7 changer transitions 0/15 dead transitions. [2025-04-30 10:19:00,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 15 transitions, 73 flow [2025-04-30 10:19:00,678 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:19:00,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-30 10:19:00,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 48 transitions. [2025-04-30 10:19:00,678 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2742857142857143 [2025-04-30 10:19:00,678 INFO L175 Difference]: Start difference. First operand has 14 places, 12 transitions, 36 flow. Second operand 7 states and 48 transitions. [2025-04-30 10:19:00,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 15 transitions, 73 flow [2025-04-30 10:19:00,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 18 places, 15 transitions, 59 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:19:00,679 INFO L231 Difference]: Finished difference. Result has 20 places, 15 transitions, 62 flow [2025-04-30 10:19:00,679 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=28, PETRI_DIFFERENCE_MINUEND_PLACES=12, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=12, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=7, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=62, PETRI_PLACES=20, PETRI_TRANSITIONS=15} [2025-04-30 10:19:00,680 INFO L279 CegarLoopForPetriNet]: 11 programPoint places, 9 predicate places. [2025-04-30 10:19:00,680 INFO L485 AbstractCegarLoop]: Abstraction has has 20 places, 15 transitions, 62 flow [2025-04-30 10:19:00,680 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 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-04-30 10:19:00,680 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:19:00,680 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1] [2025-04-30 10:19:00,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-30 10:19:00,880 WARN L466 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-04-30 10:19:00,881 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2025-04-30 10:19:00,881 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:19:00,881 INFO L85 PathProgramCache]: Analyzing trace with hash -35334648, now seen corresponding path program 2 times [2025-04-30 10:19:00,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:19:00,881 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400717594] [2025-04-30 10:19:00,881 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:19:00,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:19:00,901 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-04-30 10:19:00,908 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 13 statements. [2025-04-30 10:19:00,908 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:19:00,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:19:01,005 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-30 10:19:01,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:19:01,006 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400717594] [2025-04-30 10:19:01,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400717594] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:19:01,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:19:01,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:19:01,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069257130] [2025-04-30 10:19:01,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:19:01,006 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:19:01,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:19:01,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:19:01,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:19:01,015 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 25 [2025-04-30 10:19:01,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 15 transitions, 62 flow. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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-04-30 10:19:01,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:19:01,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 25 [2025-04-30 10:19:01,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:19:01,079 INFO L116 PetriNetUnfolderBase]: 2/20 cut-off events. [2025-04-30 10:19:01,079 INFO L117 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-04-30 10:19:01,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 20 events. 2/20 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 4 event pairs, 0 based on Foata normal form. 1/20 useless extension candidates. Maximal degree in co-relation 18. Up to 14 conditions per place. [2025-04-30 10:19:01,080 INFO L140 encePairwiseOnDemand]: 20/25 looper letters, 12 selfloop transitions, 3 changer transitions 0/17 dead transitions. [2025-04-30 10:19:01,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 17 transitions, 96 flow [2025-04-30 10:19:01,082 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:19:01,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-30 10:19:01,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2025-04-30 10:19:01,083 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.32 [2025-04-30 10:19:01,083 INFO L175 Difference]: Start difference. First operand has 20 places, 15 transitions, 62 flow. Second operand 4 states and 32 transitions. [2025-04-30 10:19:01,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 17 transitions, 96 flow [2025-04-30 10:19:01,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 17 transitions, 92 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:19:01,084 INFO L231 Difference]: Finished difference. Result has 23 places, 17 transitions, 80 flow [2025-04-30 10:19:01,084 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=80, PETRI_PLACES=23, PETRI_TRANSITIONS=17} [2025-04-30 10:19:01,084 INFO L279 CegarLoopForPetriNet]: 11 programPoint places, 12 predicate places. [2025-04-30 10:19:01,084 INFO L485 AbstractCegarLoop]: Abstraction has has 23 places, 17 transitions, 80 flow [2025-04-30 10:19:01,085 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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-04-30 10:19:01,085 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:19:01,085 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1] [2025-04-30 10:19:01,085 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:19:01,085 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2025-04-30 10:19:01,085 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:19:01,085 INFO L85 PathProgramCache]: Analyzing trace with hash -387023883, now seen corresponding path program 1 times [2025-04-30 10:19:01,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:19:01,085 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130888940] [2025-04-30 10:19:01,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:19:01,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:19:01,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-30 10:19:01,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-30 10:19:01,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:19:01,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:19:01,283 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-30 10:19:01,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:19:01,283 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130888940] [2025-04-30 10:19:01,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130888940] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:19:01,283 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82497176] [2025-04-30 10:19:01,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:19:01,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:19:01,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:19:01,285 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-04-30 10:19:01,287 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-04-30 10:19:01,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-30 10:19:01,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-30 10:19:01,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:19:01,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:19:01,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-30 10:19:01,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:19:01,484 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-30 10:19:01,484 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:19:01,560 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-30 10:19:01,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [82497176] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:19:01,560 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:19:01,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-04-30 10:19:01,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010961666] [2025-04-30 10:19:01,561 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:19:01,561 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-30 10:19:01,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:19:01,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-30 10:19:01,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-04-30 10:19:01,577 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 25 [2025-04-30 10:19:01,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 17 transitions, 80 flow. Second operand has 18 states, 18 states have (on average 6.166666666666667) internal successors, (111), 18 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:19:01,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:19:01,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 25 [2025-04-30 10:19:01,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:19:01,826 INFO L116 PetriNetUnfolderBase]: 2/32 cut-off events. [2025-04-30 10:19:01,827 INFO L117 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2025-04-30 10:19:01,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 32 events. 2/32 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 4 event pairs, 0 based on Foata normal form. 4/36 useless extension candidates. Maximal degree in co-relation 72. Up to 8 conditions per place. [2025-04-30 10:19:01,827 INFO L140 encePairwiseOnDemand]: 21/25 looper letters, 6 selfloop transitions, 15 changer transitions 0/25 dead transitions. [2025-04-30 10:19:01,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 25 transitions, 170 flow [2025-04-30 10:19:01,828 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-30 10:19:01,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-30 10:19:01,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 98 transitions. [2025-04-30 10:19:01,829 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2613333333333333 [2025-04-30 10:19:01,829 INFO L175 Difference]: Start difference. First operand has 23 places, 17 transitions, 80 flow. Second operand 15 states and 98 transitions. [2025-04-30 10:19:01,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 25 transitions, 170 flow [2025-04-30 10:19:01,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 25 transitions, 168 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:19:01,831 INFO L231 Difference]: Finished difference. Result has 40 places, 25 transitions, 175 flow [2025-04-30 10:19:01,831 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=175, PETRI_PLACES=40, PETRI_TRANSITIONS=25} [2025-04-30 10:19:01,832 INFO L279 CegarLoopForPetriNet]: 11 programPoint places, 29 predicate places. [2025-04-30 10:19:01,832 INFO L485 AbstractCegarLoop]: Abstraction has has 40 places, 25 transitions, 175 flow [2025-04-30 10:19:01,832 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.166666666666667) internal successors, (111), 18 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:19:01,832 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:19:01,832 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 2, 1, 1, 1, 1, 1] [2025-04-30 10:19:01,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-30 10:19:02,036 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:19:02,036 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2025-04-30 10:19:02,037 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:19:02,037 INFO L85 PathProgramCache]: Analyzing trace with hash -55735563, now seen corresponding path program 2 times [2025-04-30 10:19:02,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:19:02,037 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871373523] [2025-04-30 10:19:02,037 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:19:02,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:19:02,069 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-30 10:19:02,087 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-30 10:19:02,087 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:19:02,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:19:02,216 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-04-30 10:19:02,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:19:02,216 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871373523] [2025-04-30 10:19:02,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871373523] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:19:02,217 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277868929] [2025-04-30 10:19:02,217 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:19:02,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:19:02,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:19:02,219 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-04-30 10:19:02,220 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-04-30 10:19:02,307 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-30 10:19:02,380 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-30 10:19:02,380 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:19:02,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:19:02,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-30 10:19:02,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:19:02,554 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-30 10:19:02,554 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:19:02,740 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-30 10:19:02,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1277868929] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:19:02,740 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:19:02,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 16, 16] total 25 [2025-04-30 10:19:02,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116977267] [2025-04-30 10:19:02,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:19:02,741 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-30 10:19:02,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:19:02,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-30 10:19:02,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=472, Unknown=0, NotChecked=0, Total=600 [2025-04-30 10:19:02,800 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 25 [2025-04-30 10:19:02,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 25 transitions, 175 flow. Second operand has 25 states, 25 states have (on average 4.32) internal successors, (108), 25 states have internal predecessors, (108), 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-04-30 10:19:02,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:19:02,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 25 [2025-04-30 10:19:02,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:19:03,178 INFO L116 PetriNetUnfolderBase]: 2/40 cut-off events. [2025-04-30 10:19:03,178 INFO L117 PetriNetUnfolderBase]: For 122/122 co-relation queries the response was YES. [2025-04-30 10:19:03,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162 conditions, 40 events. 2/40 cut-off events. For 122/122 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 2 event pairs, 0 based on Foata normal form. 4/43 useless extension candidates. Maximal degree in co-relation 132. Up to 11 conditions per place. [2025-04-30 10:19:03,179 INFO L140 encePairwiseOnDemand]: 18/25 looper letters, 2 selfloop transitions, 26 changer transitions 0/30 dead transitions. [2025-04-30 10:19:03,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 30 transitions, 281 flow [2025-04-30 10:19:03,179 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-30 10:19:03,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-04-30 10:19:03,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 107 transitions. [2025-04-30 10:19:03,182 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.1712 [2025-04-30 10:19:03,182 INFO L175 Difference]: Start difference. First operand has 40 places, 25 transitions, 175 flow. Second operand 25 states and 107 transitions. [2025-04-30 10:19:03,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 30 transitions, 281 flow [2025-04-30 10:19:03,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 30 transitions, 271 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-04-30 10:19:03,184 INFO L231 Difference]: Finished difference. Result has 59 places, 30 transitions, 269 flow [2025-04-30 10:19:03,184 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=269, PETRI_PLACES=59, PETRI_TRANSITIONS=30} [2025-04-30 10:19:03,184 INFO L279 CegarLoopForPetriNet]: 11 programPoint places, 48 predicate places. [2025-04-30 10:19:03,185 INFO L485 AbstractCegarLoop]: Abstraction has has 59 places, 30 transitions, 269 flow [2025-04-30 10:19:03,185 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 4.32) internal successors, (108), 25 states have internal predecessors, (108), 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-04-30 10:19:03,185 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:19:03,185 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1] [2025-04-30 10:19:03,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-30 10:19:03,390 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:19:03,392 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2025-04-30 10:19:03,392 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:19:03,392 INFO L85 PathProgramCache]: Analyzing trace with hash -940832894, now seen corresponding path program 1 times [2025-04-30 10:19:03,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:19:03,392 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594630501] [2025-04-30 10:19:03,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:19:03,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:19:03,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-30 10:19:03,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-30 10:19:03,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:19:03,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:19:03,474 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-04-30 10:19:03,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:19:03,475 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594630501] [2025-04-30 10:19:03,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594630501] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:19:03,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:19:03,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:19:03,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674711327] [2025-04-30 10:19:03,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:19:03,475 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:19:03,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:19:03,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:19:03,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:19:03,478 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 25 [2025-04-30 10:19:03,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 30 transitions, 269 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-04-30 10:19:03,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:19:03,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 25 [2025-04-30 10:19:03,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:19:03,519 INFO L116 PetriNetUnfolderBase]: 2/39 cut-off events. [2025-04-30 10:19:03,519 INFO L117 PetriNetUnfolderBase]: For 133/133 co-relation queries the response was YES. [2025-04-30 10:19:03,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 182 conditions, 39 events. 2/39 cut-off events. For 133/133 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 2 event pairs, 0 based on Foata normal form. 1/40 useless extension candidates. Maximal degree in co-relation 150. Up to 26 conditions per place. [2025-04-30 10:19:03,520 INFO L140 encePairwiseOnDemand]: 22/25 looper letters, 0 selfloop transitions, 0 changer transitions 29/29 dead transitions. [2025-04-30 10:19:03,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 29 transitions, 319 flow [2025-04-30 10:19:03,524 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:19:03,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:19:03,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2025-04-30 10:19:03,524 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.29333333333333333 [2025-04-30 10:19:03,524 INFO L175 Difference]: Start difference. First operand has 59 places, 30 transitions, 269 flow. Second operand 3 states and 22 transitions. [2025-04-30 10:19:03,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 29 transitions, 319 flow [2025-04-30 10:19:03,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 29 transitions, 239 flow, removed 9 selfloop flow, removed 22 redundant places. [2025-04-30 10:19:03,526 INFO L231 Difference]: Finished difference. Result has 38 places, 0 transitions, 0 flow [2025-04-30 10:19:03,526 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=38, PETRI_TRANSITIONS=0} [2025-04-30 10:19:03,526 INFO L279 CegarLoopForPetriNet]: 11 programPoint places, 27 predicate places. [2025-04-30 10:19:03,526 INFO L485 AbstractCegarLoop]: Abstraction has has 38 places, 0 transitions, 0 flow [2025-04-30 10:19:03,527 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-04-30 10:19:03,528 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 5 remaining) [2025-04-30 10:19:03,529 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 5 remaining) [2025-04-30 10:19:03,529 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 5 remaining) [2025-04-30 10:19:03,529 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 5 remaining) [2025-04-30 10:19:03,529 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2025-04-30 10:19:03,529 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-30 10:19:03,529 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1] [2025-04-30 10:19:03,531 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-30 10:19:03,531 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-30 10:19:03,534 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.04 10:19:03 BasicIcfg [2025-04-30 10:19:03,534 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-30 10:19:03,535 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-30 10:19:03,535 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-30 10:19:03,535 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-30 10:19:03,535 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:18:59" (3/4) ... [2025-04-30 10:19:03,537 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-04-30 10:19:03,539 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure t_fun [2025-04-30 10:19:03,542 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 129 nodes and edges [2025-04-30 10:19:03,543 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-04-30 10:19:03,543 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-04-30 10:19:03,543 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-04-30 10:19:03,604 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-30 10:19:03,604 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-30 10:19:03,604 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-30 10:19:03,605 INFO L158 Benchmark]: Toolchain (without parser) took 6054.05ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 108.9MB in the beginning and 114.3MB in the end (delta: -5.5MB). Peak memory consumption was 157.0MB. Max. memory is 16.1GB. [2025-04-30 10:19:03,605 INFO L158 Benchmark]: CDTParser took 2.27ms. Allocated memory is still 201.3MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:19:03,605 INFO L158 Benchmark]: CACSL2BoogieTranslator took 603.87ms. Allocated memory is still 142.6MB. Free memory was 108.9MB in the beginning and 65.2MB in the end (delta: 43.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-04-30 10:19:03,605 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.38ms. Allocated memory is still 142.6MB. Free memory was 65.2MB in the beginning and 62.0MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-30 10:19:03,605 INFO L158 Benchmark]: Boogie Preprocessor took 53.12ms. Allocated memory is still 142.6MB. Free memory was 62.0MB in the beginning and 58.6MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:19:03,605 INFO L158 Benchmark]: RCFGBuilder took 769.49ms. Allocated memory is still 142.6MB. Free memory was 58.6MB in the beginning and 82.2MB in the end (delta: -23.6MB). Peak memory consumption was 36.0MB. Max. memory is 16.1GB. [2025-04-30 10:19:03,605 INFO L158 Benchmark]: TraceAbstraction took 4510.94ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 81.4MB in the beginning and 119.7MB in the end (delta: -38.4MB). Peak memory consumption was 116.7MB. Max. memory is 16.1GB. [2025-04-30 10:19:03,605 INFO L158 Benchmark]: Witness Printer took 69.25ms. Allocated memory is still 302.0MB. Free memory was 119.7MB in the beginning and 114.3MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-30 10:19:03,606 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 2.27ms. Allocated memory is still 201.3MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 603.87ms. Allocated memory is still 142.6MB. Free memory was 108.9MB in the beginning and 65.2MB in the end (delta: 43.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.38ms. Allocated memory is still 142.6MB. Free memory was 65.2MB in the beginning and 62.0MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.12ms. Allocated memory is still 142.6MB. Free memory was 62.0MB in the beginning and 58.6MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 769.49ms. Allocated memory is still 142.6MB. Free memory was 58.6MB in the beginning and 82.2MB in the end (delta: -23.6MB). Peak memory consumption was 36.0MB. Max. memory is 16.1GB. * TraceAbstraction took 4510.94ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 81.4MB in the beginning and 119.7MB in the end (delta: -38.4MB). Peak memory consumption was 116.7MB. Max. memory is 16.1GB. * Witness Printer took 69.25ms. Allocated memory is still 302.0MB. Free memory was 119.7MB in the beginning and 114.3MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1254]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1254]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1260]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1260]: 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, 31 locations, 31 edges, 5 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: 4.4s, OverallIterations: 8, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 158 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 132 mSDsluCounter, 202 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 198 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 428 IncrementalHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 4 mSDtfsCounter, 428 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 154 GetRequests, 61 SyntacticMatches, 11 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=269occurred in iteration=7, InterpolantAutomatonStates: 67, 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.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 175 NumberOfCodeBlocks, 166 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 211 ConstructedInterpolants, 0 QuantifiedInterpolants, 429 SizeOfPredicates, 13 NumberOfNonLiveVariables, 1316 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 15 InterpolantComputations, 5 PerfectInterpolantSequences, 245/428 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 4 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-30 10:19:03,618 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE