./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test7-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test7-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 9e43379b3f2624d77eec1084820c7c07499f5ec4432514ab066d4f5cf96eeebc --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 13:51:05,082 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 13:51:05,137 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-08 13:51:05,142 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 13:51:05,142 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 13:51:05,160 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 13:51:05,160 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 13:51:05,160 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 13:51:05,161 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 13:51:05,161 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 13:51:05,161 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 13:51:05,161 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 13:51:05,161 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 13:51:05,161 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 13:51:05,161 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 13:51:05,161 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 13:51:05,161 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 13:51:05,162 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 13:51:05,162 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 13:51:05,162 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 13:51:05,162 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 13:51:05,162 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 13:51:05,162 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 13:51:05,162 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 13:51:05,162 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 13:51:05,162 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 13:51:05,163 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 13:51:05,163 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 13:51:05,163 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 13:51:05,163 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 13:51:05,163 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 13:51:05,163 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 13:51:05,163 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 13:51:05,163 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 13:51:05,163 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:51:05,164 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 13:51:05,164 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 13:51:05,164 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 13:51:05,164 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 13:51:05,164 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 13:51:05,164 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 13:51:05,164 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 13:51:05,164 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 13:51:05,164 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 13:51:05,164 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 13:51:05,164 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-jdk21/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 -> 9e43379b3f2624d77eec1084820c7c07499f5ec4432514ab066d4f5cf96eeebc [2025-02-08 13:51:05,401 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 13:51:05,408 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 13:51:05,410 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 13:51:05,411 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 13:51:05,411 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 13:51:05,412 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test7-2.i [2025-02-08 13:51:06,698 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0d81ad1b2/0da053b499d549448325a6e119930040/FLAGdeadf1be3 [2025-02-08 13:51:07,044 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 13:51:07,044 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test7-2.i [2025-02-08 13:51:07,061 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0d81ad1b2/0da053b499d549448325a6e119930040/FLAGdeadf1be3 [2025-02-08 13:51:07,076 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0d81ad1b2/0da053b499d549448325a6e119930040 [2025-02-08 13:51:07,078 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 13:51:07,079 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 13:51:07,080 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 13:51:07,080 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 13:51:07,086 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 13:51:07,086 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:51:07" (1/1) ... [2025-02-08 13:51:07,087 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@769e5e04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:51:07, skipping insertion in model container [2025-02-08 13:51:07,087 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:51:07" (1/1) ... [2025-02-08 13:51:07,116 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 13:51:07,488 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:51:07,495 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 13:51:07,577 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:51:07,612 INFO L204 MainTranslator]: Completed translation [2025-02-08 13:51:07,613 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:51:07 WrapperNode [2025-02-08 13:51:07,613 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 13:51:07,614 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 13:51:07,614 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 13:51:07,614 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 13:51:07,620 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:51:07" (1/1) ... [2025-02-08 13:51:07,643 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:51:07" (1/1) ... [2025-02-08 13:51:07,688 INFO L138 Inliner]: procedures = 176, calls = 323, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1543 [2025-02-08 13:51:07,688 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 13:51:07,688 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 13:51:07,688 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 13:51:07,688 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 13:51:07,700 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:51:07" (1/1) ... [2025-02-08 13:51:07,700 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:51:07" (1/1) ... [2025-02-08 13:51:07,717 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:51:07" (1/1) ... [2025-02-08 13:51:07,806 INFO L175 MemorySlicer]: Split 301 memory accesses to 3 slices as follows [2, 34, 265]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 62 writes are split as follows [0, 4, 58]. [2025-02-08 13:51:07,806 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:51:07" (1/1) ... [2025-02-08 13:51:07,806 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:51:07" (1/1) ... [2025-02-08 13:51:07,841 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:51:07" (1/1) ... [2025-02-08 13:51:07,844 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:51:07" (1/1) ... [2025-02-08 13:51:07,852 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:51:07" (1/1) ... [2025-02-08 13:51:07,859 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:51:07" (1/1) ... [2025-02-08 13:51:07,868 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 13:51:07,869 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 13:51:07,869 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 13:51:07,869 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 13:51:07,870 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:51:07" (1/1) ... [2025-02-08 13:51:07,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:51:07,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:51:07,897 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 13:51:07,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 13:51:07,918 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-02-08 13:51:07,918 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-02-08 13:51:07,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 13:51:07,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 13:51:07,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 13:51:07,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 13:51:07,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 13:51:07,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 13:51:07,918 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-08 13:51:07,918 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-08 13:51:07,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-08 13:51:07,919 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-08 13:51:07,919 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-08 13:51:07,919 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-08 13:51:07,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 13:51:07,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 13:51:07,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 13:51:07,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 13:51:07,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 13:51:07,920 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 13:51:07,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 13:51:07,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 13:51:07,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 13:51:07,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 13:51:07,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 13:51:07,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 13:51:07,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 13:51:07,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 13:51:07,922 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 13:51:08,105 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 13:51:08,107 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 13:51:09,224 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L713: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-02-08 13:51:09,295 INFO L? ?]: Removed 341 outVars from TransFormulas that were not future-live. [2025-02-08 13:51:09,295 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 13:51:09,346 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 13:51:09,347 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-08 13:51:09,347 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:51:09 BoogieIcfgContainer [2025-02-08 13:51:09,347 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 13:51:09,349 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 13:51:09,349 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 13:51:09,353 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 13:51:09,353 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:51:07" (1/3) ... [2025-02-08 13:51:09,353 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49c12c84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:51:09, skipping insertion in model container [2025-02-08 13:51:09,353 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:51:07" (2/3) ... [2025-02-08 13:51:09,354 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49c12c84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:51:09, skipping insertion in model container [2025-02-08 13:51:09,354 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:51:09" (3/3) ... [2025-02-08 13:51:09,355 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test7-2.i [2025-02-08 13:51:09,366 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 13:51:09,367 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SFH_test7-2.i that has 5 procedures, 445 locations, 1 initial locations, 43 loop locations, and 6 error locations. [2025-02-08 13:51:09,413 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 13:51:09,420 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@ee9af7d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 13:51:09,420 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-08 13:51:09,423 INFO L276 IsEmpty]: Start isEmpty. Operand has 437 states, 423 states have (on average 1.624113475177305) internal successors, (687), 430 states have internal predecessors, (687), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-08 13:51:09,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 13:51:09,426 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:51:09,426 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 13:51:09,427 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:51:09,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:51:09,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1509564441, now seen corresponding path program 1 times [2025-02-08 13:51:09,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:51:09,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050043324] [2025-02-08 13:51:09,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:51:09,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:51:09,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:51:09,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:51:09,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:51:09,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:51:09,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:51:09,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:51:09,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050043324] [2025-02-08 13:51:09,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050043324] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:51:09,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:51:09,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:51:09,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934921488] [2025-02-08 13:51:09,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:51:09,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 13:51:09,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:51:09,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 13:51:09,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 13:51:09,619 INFO L87 Difference]: Start difference. First operand has 437 states, 423 states have (on average 1.624113475177305) internal successors, (687), 430 states have internal predecessors, (687), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-02-08 13:51:09,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:51:09,778 INFO L93 Difference]: Finished difference Result 870 states and 1391 transitions. [2025-02-08 13:51:09,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 13:51:09,781 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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) Word has length 6 [2025-02-08 13:51:09,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:51:09,791 INFO L225 Difference]: With dead ends: 870 [2025-02-08 13:51:09,792 INFO L226 Difference]: Without dead ends: 393 [2025-02-08 13:51:09,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 13:51:09,800 INFO L435 NwaCegarLoop]: 578 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:51:09,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 578 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:51:09,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2025-02-08 13:51:09,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2025-02-08 13:51:09,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 383 states have (on average 1.4621409921671018) internal successors, (560), 388 states have internal predecessors, (560), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 13:51:09,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 566 transitions. [2025-02-08 13:51:09,852 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 566 transitions. Word has length 6 [2025-02-08 13:51:09,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:51:09,853 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 566 transitions. [2025-02-08 13:51:09,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-02-08 13:51:09,853 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 566 transitions. [2025-02-08 13:51:09,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 13:51:09,855 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:51:09,855 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 13:51:09,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 13:51:09,856 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:51:09,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:51:09,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1509565402, now seen corresponding path program 1 times [2025-02-08 13:51:09,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:51:09,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620459650] [2025-02-08 13:51:09,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:51:09,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:51:09,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:51:09,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:51:09,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:51:09,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 13:51:09,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1072627388] [2025-02-08 13:51:09,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:51:09,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:51:09,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:51:09,899 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:51:09,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 13:51:10,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:51:10,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:51:10,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:51:10,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:51:10,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 13:51:10,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:51:10,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 13:51:10,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:51:10,105 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:51:10,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:51:10,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620459650] [2025-02-08 13:51:10,107 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 13:51:10,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1072627388] [2025-02-08 13:51:10,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1072627388] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:51:10,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:51:10,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:51:10,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117387815] [2025-02-08 13:51:10,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:51:10,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:51:10,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:51:10,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:51:10,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:51:10,109 INFO L87 Difference]: Start difference. First operand 393 states and 566 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-02-08 13:51:10,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:51:10,360 INFO L93 Difference]: Finished difference Result 781 states and 1127 transitions. [2025-02-08 13:51:10,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:51:10,361 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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) Word has length 6 [2025-02-08 13:51:10,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:51:10,364 INFO L225 Difference]: With dead ends: 781 [2025-02-08 13:51:10,364 INFO L226 Difference]: Without dead ends: 779 [2025-02-08 13:51:10,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:51:10,368 INFO L435 NwaCegarLoop]: 540 mSDtfsCounter, 548 mSDsluCounter, 1036 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 1576 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 13:51:10,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 1576 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 13:51:10,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2025-02-08 13:51:10,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 399. [2025-02-08 13:51:10,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 389 states have (on average 1.4575835475578407) internal successors, (567), 394 states have internal predecessors, (567), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 13:51:10,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 573 transitions. [2025-02-08 13:51:10,390 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 573 transitions. Word has length 6 [2025-02-08 13:51:10,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:51:10,390 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 573 transitions. [2025-02-08 13:51:10,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-02-08 13:51:10,391 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 573 transitions. [2025-02-08 13:51:10,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-08 13:51:10,394 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:51:10,394 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:51:10,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 13:51:10,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:51:10,595 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:51:10,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:51:10,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1797526322, now seen corresponding path program 1 times [2025-02-08 13:51:10,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:51:10,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173580761] [2025-02-08 13:51:10,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:51:10,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:51:10,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-08 13:51:10,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-08 13:51:10,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:51:10,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:51:10,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:51:10,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:51:10,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173580761] [2025-02-08 13:51:10,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173580761] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:51:10,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:51:10,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:51:10,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070721429] [2025-02-08 13:51:10,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:51:10,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:51:10,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:51:10,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:51:10,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:51:10,990 INFO L87 Difference]: Start difference. First operand 399 states and 573 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 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-02-08 13:51:11,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:51:11,203 INFO L93 Difference]: Finished difference Result 965 states and 1396 transitions. [2025-02-08 13:51:11,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:51:11,205 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 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) Word has length 69 [2025-02-08 13:51:11,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:51:11,208 INFO L225 Difference]: With dead ends: 965 [2025-02-08 13:51:11,208 INFO L226 Difference]: Without dead ends: 778 [2025-02-08 13:51:11,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:51:11,209 INFO L435 NwaCegarLoop]: 542 mSDtfsCounter, 549 mSDsluCounter, 1039 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 552 SdHoareTripleChecker+Valid, 1581 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 13:51:11,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [552 Valid, 1581 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 13:51:11,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2025-02-08 13:51:11,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 399. [2025-02-08 13:51:11,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 389 states have (on average 1.455012853470437) internal successors, (566), 394 states have internal predecessors, (566), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 13:51:11,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 572 transitions. [2025-02-08 13:51:11,222 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 572 transitions. Word has length 69 [2025-02-08 13:51:11,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:51:11,222 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 572 transitions. [2025-02-08 13:51:11,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 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-02-08 13:51:11,222 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 572 transitions. [2025-02-08 13:51:11,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-08 13:51:11,229 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:51:11,229 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:51:11,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 13:51:11,229 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:51:11,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:51:11,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1608127254, now seen corresponding path program 1 times [2025-02-08 13:51:11,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:51:11,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43771461] [2025-02-08 13:51:11,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:51:11,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:51:11,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-08 13:51:11,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-08 13:51:11,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:51:11,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:51:11,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:51:11,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:51:11,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43771461] [2025-02-08 13:51:11,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43771461] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:51:11,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:51:11,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 13:51:11,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27520109] [2025-02-08 13:51:11,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:51:11,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:51:11,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:51:11,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:51:11,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:51:11,454 INFO L87 Difference]: Start difference. First operand 399 states and 572 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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-02-08 13:51:11,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:51:11,589 INFO L93 Difference]: Finished difference Result 794 states and 1140 transitions. [2025-02-08 13:51:11,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:51:11,589 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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) Word has length 79 [2025-02-08 13:51:11,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:51:11,591 INFO L225 Difference]: With dead ends: 794 [2025-02-08 13:51:11,591 INFO L226 Difference]: Without dead ends: 402 [2025-02-08 13:51:11,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:51:11,592 INFO L435 NwaCegarLoop]: 497 mSDtfsCounter, 105 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1407 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:51:11,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1407 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:51:11,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2025-02-08 13:51:11,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 399. [2025-02-08 13:51:11,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 389 states have (on average 1.437017994858612) internal successors, (559), 394 states have internal predecessors, (559), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 13:51:11,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 565 transitions. [2025-02-08 13:51:11,609 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 565 transitions. Word has length 79 [2025-02-08 13:51:11,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:51:11,609 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 565 transitions. [2025-02-08 13:51:11,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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-02-08 13:51:11,609 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 565 transitions. [2025-02-08 13:51:11,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-08 13:51:11,613 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:51:11,613 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:51:11,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 13:51:11,613 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:51:11,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:51:11,614 INFO L85 PathProgramCache]: Analyzing trace with hash -2142164656, now seen corresponding path program 1 times [2025-02-08 13:51:11,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:51:11,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672702930] [2025-02-08 13:51:11,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:51:11,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:51:11,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-08 13:51:11,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-08 13:51:11,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:51:11,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:51:11,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:51:11,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:51:11,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672702930] [2025-02-08 13:51:11,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672702930] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:51:11,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:51:11,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:51:11,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874343080] [2025-02-08 13:51:11,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:51:11,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:51:11,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:51:11,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:51:11,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:51:11,794 INFO L87 Difference]: Start difference. First operand 399 states and 565 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 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-02-08 13:51:11,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:51:11,949 INFO L93 Difference]: Finished difference Result 1081 states and 1550 transitions. [2025-02-08 13:51:11,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:51:11,949 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 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) Word has length 79 [2025-02-08 13:51:11,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:51:11,952 INFO L225 Difference]: With dead ends: 1081 [2025-02-08 13:51:11,952 INFO L226 Difference]: Without dead ends: 689 [2025-02-08 13:51:11,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:51:11,954 INFO L435 NwaCegarLoop]: 683 mSDtfsCounter, 371 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 1177 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:51:11,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 1177 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:51:11,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2025-02-08 13:51:11,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 686. [2025-02-08 13:51:11,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 676 states have (on average 1.4541420118343196) internal successors, (983), 681 states have internal predecessors, (983), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 13:51:11,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 989 transitions. [2025-02-08 13:51:11,970 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 989 transitions. Word has length 79 [2025-02-08 13:51:11,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:51:11,971 INFO L471 AbstractCegarLoop]: Abstraction has 686 states and 989 transitions. [2025-02-08 13:51:11,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 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-02-08 13:51:11,971 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 989 transitions. [2025-02-08 13:51:11,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-08 13:51:11,972 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:51:11,973 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:51:11,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 13:51:11,973 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:51:11,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:51:11,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1182598273, now seen corresponding path program 1 times [2025-02-08 13:51:11,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:51:11,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311795622] [2025-02-08 13:51:11,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:51:11,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:51:12,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-08 13:51:12,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-08 13:51:12,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:51:12,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:51:12,322 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 13:51:12,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:51:12,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311795622] [2025-02-08 13:51:12,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311795622] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:51:12,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:51:12,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:51:12,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337351175] [2025-02-08 13:51:12,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:51:12,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:51:12,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:51:12,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:51:12,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:51:12,324 INFO L87 Difference]: Start difference. First operand 686 states and 989 transitions. Second operand has 4 states, 3 states have (on average 29.0) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:51:12,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:51:12,520 INFO L93 Difference]: Finished difference Result 970 states and 1390 transitions. [2025-02-08 13:51:12,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:51:12,520 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 29.0) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 94 [2025-02-08 13:51:12,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:51:12,524 INFO L225 Difference]: With dead ends: 970 [2025-02-08 13:51:12,524 INFO L226 Difference]: Without dead ends: 968 [2025-02-08 13:51:12,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:51:12,526 INFO L435 NwaCegarLoop]: 496 mSDtfsCounter, 457 mSDsluCounter, 985 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 1481 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 13:51:12,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 1481 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 13:51:12,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2025-02-08 13:51:12,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 749. [2025-02-08 13:51:12,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 749 states, 736 states have (on average 1.440217391304348) internal successors, (1060), 741 states have internal predecessors, (1060), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:51:12,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 1072 transitions. [2025-02-08 13:51:12,546 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 1072 transitions. Word has length 94 [2025-02-08 13:51:12,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:51:12,546 INFO L471 AbstractCegarLoop]: Abstraction has 749 states and 1072 transitions. [2025-02-08 13:51:12,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 29.0) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:51:12,546 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 1072 transitions. [2025-02-08 13:51:12,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-08 13:51:12,547 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:51:12,548 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:51:12,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 13:51:12,548 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:51:12,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:51:12,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1350780945, now seen corresponding path program 1 times [2025-02-08 13:51:12,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:51:12,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534960214] [2025-02-08 13:51:12,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:51:12,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:51:12,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-08 13:51:12,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-08 13:51:12,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:51:12,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:51:12,881 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 13:51:12,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:51:12,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534960214] [2025-02-08 13:51:12,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534960214] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:51:12,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804154971] [2025-02-08 13:51:12,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:51:12,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:51:12,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:51:12,885 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:51:12,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 13:51:13,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-08 13:51:13,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-08 13:51:13,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:51:13,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:51:13,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-08 13:51:13,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:51:13,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 13:51:13,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 13:51:13,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-02-08 13:51:13,872 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 13:51:13,873 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:51:13,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804154971] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:51:13,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:51:13,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [4] total 13 [2025-02-08 13:51:13,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413109007] [2025-02-08 13:51:13,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:51:13,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 13:51:13,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:51:13,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 13:51:13,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-02-08 13:51:13,875 INFO L87 Difference]: Start difference. First operand 749 states and 1072 transitions. Second operand has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 10 states have internal predecessors, (93), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:51:16,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:51:16,094 INFO L93 Difference]: Finished difference Result 1679 states and 2401 transitions. [2025-02-08 13:51:16,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 13:51:16,095 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 10 states have internal predecessors, (93), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 100 [2025-02-08 13:51:16,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:51:16,099 INFO L225 Difference]: With dead ends: 1679 [2025-02-08 13:51:16,100 INFO L226 Difference]: Without dead ends: 1016 [2025-02-08 13:51:16,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2025-02-08 13:51:16,103 INFO L435 NwaCegarLoop]: 535 mSDtfsCounter, 812 mSDsluCounter, 2819 mSDsCounter, 0 mSdLazyCounter, 1520 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 814 SdHoareTripleChecker+Valid, 3354 SdHoareTripleChecker+Invalid, 1525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-08 13:51:16,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [814 Valid, 3354 Invalid, 1525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1520 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-08 13:51:16,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2025-02-08 13:51:16,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 774. [2025-02-08 13:51:16,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 774 states, 761 states have (on average 1.4323258869908015) internal successors, (1090), 766 states have internal predecessors, (1090), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:51:16,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 1102 transitions. [2025-02-08 13:51:16,122 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 1102 transitions. Word has length 100 [2025-02-08 13:51:16,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:51:16,123 INFO L471 AbstractCegarLoop]: Abstraction has 774 states and 1102 transitions. [2025-02-08 13:51:16,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 10 states have internal predecessors, (93), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:51:16,123 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1102 transitions. [2025-02-08 13:51:16,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-08 13:51:16,124 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:51:16,124 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:51:16,142 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 13:51:16,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:51:16,342 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:51:16,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:51:16,343 INFO L85 PathProgramCache]: Analyzing trace with hash 402926050, now seen corresponding path program 1 times [2025-02-08 13:51:16,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:51:16,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975960424] [2025-02-08 13:51:16,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:51:16,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:51:16,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-08 13:51:16,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-08 13:51:16,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:51:16,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:51:16,628 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 13:51:16,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:51:16,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975960424] [2025-02-08 13:51:16,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975960424] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:51:16,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304875813] [2025-02-08 13:51:16,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:51:16,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:51:16,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:51:16,631 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:51:16,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 13:51:16,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-08 13:51:16,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-08 13:51:16,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:51:16,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:51:16,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 602 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-02-08 13:51:17,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:52:10,913 WARN L286 SmtUtils]: Spent 6.45s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-08 13:52:35,874 WARN L286 SmtUtils]: Spent 5.47s on a formula simplification. DAG size of input: 30 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)