./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-overflow.prp --file ../../../trunk/examples/svcomp/goblint-regression/09-regions_11-arraylist_nr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/goblint-regression/09-regions_11-arraylist_nr.c -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 d1ab298b15ff3e93e3a25e88a66e704a5aedd8d8523826dd902097f6af136d70 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:01:02,279 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:01:02,342 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-04-29 11:01:02,348 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:01:02,349 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:01:02,371 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:01:02,372 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:01:02,372 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:01:02,372 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 11:01:02,373 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 11:01:02,373 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:01:02,373 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:01:02,374 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:01:02,374 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:01:02,374 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:01:02,374 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:01:02,374 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 11:01:02,374 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:01:02,374 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:01:02,375 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:01:02,375 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:01:02,375 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 11:01:02,375 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:01:02,375 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 11:01:02,375 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-04-29 11:01:02,375 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:01:02,375 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:01:02,375 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 11:01:02,375 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:01:02,375 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:01:02,375 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:01:02,375 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:01:02,375 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:01:02,375 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:01:02,375 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:01:02,376 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:01:02,376 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:01:02,376 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:01:02,376 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:01:02,376 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:01:02,377 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:01:02,377 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:01:02,377 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 11:01:02,377 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 11:01:02,377 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:01:02,377 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:01:02,377 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:01:02,377 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:01:02,377 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:01:02,377 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 -> d1ab298b15ff3e93e3a25e88a66e704a5aedd8d8523826dd902097f6af136d70 [2025-04-29 11:01:02,597 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:01:02,606 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:01:02,608 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:01:02,610 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:01:02,610 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:01:02,611 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/09-regions_11-arraylist_nr.c [2025-04-29 11:01:03,920 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68c6581b7/a7f5a819193140a084d0e459f1b9f6ce/FLAG9a52f1eb5 [2025-04-29 11:01:04,165 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:01:04,166 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/09-regions_11-arraylist_nr.c [2025-04-29 11:01:04,167 WARN L117 ultiparseSymbolTable]: System include pthread.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:01:04,168 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:01:04,168 WARN L117 ultiparseSymbolTable]: System include stdio.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:01:04,174 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68c6581b7/a7f5a819193140a084d0e459f1b9f6ce/FLAG9a52f1eb5 [2025-04-29 11:01:04,970 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68c6581b7/a7f5a819193140a084d0e459f1b9f6ce [2025-04-29 11:01:04,972 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:01:04,973 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:01:04,978 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:01:04,978 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:01:04,982 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:01:04,986 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:01:04" (1/1) ... [2025-04-29 11:01:04,987 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@297d2ac5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:01:04, skipping insertion in model container [2025-04-29 11:01:04,987 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:01:04" (1/1) ... [2025-04-29 11:01:05,001 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:01:05,150 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:01:05,159 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:01:05,179 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:01:05,192 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:01:05,192 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:01:05 WrapperNode [2025-04-29 11:01:05,192 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:01:05,193 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:01:05,193 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:01:05,193 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:01:05,199 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:01:05" (1/1) ... [2025-04-29 11:01:05,209 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:01:05" (1/1) ... [2025-04-29 11:01:05,232 INFO L138 Inliner]: procedures = 20, calls = 48, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 146 [2025-04-29 11:01:05,233 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:01:05,234 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:01:05,234 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:01:05,234 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:01:05,241 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:01:05" (1/1) ... [2025-04-29 11:01:05,241 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:01:05" (1/1) ... [2025-04-29 11:01:05,244 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:01:05" (1/1) ... [2025-04-29 11:01:05,264 INFO L175 MemorySlicer]: Split 38 memory accesses to 3 slices as follows [10, 14, 14]. 37 percent of accesses are in the largest equivalence class. The 20 initializations are split as follows [10, 10, 0]. The 11 writes are split as follows [0, 1, 10]. [2025-04-29 11:01:05,264 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:01:05" (1/1) ... [2025-04-29 11:01:05,264 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:01:05" (1/1) ... [2025-04-29 11:01:05,270 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:01:05" (1/1) ... [2025-04-29 11:01:05,271 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:01:05" (1/1) ... [2025-04-29 11:01:05,276 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:01:05" (1/1) ... [2025-04-29 11:01:05,277 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:01:05" (1/1) ... [2025-04-29 11:01:05,277 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:01:05" (1/1) ... [2025-04-29 11:01:05,281 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:01:05,282 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:01:05,282 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:01:05,282 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:01:05,283 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:01:05" (1/1) ... [2025-04-29 11:01:05,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:01:05,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:01:05,306 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-29 11:01:05,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-29 11:01:05,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-29 11:01:05,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-29 11:01:05,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-04-29 11:01:05,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-29 11:01:05,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-29 11:01:05,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-04-29 11:01:05,324 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-29 11:01:05,324 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-29 11:01:05,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-29 11:01:05,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-29 11:01:05,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-29 11:01:05,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-29 11:01:05,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-29 11:01:05,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-04-29 11:01:05,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-29 11:01:05,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-29 11:01:05,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-29 11:01:05,324 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:01:05,324 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-29 11:01:05,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:01:05,325 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:01:05,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-29 11:01:05,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-29 11:01:05,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-29 11:01:05,325 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-29 11:01:05,325 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-29 11:01:05,326 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-29 11:01:05,433 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:01:05,434 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:01:05,658 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-29 11:01:05,658 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:01:05,908 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:01:05,908 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:01:05,908 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:01:05 BoogieIcfgContainer [2025-04-29 11:01:05,909 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:01:05,911 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:01:05,911 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:01:05,914 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:01:05,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:01:04" (1/3) ... [2025-04-29 11:01:05,915 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@506c9a5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:01:05, skipping insertion in model container [2025-04-29 11:01:05,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:01:05" (2/3) ... [2025-04-29 11:01:05,916 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@506c9a5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:01:05, skipping insertion in model container [2025-04-29 11:01:05,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:01:05" (3/3) ... [2025-04-29 11:01:05,917 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_11-arraylist_nr.c [2025-04-29 11:01:05,927 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:01:05,929 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_11-arraylist_nr.c that has 2 procedures, 24 locations, 24 edges, 1 initial locations, 2 loop locations, and 4 error locations. [2025-04-29 11:01:05,929 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-29 11:01:05,967 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-29 11:01:05,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 25 transitions, 54 flow [2025-04-29 11:01:06,016 INFO L116 PetriNetUnfolderBase]: 2/24 cut-off events. [2025-04-29 11:01:06,019 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:01:06,023 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 37 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 13. Up to 2 conditions per place. [2025-04-29 11:01:06,023 INFO L82 GeneralOperation]: Start removeDead. Operand has 27 places, 25 transitions, 54 flow [2025-04-29 11:01:06,025 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 11 places, 12 transitions, 24 flow [2025-04-29 11:01:06,033 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:01:06,044 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@38ac8082, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:01:06,046 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-29 11:01:06,050 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:01:06,051 INFO L116 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-04-29 11:01:06,051 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:01:06,051 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:01:06,052 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-04-29 11:01:06,052 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2025-04-29 11:01:06,055 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:01:06,056 INFO L85 PathProgramCache]: Analyzing trace with hash 411037, now seen corresponding path program 1 times [2025-04-29 11:01:06,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:01:06,062 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441034634] [2025-04-29 11:01:06,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:01:06,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:01:06,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-29 11:01:06,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-29 11:01:06,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:01:06,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:06,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:01:06,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:01:06,273 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441034634] [2025-04-29 11:01:06,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441034634] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:01:06,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:01:06,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:01:06,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831629282] [2025-04-29 11:01:06,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:01:06,281 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:01:06,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:01:06,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:01:06,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:01:06,316 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 25 [2025-04-29 11:01:06,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 11 places, 12 transitions, 24 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:01:06,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:01:06,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 25 [2025-04-29 11:01:06,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:01:06,411 INFO L116 PetriNetUnfolderBase]: 2/15 cut-off events. [2025-04-29 11:01:06,411 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:01:06,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 15 events. 2/15 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 13 event pairs, 0 based on Foata normal form. 1/13 useless extension candidates. Maximal degree in co-relation 0. Up to 9 conditions per place. [2025-04-29 11:01:06,412 INFO L140 encePairwiseOnDemand]: 19/25 looper letters, 7 selfloop transitions, 3 changer transitions 0/14 dead transitions. [2025-04-29 11:01:06,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 14 places, 14 transitions, 48 flow [2025-04-29 11:01:06,413 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:01:06,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-29 11:01:06,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2025-04-29 11:01:06,421 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.33 [2025-04-29 11:01:06,422 INFO L175 Difference]: Start difference. First operand has 11 places, 12 transitions, 24 flow. Second operand 4 states and 33 transitions. [2025-04-29 11:01:06,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 14 places, 14 transitions, 48 flow [2025-04-29 11:01:06,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 14 places, 14 transitions, 48 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:01:06,426 INFO L231 Difference]: Finished difference. Result has 16 places, 14 transitions, 48 flow [2025-04-29 11:01:06,428 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=24, PETRI_DIFFERENCE_MINUEND_PLACES=11, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=12, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=48, PETRI_PLACES=16, PETRI_TRANSITIONS=14} [2025-04-29 11:01:06,430 INFO L279 CegarLoopForPetriNet]: 11 programPoint places, 5 predicate places. [2025-04-29 11:01:06,430 INFO L485 AbstractCegarLoop]: Abstraction has has 16 places, 14 transitions, 48 flow [2025-04-29 11:01:06,430 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:01:06,430 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:01:06,430 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-04-29 11:01:06,431 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:01:06,431 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2025-04-29 11:01:06,431 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:01:06,431 INFO L85 PathProgramCache]: Analyzing trace with hash -639299116, now seen corresponding path program 1 times [2025-04-29 11:01:06,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:01:06,431 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621629905] [2025-04-29 11:01:06,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:01:06,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:01:06,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-29 11:01:06,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-29 11:01:06,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:01:06,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:06,521 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:01:06,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:01:06,522 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621629905] [2025-04-29 11:01:06,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621629905] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:01:06,522 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2024586038] [2025-04-29 11:01:06,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:01:06,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:01:06,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:01:06,524 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:01:06,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-29 11:01:06,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-29 11:01:06,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-29 11:01:06,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:01:06,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:06,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-29 11:01:06,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:01:06,636 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:01:06,636 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:01:06,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2024586038] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:01:06,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:01:06,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-04-29 11:01:06,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222572417] [2025-04-29 11:01:06,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:01:06,638 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:01:06,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:01:06,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:01:06,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:01:06,646 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 25 [2025-04-29 11:01:06,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 16 places, 14 transitions, 48 flow. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:01:06,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:01:06,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 25 [2025-04-29 11:01:06,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:01:06,763 INFO L116 PetriNetUnfolderBase]: 2/14 cut-off events. [2025-04-29 11:01:06,763 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-29 11:01:06,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 14 events. 2/14 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 9 event pairs, 0 based on Foata normal form. 1/12 useless extension candidates. Maximal degree in co-relation 20. Up to 4 conditions per place. [2025-04-29 11:01:06,764 INFO L140 encePairwiseOnDemand]: 20/25 looper letters, 3 selfloop transitions, 6 changer transitions 0/13 dead transitions. [2025-04-29 11:01:06,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 13 transitions, 62 flow [2025-04-29 11:01:06,764 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:01:06,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:01:06,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2025-04-29 11:01:06,766 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.26666666666666666 [2025-04-29 11:01:06,766 INFO L175 Difference]: Start difference. First operand has 16 places, 14 transitions, 48 flow. Second operand 6 states and 40 transitions. [2025-04-29 11:01:06,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 13 transitions, 62 flow [2025-04-29 11:01:06,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 13 transitions, 60 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:01:06,768 INFO L231 Difference]: Finished difference. Result has 19 places, 13 transitions, 54 flow [2025-04-29 11:01:06,768 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=14, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=13, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=7, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=54, PETRI_PLACES=19, PETRI_TRANSITIONS=13} [2025-04-29 11:01:06,769 INFO L279 CegarLoopForPetriNet]: 11 programPoint places, 8 predicate places. [2025-04-29 11:01:06,770 INFO L485 AbstractCegarLoop]: Abstraction has has 19 places, 13 transitions, 54 flow [2025-04-29 11:01:06,770 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:01:06,770 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:01:06,771 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-04-29 11:01:06,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-29 11:01:06,975 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:01:06,975 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2025-04-29 11:01:06,976 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:01:06,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1656564286, now seen corresponding path program 1 times [2025-04-29 11:01:06,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:01:06,976 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245559223] [2025-04-29 11:01:06,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:01:06,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:01:06,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-29 11:01:06,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-29 11:01:06,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:01:06,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:07,022 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:01:07,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:01:07,022 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245559223] [2025-04-29 11:01:07,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245559223] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:01:07,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:01:07,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:01:07,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250420636] [2025-04-29 11:01:07,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:01:07,023 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:01:07,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:01:07,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:01:07,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:01:07,029 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 25 [2025-04-29 11:01:07,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 13 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:01:07,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:01:07,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 25 [2025-04-29 11:01:07,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:01:07,071 INFO L116 PetriNetUnfolderBase]: 2/13 cut-off events. [2025-04-29 11:01:07,071 INFO L117 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-04-29 11:01:07,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 13 events. 2/13 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 6 event pairs, 0 based on Foata normal form. 1/12 useless extension candidates. Maximal degree in co-relation 16. Up to 7 conditions per place. [2025-04-29 11:01:07,071 INFO L140 encePairwiseOnDemand]: 22/25 looper letters, 4 selfloop transitions, 4 changer transitions 0/12 dead transitions. [2025-04-29 11:01:07,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 12 transitions, 66 flow [2025-04-29 11:01:07,072 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:01:07,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:01:07,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2025-04-29 11:01:07,072 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.29333333333333333 [2025-04-29 11:01:07,072 INFO L175 Difference]: Start difference. First operand has 19 places, 13 transitions, 54 flow. Second operand 3 states and 22 transitions. [2025-04-29 11:01:07,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 12 transitions, 66 flow [2025-04-29 11:01:07,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 14 places, 12 transitions, 44 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-04-29 11:01:07,074 INFO L231 Difference]: Finished difference. Result has 14 places, 12 transitions, 36 flow [2025-04-29 11:01:07,074 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=28, PETRI_DIFFERENCE_MINUEND_PLACES=12, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=12, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=36, PETRI_PLACES=14, PETRI_TRANSITIONS=12} [2025-04-29 11:01:07,074 INFO L279 CegarLoopForPetriNet]: 11 programPoint places, 3 predicate places. [2025-04-29 11:01:07,074 INFO L485 AbstractCegarLoop]: Abstraction has has 14 places, 12 transitions, 36 flow [2025-04-29 11:01:07,074 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:01:07,074 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:01:07,074 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:01:07,074 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:01:07,075 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2025-04-29 11:01:07,075 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:01:07,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1656565468, now seen corresponding path program 1 times [2025-04-29 11:01:07,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:01:07,075 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787288185] [2025-04-29 11:01:07,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:01:07,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:01:07,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-29 11:01:07,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-29 11:01:07,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:01:07,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:07,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:01:07,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:01:07,201 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787288185] [2025-04-29 11:01:07,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787288185] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:01:07,201 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1966227517] [2025-04-29 11:01:07,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:01:07,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:01:07,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:01:07,203 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:01:07,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-29 11:01:07,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-29 11:01:07,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-29 11:01:07,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:01:07,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:07,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-29 11:01:07,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:01:07,323 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:01:07,324 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:01:07,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:01:07,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1966227517] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:01:07,349 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:01:07,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-04-29 11:01:07,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94042348] [2025-04-29 11:01:07,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:01:07,350 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:01:07,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:01:07,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:01:07,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:01:07,362 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 25 [2025-04-29 11:01:07,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 14 places, 12 transitions, 36 flow. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:01:07,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:01:07,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 25 [2025-04-29 11:01:07,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:01:07,462 INFO L116 PetriNetUnfolderBase]: 2/17 cut-off events. [2025-04-29 11:01:07,462 INFO L117 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-04-29 11:01:07,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 17 events. 2/17 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 3 event pairs, 0 based on Foata normal form. 2/18 useless extension candidates. Maximal degree in co-relation 9. Up to 5 conditions per place. [2025-04-29 11:01:07,463 INFO L140 encePairwiseOnDemand]: 21/25 looper letters, 4 selfloop transitions, 7 changer transitions 0/15 dead transitions. [2025-04-29 11:01:07,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 15 transitions, 73 flow [2025-04-29 11:01:07,463 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:01:07,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-29 11:01:07,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 48 transitions. [2025-04-29 11:01:07,464 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2742857142857143 [2025-04-29 11:01:07,464 INFO L175 Difference]: Start difference. First operand has 14 places, 12 transitions, 36 flow. Second operand 7 states and 48 transitions. [2025-04-29 11:01:07,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 15 transitions, 73 flow [2025-04-29 11:01:07,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 18 places, 15 transitions, 59 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:01:07,465 INFO L231 Difference]: Finished difference. Result has 20 places, 15 transitions, 62 flow [2025-04-29 11:01:07,465 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=28, PETRI_DIFFERENCE_MINUEND_PLACES=12, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=12, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=7, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=62, PETRI_PLACES=20, PETRI_TRANSITIONS=15} [2025-04-29 11:01:07,465 INFO L279 CegarLoopForPetriNet]: 11 programPoint places, 9 predicate places. [2025-04-29 11:01:07,465 INFO L485 AbstractCegarLoop]: Abstraction has has 20 places, 15 transitions, 62 flow [2025-04-29 11:01:07,465 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:01:07,466 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:01:07,466 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1] [2025-04-29 11:01:07,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-29 11:01:07,670 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-04-29 11:01:07,670 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2025-04-29 11:01:07,670 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:01:07,670 INFO L85 PathProgramCache]: Analyzing trace with hash 216096636, now seen corresponding path program 2 times [2025-04-29 11:01:07,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:01:07,671 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015489935] [2025-04-29 11:01:07,671 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:01:07,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:01:07,700 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-04-29 11:01:07,708 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 13 statements. [2025-04-29 11:01:07,711 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:01:07,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:07,787 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-29 11:01:07,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:01:07,788 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015489935] [2025-04-29 11:01:07,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015489935] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:01:07,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:01:07,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:01:07,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222271267] [2025-04-29 11:01:07,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:01:07,789 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:01:07,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:01:07,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:01:07,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:01:07,796 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 25 [2025-04-29 11:01:07,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 15 transitions, 62 flow. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:01:07,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:01:07,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 25 [2025-04-29 11:01:07,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:01:07,865 INFO L116 PetriNetUnfolderBase]: 2/20 cut-off events. [2025-04-29 11:01:07,865 INFO L117 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-04-29 11:01:07,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 20 events. 2/20 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 4 event pairs, 0 based on Foata normal form. 1/20 useless extension candidates. Maximal degree in co-relation 18. Up to 14 conditions per place. [2025-04-29 11:01:07,866 INFO L140 encePairwiseOnDemand]: 20/25 looper letters, 12 selfloop transitions, 3 changer transitions 0/17 dead transitions. [2025-04-29 11:01:07,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 17 transitions, 96 flow [2025-04-29 11:01:07,868 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:01:07,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-29 11:01:07,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2025-04-29 11:01:07,869 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.32 [2025-04-29 11:01:07,870 INFO L175 Difference]: Start difference. First operand has 20 places, 15 transitions, 62 flow. Second operand 4 states and 32 transitions. [2025-04-29 11:01:07,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 17 transitions, 96 flow [2025-04-29 11:01:07,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 17 transitions, 92 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:01:07,871 INFO L231 Difference]: Finished difference. Result has 23 places, 17 transitions, 80 flow [2025-04-29 11:01:07,872 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=80, PETRI_PLACES=23, PETRI_TRANSITIONS=17} [2025-04-29 11:01:07,872 INFO L279 CegarLoopForPetriNet]: 11 programPoint places, 12 predicate places. [2025-04-29 11:01:07,873 INFO L485 AbstractCegarLoop]: Abstraction has has 23 places, 17 transitions, 80 flow [2025-04-29 11:01:07,873 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:01:07,873 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:01:07,873 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1] [2025-04-29 11:01:07,873 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:01:07,873 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2025-04-29 11:01:07,873 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:01:07,874 INFO L85 PathProgramCache]: Analyzing trace with hash -420695864, now seen corresponding path program 1 times [2025-04-29 11:01:07,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:01:07,874 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816666013] [2025-04-29 11:01:07,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:01:07,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:01:07,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-29 11:01:07,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-29 11:01:07,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:01:07,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:08,122 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:01:08,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:01:08,122 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816666013] [2025-04-29 11:01:08,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816666013] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:01:08,122 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436371483] [2025-04-29 11:01:08,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:01:08,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:01:08,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:01:08,125 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:01:08,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-29 11:01:08,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-29 11:01:08,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-29 11:01:08,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:01:08,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:08,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-29 11:01:08,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:01:08,296 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:01:08,297 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:01:08,381 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:01:08,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [436371483] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:01:08,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:01:08,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-04-29 11:01:08,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751181056] [2025-04-29 11:01:08,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:01:08,382 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-29 11:01:08,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:01:08,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-29 11:01:08,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-04-29 11:01:08,403 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 25 [2025-04-29 11:01:08,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 17 transitions, 80 flow. Second operand has 18 states, 18 states have (on average 6.166666666666667) internal successors, (111), 18 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:01:08,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:01:08,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 25 [2025-04-29 11:01:08,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:01:08,657 INFO L116 PetriNetUnfolderBase]: 2/32 cut-off events. [2025-04-29 11:01:08,658 INFO L117 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2025-04-29 11:01:08,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 32 events. 2/32 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 4 event pairs, 0 based on Foata normal form. 4/36 useless extension candidates. Maximal degree in co-relation 72. Up to 8 conditions per place. [2025-04-29 11:01:08,658 INFO L140 encePairwiseOnDemand]: 21/25 looper letters, 6 selfloop transitions, 15 changer transitions 0/25 dead transitions. [2025-04-29 11:01:08,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 25 transitions, 170 flow [2025-04-29 11:01:08,658 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-29 11:01:08,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-29 11:01:08,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 98 transitions. [2025-04-29 11:01:08,659 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2613333333333333 [2025-04-29 11:01:08,659 INFO L175 Difference]: Start difference. First operand has 23 places, 17 transitions, 80 flow. Second operand 15 states and 98 transitions. [2025-04-29 11:01:08,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 25 transitions, 170 flow [2025-04-29 11:01:08,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 25 transitions, 168 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:01:08,661 INFO L231 Difference]: Finished difference. Result has 40 places, 25 transitions, 175 flow [2025-04-29 11:01:08,661 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=175, PETRI_PLACES=40, PETRI_TRANSITIONS=25} [2025-04-29 11:01:08,662 INFO L279 CegarLoopForPetriNet]: 11 programPoint places, 29 predicate places. [2025-04-29 11:01:08,662 INFO L485 AbstractCegarLoop]: Abstraction has has 40 places, 25 transitions, 175 flow [2025-04-29 11:01:08,662 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.166666666666667) internal successors, (111), 18 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:01:08,662 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:01:08,662 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 2, 1, 1, 1, 1, 1] [2025-04-29 11:01:08,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-29 11:01:08,865 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:01:08,865 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2025-04-29 11:01:08,866 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:01:08,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1988472712, now seen corresponding path program 2 times [2025-04-29 11:01:08,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:01:08,866 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315668373] [2025-04-29 11:01:08,866 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:01:08,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:01:08,898 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-29 11:01:08,921 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-29 11:01:08,923 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:01:08,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:09,056 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-04-29 11:01:09,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:01:09,056 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315668373] [2025-04-29 11:01:09,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315668373] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:01:09,056 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092667373] [2025-04-29 11:01:09,057 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:01:09,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:01:09,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:01:09,059 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:01:09,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-29 11:01:09,158 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-29 11:01:09,248 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-29 11:01:09,249 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:01:09,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:09,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-29 11:01:09,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:01:09,460 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:01:09,460 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:01:09,664 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:01:09,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092667373] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:01:09,665 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:01:09,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 16, 16] total 25 [2025-04-29 11:01:09,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629995845] [2025-04-29 11:01:09,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:01:09,666 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-29 11:01:09,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:01:09,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-29 11:01:09,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=472, Unknown=0, NotChecked=0, Total=600 [2025-04-29 11:01:09,711 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 25 [2025-04-29 11:01:09,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 25 transitions, 175 flow. Second operand has 25 states, 25 states have (on average 4.32) internal successors, (108), 25 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:01:09,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:01:09,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 25 [2025-04-29 11:01:09,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:01:10,075 INFO L116 PetriNetUnfolderBase]: 2/40 cut-off events. [2025-04-29 11:01:10,075 INFO L117 PetriNetUnfolderBase]: For 122/122 co-relation queries the response was YES. [2025-04-29 11:01:10,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162 conditions, 40 events. 2/40 cut-off events. For 122/122 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 2 event pairs, 0 based on Foata normal form. 4/43 useless extension candidates. Maximal degree in co-relation 132. Up to 11 conditions per place. [2025-04-29 11:01:10,080 INFO L140 encePairwiseOnDemand]: 18/25 looper letters, 2 selfloop transitions, 26 changer transitions 0/30 dead transitions. [2025-04-29 11:01:10,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 30 transitions, 281 flow [2025-04-29 11:01:10,081 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-29 11:01:10,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-04-29 11:01:10,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 107 transitions. [2025-04-29 11:01:10,082 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.1712 [2025-04-29 11:01:10,082 INFO L175 Difference]: Start difference. First operand has 40 places, 25 transitions, 175 flow. Second operand 25 states and 107 transitions. [2025-04-29 11:01:10,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 30 transitions, 281 flow [2025-04-29 11:01:10,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 30 transitions, 271 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-04-29 11:01:10,084 INFO L231 Difference]: Finished difference. Result has 59 places, 30 transitions, 269 flow [2025-04-29 11:01:10,084 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=269, PETRI_PLACES=59, PETRI_TRANSITIONS=30} [2025-04-29 11:01:10,085 INFO L279 CegarLoopForPetriNet]: 11 programPoint places, 48 predicate places. [2025-04-29 11:01:10,085 INFO L485 AbstractCegarLoop]: Abstraction has has 59 places, 30 transitions, 269 flow [2025-04-29 11:01:10,085 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 4.32) internal successors, (108), 25 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:01:10,085 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:01:10,085 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1] [2025-04-29 11:01:10,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-29 11:01:10,290 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:01:10,290 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2025-04-29 11:01:10,290 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:01:10,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1843893281, now seen corresponding path program 1 times [2025-04-29 11:01:10,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:01:10,291 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406525138] [2025-04-29 11:01:10,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:01:10,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:01:10,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-29 11:01:10,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-29 11:01:10,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:01:10,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:10,387 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-04-29 11:01:10,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:01:10,387 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406525138] [2025-04-29 11:01:10,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406525138] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:01:10,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:01:10,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:01:10,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864481172] [2025-04-29 11:01:10,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:01:10,388 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:01:10,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:01:10,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:01:10,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:01:10,392 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 25 [2025-04-29 11:01:10,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 30 transitions, 269 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:01:10,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:01:10,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 25 [2025-04-29 11:01:10,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:01:10,424 INFO L116 PetriNetUnfolderBase]: 2/39 cut-off events. [2025-04-29 11:01:10,424 INFO L117 PetriNetUnfolderBase]: For 133/133 co-relation queries the response was YES. [2025-04-29 11:01:10,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 182 conditions, 39 events. 2/39 cut-off events. For 133/133 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 2 event pairs, 0 based on Foata normal form. 1/40 useless extension candidates. Maximal degree in co-relation 150. Up to 26 conditions per place. [2025-04-29 11:01:10,425 INFO L140 encePairwiseOnDemand]: 22/25 looper letters, 0 selfloop transitions, 0 changer transitions 29/29 dead transitions. [2025-04-29 11:01:10,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 29 transitions, 319 flow [2025-04-29 11:01:10,426 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:01:10,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:01:10,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2025-04-29 11:01:10,427 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.29333333333333333 [2025-04-29 11:01:10,427 INFO L175 Difference]: Start difference. First operand has 59 places, 30 transitions, 269 flow. Second operand 3 states and 22 transitions. [2025-04-29 11:01:10,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 29 transitions, 319 flow [2025-04-29 11:01:10,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 29 transitions, 239 flow, removed 9 selfloop flow, removed 22 redundant places. [2025-04-29 11:01:10,429 INFO L231 Difference]: Finished difference. Result has 38 places, 0 transitions, 0 flow [2025-04-29 11:01:10,429 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=38, PETRI_TRANSITIONS=0} [2025-04-29 11:01:10,430 INFO L279 CegarLoopForPetriNet]: 11 programPoint places, 27 predicate places. [2025-04-29 11:01:10,430 INFO L485 AbstractCegarLoop]: Abstraction has has 38 places, 0 transitions, 0 flow [2025-04-29 11:01:10,430 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:01:10,434 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 5 remaining) [2025-04-29 11:01:10,434 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 5 remaining) [2025-04-29 11:01:10,434 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 5 remaining) [2025-04-29 11:01:10,434 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 5 remaining) [2025-04-29 11:01:10,434 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2025-04-29 11:01:10,435 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:01:10,435 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1] [2025-04-29 11:01:10,438 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-29 11:01:10,438 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-29 11:01:10,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 11:01:10 BasicIcfg [2025-04-29 11:01:10,443 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-29 11:01:10,443 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-29 11:01:10,444 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-29 11:01:10,445 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-29 11:01:10,446 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:01:05" (3/4) ... [2025-04-29 11:01:10,447 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-04-29 11:01:10,449 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure t_fun [2025-04-29 11:01:10,452 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 90 nodes and edges [2025-04-29 11:01:10,452 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-04-29 11:01:10,452 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-04-29 11:01:10,453 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-04-29 11:01:10,506 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-29 11:01:10,506 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-29 11:01:10,506 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-29 11:01:10,507 INFO L158 Benchmark]: Toolchain (without parser) took 5533.68ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 112.4MB in the beginning and 258.6MB in the end (delta: -146.3MB). Peak memory consumption was 93.3MB. Max. memory is 16.1GB. [2025-04-29 11:01:10,507 INFO L158 Benchmark]: CDTParser took 0.52ms. Allocated memory is still 201.3MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:01:10,507 INFO L158 Benchmark]: CACSL2BoogieTranslator took 214.63ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 97.7MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 11:01:10,507 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.23ms. Allocated memory is still 142.6MB. Free memory was 97.7MB in the beginning and 95.7MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:01:10,508 INFO L158 Benchmark]: Boogie Preprocessor took 47.33ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 92.7MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:01:10,508 INFO L158 Benchmark]: RCFGBuilder took 627.54ms. Allocated memory is still 142.6MB. Free memory was 92.7MB in the beginning and 92.9MB in the end (delta: -244.5kB). Peak memory consumption was 65.7MB. Max. memory is 16.1GB. [2025-04-29 11:01:10,508 INFO L158 Benchmark]: TraceAbstraction took 4532.17ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 92.2MB in the beginning and 267.0MB in the end (delta: -174.8MB). Peak memory consumption was 69.5MB. Max. memory is 16.1GB. [2025-04-29 11:01:10,508 INFO L158 Benchmark]: Witness Printer took 62.97ms. Allocated memory is still 385.9MB. Free memory was 267.0MB in the beginning and 258.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 11:01:10,509 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.52ms. Allocated memory is still 201.3MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 214.63ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 97.7MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.23ms. Allocated memory is still 142.6MB. Free memory was 97.7MB in the beginning and 95.7MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 47.33ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 92.7MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 627.54ms. Allocated memory is still 142.6MB. Free memory was 92.7MB in the beginning and 92.9MB in the end (delta: -244.5kB). Peak memory consumption was 65.7MB. Max. memory is 16.1GB. * TraceAbstraction took 4532.17ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 92.2MB in the beginning and 267.0MB in the end (delta: -174.8MB). Peak memory consumption was 69.5MB. Max. memory is 16.1GB. * Witness Printer took 62.97ms. Allocated memory is still 385.9MB. Free memory was 267.0MB in the beginning and 258.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 57]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 57]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 31 locations, 31 edges, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.4s, OverallIterations: 8, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 158 SdHoareTripleChecker+Valid, 0.8s 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, 996 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 15 InterpolantComputations, 5 PerfectInterpolantSequences, 245/428 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-29 11:01:10,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE