./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_11-arraylist_nr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/09-regions_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-?-e2fb8be-m [2025-03-09 06:33:37,921 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 06:33:37,971 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 06:33:37,977 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 06:33:37,977 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 06:33:37,997 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 06:33:37,997 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 06:33:37,997 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 06:33:37,998 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 06:33:37,998 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 06:33:37,998 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 06:33:37,998 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 06:33:37,998 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 06:33:37,998 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 06:33:37,998 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 06:33:37,998 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 06:33:37,998 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 06:33:37,998 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 06:33:37,998 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 06:33:37,998 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 06:33:37,998 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 06:33:37,998 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 06:33:38,001 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 06:33:38,001 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 06:33:38,001 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 06:33:38,001 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 06:33:38,001 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 06:33:38,001 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 06:33:38,001 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 06:33:38,001 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 06:33:38,002 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 06:33:38,002 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 06:33:38,002 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 06:33:38,002 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 06:33:38,002 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 06:33:38,002 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 06:33:38,002 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 06:33:38,002 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 06:33:38,003 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 06:33:38,003 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 06:33:38,003 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 06:33:38,003 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 06:33:38,003 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 06:33:38,003 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 06:33:38,003 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 06:33:38,003 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-03-09 06:33:38,236 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 06:33:38,244 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 06:33:38,248 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 06:33:38,249 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 06:33:38,249 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 06:33:38,251 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_11-arraylist_nr.i [2025-03-09 06:33:39,402 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/010aa3f5b/4adf02ff86a74d68ac61e6e895faf048/FLAGff6b32564 [2025-03-09 06:33:39,749 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 06:33:39,749 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_11-arraylist_nr.i [2025-03-09 06:33:39,768 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/010aa3f5b/4adf02ff86a74d68ac61e6e895faf048/FLAGff6b32564 [2025-03-09 06:33:39,974 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/010aa3f5b/4adf02ff86a74d68ac61e6e895faf048 [2025-03-09 06:33:39,978 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 06:33:39,979 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 06:33:39,980 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 06:33:39,980 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 06:33:39,982 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 06:33:39,983 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:33:39" (1/1) ... [2025-03-09 06:33:39,983 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@866fe6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:33:39, skipping insertion in model container [2025-03-09 06:33:39,984 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:33:39" (1/1) ... [2025-03-09 06:33:40,011 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 06:33:40,388 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:33:40,410 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 06:33:40,445 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:33:40,503 INFO L204 MainTranslator]: Completed translation [2025-03-09 06:33:40,504 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:33:40 WrapperNode [2025-03-09 06:33:40,504 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 06:33:40,505 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 06:33:40,505 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 06:33:40,505 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 06:33:40,509 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:33:40" (1/1) ... [2025-03-09 06:33:40,521 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:33:40" (1/1) ... [2025-03-09 06:33:40,540 INFO L138 Inliner]: procedures = 372, calls = 88, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 186 [2025-03-09 06:33:40,540 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 06:33:40,540 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 06:33:40,540 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 06:33:40,540 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 06:33:40,547 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:33:40" (1/1) ... [2025-03-09 06:33:40,547 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:33:40" (1/1) ... [2025-03-09 06:33:40,550 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:33:40" (1/1) ... [2025-03-09 06:33:40,564 INFO L175 MemorySlicer]: Split 78 memory accesses to 3 slices as follows [50, 14, 14]. 64 percent of accesses are in the largest equivalence class. The 60 initializations are split as follows [50, 10, 0]. The 11 writes are split as follows [0, 1, 10]. [2025-03-09 06:33:40,564 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:33:40" (1/1) ... [2025-03-09 06:33:40,564 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:33:40" (1/1) ... [2025-03-09 06:33:40,573 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:33:40" (1/1) ... [2025-03-09 06:33:40,576 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:33:40" (1/1) ... [2025-03-09 06:33:40,578 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:33:40" (1/1) ... [2025-03-09 06:33:40,579 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:33:40" (1/1) ... [2025-03-09 06:33:40,581 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 06:33:40,581 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 06:33:40,581 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 06:33:40,581 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 06:33:40,582 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:33:40" (1/1) ... [2025-03-09 06:33:40,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 06:33:40,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:33:40,609 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 06:33:40,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 06:33:40,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-09 06:33:40,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-09 06:33:40,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-09 06:33:40,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-09 06:33:40,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-09 06:33:40,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-09 06:33:40,626 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-09 06:33:40,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 06:33:40,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 06:33:40,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 06:33:40,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 06:33:40,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 06:33:40,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 06:33:40,627 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-09 06:33:40,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 06:33:40,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 06:33:40,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-09 06:33:40,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-09 06:33:40,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-09 06:33:40,627 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-09 06:33:40,627 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-09 06:33:40,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 06:33:40,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 06:33:40,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 06:33:40,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 06:33:40,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 06:33:40,628 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 06:33:40,737 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 06:33:40,738 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 06:33:41,035 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 06:33:41,036 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 06:33:41,338 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 06:33:41,338 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 06:33:41,338 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:33:41 BoogieIcfgContainer [2025-03-09 06:33:41,339 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 06:33:41,359 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 06:33:41,363 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 06:33:41,366 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 06:33:41,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 06:33:39" (1/3) ... [2025-03-09 06:33:41,367 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b561b97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:33:41, skipping insertion in model container [2025-03-09 06:33:41,367 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:33:40" (2/3) ... [2025-03-09 06:33:41,367 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b561b97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:33:41, skipping insertion in model container [2025-03-09 06:33:41,367 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:33:41" (3/3) ... [2025-03-09 06:33:41,368 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_11-arraylist_nr.i [2025-03-09 06:33:41,379 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 06:33:41,380 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_11-arraylist_nr.i that has 2 procedures, 24 locations, 1 initial locations, 2 loop locations, and 4 error locations. [2025-03-09 06:33:41,380 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 06:33:41,422 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-09 06:33:41,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 25 transitions, 54 flow [2025-03-09 06:33:41,476 INFO L124 PetriNetUnfolderBase]: 2/24 cut-off events. [2025-03-09 06:33:41,477 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 06:33:41,480 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 4. Compared 39 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-03-09 06:33:41,480 INFO L82 GeneralOperation]: Start removeDead. Operand has 27 places, 25 transitions, 54 flow [2025-03-09 06:33:41,482 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 11 places, 12 transitions, 24 flow [2025-03-09 06:33:41,491 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 06:33:41,500 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3f0e7f7e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 06:33:41,500 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-09 06:33:41,504 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 06:33:41,504 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-03-09 06:33:41,505 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 06:33:41,505 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:33:41,505 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 06:33:41,505 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2025-03-09 06:33:41,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:33:41,509 INFO L85 PathProgramCache]: Analyzing trace with hash 455014, now seen corresponding path program 1 times [2025-03-09 06:33:41,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:33:41,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249171550] [2025-03-09 06:33:41,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:33:41,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:33:41,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:33:41,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:33:41,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:33:41,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:33:41,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:33:41,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:33:41,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249171550] [2025-03-09 06:33:41,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249171550] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:33:41,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:33:41,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:33:41,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011673396] [2025-03-09 06:33:41,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:33:41,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:33:41,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:33:41,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:33:41,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:33:41,810 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 25 [2025-03-09 06:33:41,813 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-03-09 06:33:41,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:33:41,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 25 [2025-03-09 06:33:41,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:33:41,898 INFO L124 PetriNetUnfolderBase]: 2/15 cut-off events. [2025-03-09 06:33:41,898 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 06:33:41,899 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 14 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-03-09 06:33:41,899 INFO L140 encePairwiseOnDemand]: 19/25 looper letters, 7 selfloop transitions, 3 changer transitions 0/14 dead transitions. [2025-03-09 06:33:41,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 14 places, 14 transitions, 48 flow [2025-03-09 06:33:41,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:33:41,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:33:41,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2025-03-09 06:33:41,908 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.33 [2025-03-09 06:33:41,909 INFO L175 Difference]: Start difference. First operand has 11 places, 12 transitions, 24 flow. Second operand 4 states and 33 transitions. [2025-03-09 06:33:41,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 14 places, 14 transitions, 48 flow [2025-03-09 06:33:41,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 14 places, 14 transitions, 48 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 06:33:41,913 INFO L231 Difference]: Finished difference. Result has 16 places, 14 transitions, 48 flow [2025-03-09 06:33:41,914 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-03-09 06:33:41,917 INFO L279 CegarLoopForPetriNet]: 11 programPoint places, 5 predicate places. [2025-03-09 06:33:41,918 INFO L471 AbstractCegarLoop]: Abstraction has has 16 places, 14 transitions, 48 flow [2025-03-09 06:33:41,918 INFO L472 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-03-09 06:33:41,918 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:33:41,918 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-09 06:33:41,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 06:33:41,918 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2025-03-09 06:33:41,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:33:41,919 INFO L85 PathProgramCache]: Analyzing trace with hash 670829072, now seen corresponding path program 1 times [2025-03-09 06:33:41,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:33:41,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484447121] [2025-03-09 06:33:41,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:33:41,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:33:41,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:33:41,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:33:41,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:33:41,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:33:42,039 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:33:42,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:33:42,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484447121] [2025-03-09 06:33:42,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484447121] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:33:42,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582720847] [2025-03-09 06:33:42,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:33:42,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:33:42,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:33:42,042 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:33:42,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 06:33:42,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:33:42,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:33:42,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:33:42,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:33:42,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 06:33:42,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:33:42,190 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:33:42,191 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:33:42,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582720847] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:33:42,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:33:42,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-09 06:33:42,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112759619] [2025-03-09 06:33:42,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:33:42,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 06:33:42,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:33:42,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 06:33:42,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 06:33:42,204 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 25 [2025-03-09 06:33:42,205 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-03-09 06:33:42,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:33:42,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 25 [2025-03-09 06:33:42,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:33:42,314 INFO L124 PetriNetUnfolderBase]: 2/14 cut-off events. [2025-03-09 06:33:42,314 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-09 06:33:42,314 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 10 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-03-09 06:33:42,314 INFO L140 encePairwiseOnDemand]: 20/25 looper letters, 3 selfloop transitions, 6 changer transitions 0/13 dead transitions. [2025-03-09 06:33:42,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 13 transitions, 62 flow [2025-03-09 06:33:42,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 06:33:42,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 06:33:42,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2025-03-09 06:33:42,316 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.26666666666666666 [2025-03-09 06:33:42,316 INFO L175 Difference]: Start difference. First operand has 16 places, 14 transitions, 48 flow. Second operand 6 states and 40 transitions. [2025-03-09 06:33:42,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 13 transitions, 62 flow [2025-03-09 06:33:42,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 13 transitions, 60 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:33:42,317 INFO L231 Difference]: Finished difference. Result has 19 places, 13 transitions, 54 flow [2025-03-09 06:33:42,317 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-03-09 06:33:42,317 INFO L279 CegarLoopForPetriNet]: 11 programPoint places, 8 predicate places. [2025-03-09 06:33:42,317 INFO L471 AbstractCegarLoop]: Abstraction has has 19 places, 13 transitions, 54 flow [2025-03-09 06:33:42,318 INFO L472 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-03-09 06:33:42,318 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:33:42,318 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-03-09 06:33:42,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 06:33:42,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:33:42,518 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2025-03-09 06:33:42,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:33:42,519 INFO L85 PathProgramCache]: Analyzing trace with hash -679134838, now seen corresponding path program 1 times [2025-03-09 06:33:42,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:33:42,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637749227] [2025-03-09 06:33:42,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:33:42,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:33:42,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:33:42,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:33:42,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:33:42,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:33:42,567 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 06:33:42,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:33:42,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637749227] [2025-03-09 06:33:42,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637749227] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:33:42,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:33:42,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:33:42,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428674509] [2025-03-09 06:33:42,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:33:42,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:33:42,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:33:42,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:33:42,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:33:42,572 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 25 [2025-03-09 06:33:42,572 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-03-09 06:33:42,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:33:42,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 25 [2025-03-09 06:33:42,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:33:42,646 INFO L124 PetriNetUnfolderBase]: 2/13 cut-off events. [2025-03-09 06:33:42,646 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-09 06:33:42,647 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 7 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-03-09 06:33:42,647 INFO L140 encePairwiseOnDemand]: 22/25 looper letters, 4 selfloop transitions, 4 changer transitions 0/12 dead transitions. [2025-03-09 06:33:42,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 12 transitions, 66 flow [2025-03-09 06:33:42,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:33:42,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:33:42,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2025-03-09 06:33:42,649 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.29333333333333333 [2025-03-09 06:33:42,649 INFO L175 Difference]: Start difference. First operand has 19 places, 13 transitions, 54 flow. Second operand 3 states and 22 transitions. [2025-03-09 06:33:42,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 12 transitions, 66 flow [2025-03-09 06:33:42,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 14 places, 12 transitions, 44 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-03-09 06:33:42,650 INFO L231 Difference]: Finished difference. Result has 14 places, 12 transitions, 36 flow [2025-03-09 06:33:42,651 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-03-09 06:33:42,651 INFO L279 CegarLoopForPetriNet]: 11 programPoint places, 3 predicate places. [2025-03-09 06:33:42,652 INFO L471 AbstractCegarLoop]: Abstraction has has 14 places, 12 transitions, 36 flow [2025-03-09 06:33:42,652 INFO L472 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-03-09 06:33:42,652 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:33:42,652 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:33:42,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 06:33:42,652 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2025-03-09 06:33:42,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:33:42,653 INFO L85 PathProgramCache]: Analyzing trace with hash -679133750, now seen corresponding path program 1 times [2025-03-09 06:33:42,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:33:42,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80335875] [2025-03-09 06:33:42,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:33:42,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:33:42,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:33:42,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:33:42,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:33:42,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:33:42,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:33:42,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:33:42,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80335875] [2025-03-09 06:33:42,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80335875] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:33:42,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202939979] [2025-03-09 06:33:42,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:33:42,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:33:42,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:33:42,768 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:33:42,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 06:33:42,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:33:42,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:33:42,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:33:42,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:33:42,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 06:33:42,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:33:42,906 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:33:42,907 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:33:42,932 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:33:42,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [202939979] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:33:42,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:33:42,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-09 06:33:42,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563420115] [2025-03-09 06:33:42,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:33:42,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 06:33:42,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:33:42,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 06:33:42,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-09 06:33:42,947 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 25 [2025-03-09 06:33:42,947 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-03-09 06:33:42,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:33:42,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 25 [2025-03-09 06:33:42,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:33:43,062 INFO L124 PetriNetUnfolderBase]: 2/17 cut-off events. [2025-03-09 06:33:43,062 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-03-09 06:33:43,062 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 4 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-03-09 06:33:43,062 INFO L140 encePairwiseOnDemand]: 21/25 looper letters, 4 selfloop transitions, 7 changer transitions 0/15 dead transitions. [2025-03-09 06:33:43,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 15 transitions, 73 flow [2025-03-09 06:33:43,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 06:33:43,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 06:33:43,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 48 transitions. [2025-03-09 06:33:43,065 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2742857142857143 [2025-03-09 06:33:43,065 INFO L175 Difference]: Start difference. First operand has 14 places, 12 transitions, 36 flow. Second operand 7 states and 48 transitions. [2025-03-09 06:33:43,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 15 transitions, 73 flow [2025-03-09 06:33:43,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 18 places, 15 transitions, 59 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:33:43,066 INFO L231 Difference]: Finished difference. Result has 20 places, 15 transitions, 62 flow [2025-03-09 06:33:43,066 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-03-09 06:33:43,066 INFO L279 CegarLoopForPetriNet]: 11 programPoint places, 9 predicate places. [2025-03-09 06:33:43,067 INFO L471 AbstractCegarLoop]: Abstraction has has 20 places, 15 transitions, 62 flow [2025-03-09 06:33:43,067 INFO L472 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-03-09 06:33:43,067 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:33:43,067 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1] [2025-03-09 06:33:43,075 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 06:33:43,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-09 06:33:43,267 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2025-03-09 06:33:43,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:33:43,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1521591690, now seen corresponding path program 2 times [2025-03-09 06:33:43,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:33:43,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396222910] [2025-03-09 06:33:43,268 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:33:43,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:33:43,285 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-09 06:33:43,290 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 13 statements. [2025-03-09 06:33:43,290 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:33:43,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:33:43,388 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 06:33:43,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:33:43,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396222910] [2025-03-09 06:33:43,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396222910] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:33:43,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:33:43,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:33:43,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986818926] [2025-03-09 06:33:43,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:33:43,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:33:43,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:33:43,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:33:43,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:33:43,396 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 25 [2025-03-09 06:33:43,396 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-03-09 06:33:43,396 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:33:43,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 25 [2025-03-09 06:33:43,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:33:43,465 INFO L124 PetriNetUnfolderBase]: 2/20 cut-off events. [2025-03-09 06:33:43,465 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-03-09 06:33:43,465 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-03-09 06:33:43,465 INFO L140 encePairwiseOnDemand]: 20/25 looper letters, 12 selfloop transitions, 3 changer transitions 0/17 dead transitions. [2025-03-09 06:33:43,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 17 transitions, 96 flow [2025-03-09 06:33:43,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:33:43,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:33:43,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2025-03-09 06:33:43,468 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32 [2025-03-09 06:33:43,468 INFO L175 Difference]: Start difference. First operand has 20 places, 15 transitions, 62 flow. Second operand 4 states and 32 transitions. [2025-03-09 06:33:43,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 17 transitions, 96 flow [2025-03-09 06:33:43,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 17 transitions, 92 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:33:43,469 INFO L231 Difference]: Finished difference. Result has 23 places, 17 transitions, 80 flow [2025-03-09 06:33:43,469 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-03-09 06:33:43,469 INFO L279 CegarLoopForPetriNet]: 11 programPoint places, 12 predicate places. [2025-03-09 06:33:43,469 INFO L471 AbstractCegarLoop]: Abstraction has has 23 places, 17 transitions, 80 flow [2025-03-09 06:33:43,469 INFO L472 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-03-09 06:33:43,469 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:33:43,469 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1] [2025-03-09 06:33:43,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 06:33:43,469 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2025-03-09 06:33:43,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:33:43,470 INFO L85 PathProgramCache]: Analyzing trace with hash 653610371, now seen corresponding path program 1 times [2025-03-09 06:33:43,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:33:43,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035463259] [2025-03-09 06:33:43,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:33:43,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:33:43,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 06:33:43,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 06:33:43,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:33:43,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:33:43,691 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 06:33:43,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:33:43,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035463259] [2025-03-09 06:33:43,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035463259] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:33:43,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575194187] [2025-03-09 06:33:43,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:33:43,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:33:43,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:33:43,693 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:33:43,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 06:33:43,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 06:33:43,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 06:33:43,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:33:43,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:33:43,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 06:33:43,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:33:43,879 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 06:33:43,879 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:33:43,945 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 06:33:43,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1575194187] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:33:43,945 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:33:43,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-03-09 06:33:43,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020033640] [2025-03-09 06:33:43,945 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:33:43,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-09 06:33:43,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:33:43,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-09 06:33:43,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-09 06:33:43,965 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 25 [2025-03-09 06:33:43,966 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-03-09 06:33:43,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:33:43,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 25 [2025-03-09 06:33:43,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:33:44,200 INFO L124 PetriNetUnfolderBase]: 2/32 cut-off events. [2025-03-09 06:33:44,200 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2025-03-09 06:33:44,201 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-03-09 06:33:44,201 INFO L140 encePairwiseOnDemand]: 21/25 looper letters, 6 selfloop transitions, 15 changer transitions 0/25 dead transitions. [2025-03-09 06:33:44,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 25 transitions, 170 flow [2025-03-09 06:33:44,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-09 06:33:44,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-09 06:33:44,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 98 transitions. [2025-03-09 06:33:44,202 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2613333333333333 [2025-03-09 06:33:44,202 INFO L175 Difference]: Start difference. First operand has 23 places, 17 transitions, 80 flow. Second operand 15 states and 98 transitions. [2025-03-09 06:33:44,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 25 transitions, 170 flow [2025-03-09 06:33:44,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 25 transitions, 168 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:33:44,204 INFO L231 Difference]: Finished difference. Result has 40 places, 25 transitions, 175 flow [2025-03-09 06:33:44,204 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-03-09 06:33:44,205 INFO L279 CegarLoopForPetriNet]: 11 programPoint places, 29 predicate places. [2025-03-09 06:33:44,205 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 25 transitions, 175 flow [2025-03-09 06:33:44,205 INFO L472 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-03-09 06:33:44,205 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:33:44,205 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 2, 1, 1, 1, 1, 1] [2025-03-09 06:33:44,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-09 06:33:44,405 WARN L453 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-03-09 06:33:44,406 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2025-03-09 06:33:44,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:33:44,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1440792067, now seen corresponding path program 2 times [2025-03-09 06:33:44,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:33:44,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169786583] [2025-03-09 06:33:44,406 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:33:44,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:33:44,439 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-09 06:33:44,457 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 06:33:44,458 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:33:44,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:33:44,578 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-09 06:33:44,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:33:44,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169786583] [2025-03-09 06:33:44,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169786583] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:33:44,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109093390] [2025-03-09 06:33:44,581 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:33:44,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:33:44,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:33:44,584 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:33:44,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 06:33:44,698 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-09 06:33:44,765 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 06:33:44,765 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:33:44,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:33:44,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 06:33:44,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:33:44,935 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 06:33:44,935 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:33:45,150 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 06:33:45,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [109093390] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:33:45,151 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:33:45,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 16, 16] total 25 [2025-03-09 06:33:45,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350403228] [2025-03-09 06:33:45,151 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:33:45,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-09 06:33:45,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:33:45,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-09 06:33:45,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=472, Unknown=0, NotChecked=0, Total=600 [2025-03-09 06:33:45,207 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 25 [2025-03-09 06:33:45,208 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-03-09 06:33:45,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:33:45,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 25 [2025-03-09 06:33:45,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:33:45,591 INFO L124 PetriNetUnfolderBase]: 2/40 cut-off events. [2025-03-09 06:33:45,591 INFO L125 PetriNetUnfolderBase]: For 122/122 co-relation queries the response was YES. [2025-03-09 06:33:45,592 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-03-09 06:33:45,592 INFO L140 encePairwiseOnDemand]: 18/25 looper letters, 2 selfloop transitions, 26 changer transitions 0/30 dead transitions. [2025-03-09 06:33:45,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 30 transitions, 281 flow [2025-03-09 06:33:45,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-09 06:33:45,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-03-09 06:33:45,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 107 transitions. [2025-03-09 06:33:45,594 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.1712 [2025-03-09 06:33:45,594 INFO L175 Difference]: Start difference. First operand has 40 places, 25 transitions, 175 flow. Second operand 25 states and 107 transitions. [2025-03-09 06:33:45,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 30 transitions, 281 flow [2025-03-09 06:33:45,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 30 transitions, 271 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-03-09 06:33:45,596 INFO L231 Difference]: Finished difference. Result has 59 places, 30 transitions, 269 flow [2025-03-09 06:33:45,596 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-03-09 06:33:45,597 INFO L279 CegarLoopForPetriNet]: 11 programPoint places, 48 predicate places. [2025-03-09 06:33:45,597 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 30 transitions, 269 flow [2025-03-09 06:33:45,597 INFO L472 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-03-09 06:33:45,597 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:33:45,597 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1] [2025-03-09 06:33:45,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-09 06:33:45,801 WARN L453 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-03-09 06:33:45,801 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2025-03-09 06:33:45,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:33:45,802 INFO L85 PathProgramCache]: Analyzing trace with hash 2031553640, now seen corresponding path program 1 times [2025-03-09 06:33:45,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:33:45,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850238541] [2025-03-09 06:33:45,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:33:45,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:33:45,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-09 06:33:45,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-09 06:33:45,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:33:45,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:33:45,929 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-03-09 06:33:45,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:33:45,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850238541] [2025-03-09 06:33:45,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850238541] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:33:45,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:33:45,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:33:45,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150439257] [2025-03-09 06:33:45,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:33:45,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:33:45,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:33:45,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:33:45,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:33:45,932 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 25 [2025-03-09 06:33:45,932 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-03-09 06:33:45,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:33:45,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 25 [2025-03-09 06:33:45,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:33:45,961 INFO L124 PetriNetUnfolderBase]: 2/39 cut-off events. [2025-03-09 06:33:45,961 INFO L125 PetriNetUnfolderBase]: For 133/133 co-relation queries the response was YES. [2025-03-09 06:33:45,962 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-03-09 06:33:45,962 INFO L140 encePairwiseOnDemand]: 22/25 looper letters, 0 selfloop transitions, 0 changer transitions 29/29 dead transitions. [2025-03-09 06:33:45,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 29 transitions, 319 flow [2025-03-09 06:33:45,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:33:45,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:33:45,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2025-03-09 06:33:45,962 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.29333333333333333 [2025-03-09 06:33:45,962 INFO L175 Difference]: Start difference. First operand has 59 places, 30 transitions, 269 flow. Second operand 3 states and 22 transitions. [2025-03-09 06:33:45,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 29 transitions, 319 flow [2025-03-09 06:33:45,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 29 transitions, 239 flow, removed 9 selfloop flow, removed 22 redundant places. [2025-03-09 06:33:45,964 INFO L231 Difference]: Finished difference. Result has 38 places, 0 transitions, 0 flow [2025-03-09 06:33:45,964 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-03-09 06:33:45,964 INFO L279 CegarLoopForPetriNet]: 11 programPoint places, 27 predicate places. [2025-03-09 06:33:45,965 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 0 transitions, 0 flow [2025-03-09 06:33:45,965 INFO L472 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-03-09 06:33:45,966 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 5 remaining) [2025-03-09 06:33:45,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 5 remaining) [2025-03-09 06:33:45,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 5 remaining) [2025-03-09 06:33:45,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 5 remaining) [2025-03-09 06:33:45,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2025-03-09 06:33:45,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 06:33:45,967 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1] [2025-03-09 06:33:45,969 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-09 06:33:45,969 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 06:33:45,972 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 06:33:45 BasicIcfg [2025-03-09 06:33:45,972 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 06:33:45,972 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 06:33:45,972 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 06:33:45,973 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 06:33:45,974 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:33:41" (3/4) ... [2025-03-09 06:33:45,975 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-09 06:33:45,977 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t_fun [2025-03-09 06:33:45,981 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 84 nodes and edges [2025-03-09 06:33:45,981 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 39 nodes and edges [2025-03-09 06:33:45,981 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2025-03-09 06:33:45,981 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-09 06:33:45,982 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-09 06:33:45,982 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-09 06:33:46,039 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 06:33:46,040 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 06:33:46,040 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 06:33:46,041 INFO L158 Benchmark]: Toolchain (without parser) took 6061.74ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 121.0MB in the beginning and 262.7MB in the end (delta: -141.7MB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. [2025-03-09 06:33:46,041 INFO L158 Benchmark]: CDTParser took 0.94ms. Allocated memory is still 201.3MB. Free memory is still 116.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:33:46,041 INFO L158 Benchmark]: CACSL2BoogieTranslator took 524.76ms. Allocated memory is still 167.8MB. Free memory was 121.0MB in the beginning and 81.1MB in the end (delta: 39.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-09 06:33:46,042 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.14ms. Allocated memory is still 167.8MB. Free memory was 81.1MB in the beginning and 78.0MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:33:46,044 INFO L158 Benchmark]: Boogie Preprocessor took 40.36ms. Allocated memory is still 167.8MB. Free memory was 78.0MB in the beginning and 75.0MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 06:33:46,044 INFO L158 Benchmark]: IcfgBuilder took 757.45ms. Allocated memory is still 167.8MB. Free memory was 75.0MB in the beginning and 43.7MB in the end (delta: 31.3MB). Peak memory consumption was 49.6MB. Max. memory is 16.1GB. [2025-03-09 06:33:46,045 INFO L158 Benchmark]: TraceAbstraction took 4612.42ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 127.8MB in the beginning and 267.6MB in the end (delta: -139.9MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. [2025-03-09 06:33:46,045 INFO L158 Benchmark]: Witness Printer took 67.69ms. Allocated memory is still 335.5MB. Free memory was 267.6MB in the beginning and 262.7MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 06:33:46,046 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.94ms. Allocated memory is still 201.3MB. Free memory is still 116.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 524.76ms. Allocated memory is still 167.8MB. Free memory was 121.0MB in the beginning and 81.1MB in the end (delta: 39.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.14ms. Allocated memory is still 167.8MB. Free memory was 81.1MB in the beginning and 78.0MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 40.36ms. Allocated memory is still 167.8MB. Free memory was 78.0MB in the beginning and 75.0MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 757.45ms. Allocated memory is still 167.8MB. Free memory was 75.0MB in the beginning and 43.7MB in the end (delta: 31.3MB). Peak memory consumption was 49.6MB. Max. memory is 16.1GB. * TraceAbstraction took 4612.42ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 127.8MB in the beginning and 267.6MB in the end (delta: -139.9MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. * Witness Printer took 67.69ms. Allocated memory is still 335.5MB. Free memory was 267.6MB in the beginning and 262.7MB in the end (delta: 5.0MB). 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.5s, OverallIterations: 8, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, 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.7s 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-03-09 06:33:46,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE