./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6698dfe763688c38a478c53cfe3bc6bac092e445bf13ef44be53eb6068218c93 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 06:03:04,205 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 06:03:04,255 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 06:03:04,260 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 06:03:04,261 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 06:03:04,280 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 06:03:04,280 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 06:03:04,281 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 06:03:04,281 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 06:03:04,281 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 06:03:04,281 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 06:03:04,281 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 06:03:04,281 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 06:03:04,282 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 06:03:04,282 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 06:03:04,282 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 06:03:04,282 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 06:03:04,282 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 06:03:04,282 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 06:03:04,282 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 06:03:04,282 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 06:03:04,282 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 06:03:04,282 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 06:03:04,283 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 06:03:04,283 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 06:03:04,283 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 06:03:04,283 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 06:03:04,283 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 06:03:04,283 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 06:03:04,283 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 06:03:04,283 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 06:03:04,283 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 06:03:04,283 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 06:03:04,284 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 06:03:04,284 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 06:03:04,284 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 06:03:04,284 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 06:03:04,284 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 06:03:04,284 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 06:03:04,284 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 06:03:04,284 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 06:03:04,284 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 06:03:04,284 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 06:03:04,284 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 06:03:04,285 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 06:03:04,285 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 -> 6698dfe763688c38a478c53cfe3bc6bac092e445bf13ef44be53eb6068218c93 [2025-03-09 06:03:04,544 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 06:03:04,552 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 06:03:04,554 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 06:03:04,556 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 06:03:04,556 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 06:03:04,558 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-1.i [2025-03-09 06:03:05,789 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee15ac5a7/8345acf39dcf4bdda5bb61e709fd7e21/FLAGb60451f6d [2025-03-09 06:03:06,190 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 06:03:06,192 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-1.i [2025-03-09 06:03:06,213 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee15ac5a7/8345acf39dcf4bdda5bb61e709fd7e21/FLAGb60451f6d [2025-03-09 06:03:06,229 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee15ac5a7/8345acf39dcf4bdda5bb61e709fd7e21 [2025-03-09 06:03:06,231 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 06:03:06,232 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 06:03:06,233 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 06:03:06,233 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 06:03:06,237 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 06:03:06,238 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:03:06" (1/1) ... [2025-03-09 06:03:06,239 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64bc7117 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:03:06, skipping insertion in model container [2025-03-09 06:03:06,239 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:03:06" (1/1) ... [2025-03-09 06:03:06,289 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 06:03:06,776 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:03:06,782 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 06:03:06,884 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:03:06,908 INFO L204 MainTranslator]: Completed translation [2025-03-09 06:03:06,908 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:03:06 WrapperNode [2025-03-09 06:03:06,908 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 06:03:06,910 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 06:03:06,910 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 06:03:06,910 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 06:03:06,916 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:03:06" (1/1) ... [2025-03-09 06:03:06,946 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:03:06" (1/1) ... [2025-03-09 06:03:07,053 INFO L138 Inliner]: procedures = 177, calls = 724, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3252 [2025-03-09 06:03:07,053 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 06:03:07,054 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 06:03:07,055 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 06:03:07,055 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 06:03:07,061 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:03:06" (1/1) ... [2025-03-09 06:03:07,062 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:03:06" (1/1) ... [2025-03-09 06:03:07,101 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:03:06" (1/1) ... [2025-03-09 06:03:07,156 INFO L175 MemorySlicer]: Split 208 memory accesses to 3 slices as follows [2, 172, 34]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 46 writes are split as follows [0, 42, 4]. [2025-03-09 06:03:07,159 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:03:06" (1/1) ... [2025-03-09 06:03:07,160 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:03:06" (1/1) ... [2025-03-09 06:03:07,202 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:03:06" (1/1) ... [2025-03-09 06:03:07,210 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:03:06" (1/1) ... [2025-03-09 06:03:07,218 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:03:06" (1/1) ... [2025-03-09 06:03:07,226 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:03:06" (1/1) ... [2025-03-09 06:03:07,241 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 06:03:07,243 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 06:03:07,243 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 06:03:07,243 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 06:03:07,244 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:03:06" (1/1) ... [2025-03-09 06:03:07,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 06:03:07,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:03:07,273 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 06:03:07,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 06:03:07,297 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-03-09 06:03:07,297 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-03-09 06:03:07,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 06:03:07,298 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 06:03:07,298 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 06:03:07,298 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-09 06:03:07,298 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-09 06:03:07,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 06:03:07,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 06:03:07,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 06:03:07,298 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-09 06:03:07,298 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-09 06:03:07,298 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-09 06:03:07,298 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-09 06:03:07,298 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-09 06:03:07,298 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-09 06:03:07,298 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 06:03:07,298 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 06:03:07,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-09 06:03:07,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-09 06:03:07,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-09 06:03:07,298 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 06:03:07,298 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-09 06:03:07,298 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-09 06:03:07,298 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-09 06:03:07,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 06:03:07,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 06:03:07,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 06:03:07,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 06:03:07,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 06:03:07,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 06:03:07,476 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 06:03:07,479 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 06:03:09,671 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2218: 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-03-09 06:03:09,886 INFO L? ?]: Removed 808 outVars from TransFormulas that were not future-live. [2025-03-09 06:03:09,887 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 06:03:09,967 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 06:03:09,968 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-09 06:03:09,968 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:03:09 BoogieIcfgContainer [2025-03-09 06:03:09,968 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 06:03:09,971 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 06:03:09,971 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 06:03:09,975 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 06:03:09,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 06:03:06" (1/3) ... [2025-03-09 06:03:09,976 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4df4f1ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:03:09, skipping insertion in model container [2025-03-09 06:03:09,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:03:06" (2/3) ... [2025-03-09 06:03:09,976 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4df4f1ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:03:09, skipping insertion in model container [2025-03-09 06:03:09,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:03:09" (3/3) ... [2025-03-09 06:03:09,977 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_BER_test9-1.i [2025-03-09 06:03:09,991 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 06:03:09,993 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_BER_test9-1.i that has 6 procedures, 1391 locations, 1 initial locations, 31 loop locations, and 8 error locations. [2025-03-09 06:03:10,111 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 06:03:10,121 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;@1ef130fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 06:03:10,122 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-09 06:03:10,130 INFO L276 IsEmpty]: Start isEmpty. Operand has 1383 states, 866 states have (on average 1.8394919168591224) internal successors, (1593), 1376 states have internal predecessors, (1593), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) [2025-03-09 06:03:10,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-09 06:03:10,134 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:03:10,135 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:03:10,135 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 06:03:10,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:03:10,140 INFO L85 PathProgramCache]: Analyzing trace with hash 2092253427, now seen corresponding path program 1 times [2025-03-09 06:03:10,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:03:10,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094736483] [2025-03-09 06:03:10,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:03:10,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:03:10,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:03:10,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:03:10,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:03:10,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:03:10,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:03:10,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:03:10,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094736483] [2025-03-09 06:03:10,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094736483] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:03:10,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:03:10,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:03:10,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794080649] [2025-03-09 06:03:10,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:03:10,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-09 06:03:10,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:03:10,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-09 06:03:10,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 06:03:10,290 INFO L87 Difference]: Start difference. First operand has 1383 states, 866 states have (on average 1.8394919168591224) internal successors, (1593), 1376 states have internal predecessors, (1593), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:03:10,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:03:10,495 INFO L93 Difference]: Finished difference Result 2762 states and 5703 transitions. [2025-03-09 06:03:10,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-09 06:03:10,498 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2025-03-09 06:03:10,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:03:10,526 INFO L225 Difference]: With dead ends: 2762 [2025-03-09 06:03:10,527 INFO L226 Difference]: Without dead ends: 1374 [2025-03-09 06:03:10,539 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-03-09 06:03:10,543 INFO L435 NwaCegarLoop]: 2503 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2503 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 06:03:10,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2503 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 06:03:10,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2025-03-09 06:03:10,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 1374. [2025-03-09 06:03:10,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1374 states, 861 states have (on average 1.7770034843205575) internal successors, (1530), 1368 states have internal predecessors, (1530), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-03-09 06:03:10,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 2536 transitions. [2025-03-09 06:03:10,871 INFO L78 Accepts]: Start accepts. Automaton has 1374 states and 2536 transitions. Word has length 7 [2025-03-09 06:03:10,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:03:10,871 INFO L471 AbstractCegarLoop]: Abstraction has 1374 states and 2536 transitions. [2025-03-09 06:03:10,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:03:10,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 2536 transitions. [2025-03-09 06:03:10,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-09 06:03:10,872 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:03:10,872 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:03:10,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 06:03:10,873 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 06:03:10,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:03:10,874 INFO L85 PathProgramCache]: Analyzing trace with hash 2092254388, now seen corresponding path program 1 times [2025-03-09 06:03:10,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:03:10,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113558861] [2025-03-09 06:03:10,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:03:10,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:03:10,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:03:10,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:03:10,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:03:10,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 06:03:10,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [714933418] [2025-03-09 06:03:10,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:03:10,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:03:10,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:03:10,917 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:03:10,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 06:03:11,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:03:11,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:03:11,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:03:11,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:03:11,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 06:03:11,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:03:11,043 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-03-09 06:03:11,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:03:11,069 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:03:11,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:03:11,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113558861] [2025-03-09 06:03:11,070 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 06:03:11,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714933418] [2025-03-09 06:03:11,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714933418] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:03:11,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:03:11,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:03:11,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039303085] [2025-03-09 06:03:11,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:03:11,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:03:11,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:03:11,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:03:11,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:03:11,073 INFO L87 Difference]: Start difference. First operand 1374 states and 2536 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:03:11,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:03:11,868 INFO L93 Difference]: Finished difference Result 2738 states and 5063 transitions. [2025-03-09 06:03:11,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:03:11,870 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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 7 [2025-03-09 06:03:11,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:03:11,896 INFO L225 Difference]: With dead ends: 2738 [2025-03-09 06:03:11,896 INFO L226 Difference]: Without dead ends: 2736 [2025-03-09 06:03:11,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-03-09 06:03:11,899 INFO L435 NwaCegarLoop]: 2754 mSDtfsCounter, 1514 mSDsluCounter, 4721 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2017 SdHoareTripleChecker+Valid, 7475 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-09 06:03:11,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2017 Valid, 7475 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-09 06:03:11,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2736 states. [2025-03-09 06:03:12,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2736 to 1380. [2025-03-09 06:03:12,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1380 states, 867 states have (on average 1.7727797001153403) internal successors, (1537), 1374 states have internal predecessors, (1537), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-03-09 06:03:12,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1380 states to 1380 states and 2543 transitions. [2025-03-09 06:03:12,173 INFO L78 Accepts]: Start accepts. Automaton has 1380 states and 2543 transitions. Word has length 7 [2025-03-09 06:03:12,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:03:12,174 INFO L471 AbstractCegarLoop]: Abstraction has 1380 states and 2543 transitions. [2025-03-09 06:03:12,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:03:12,174 INFO L276 IsEmpty]: Start isEmpty. Operand 1380 states and 2543 transitions. [2025-03-09 06:03:12,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-09 06:03:12,176 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:03:12,176 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] [2025-03-09 06:03:12,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 06:03:12,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:03:12,380 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 06:03:12,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:03:12,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1631136575, now seen corresponding path program 1 times [2025-03-09 06:03:12,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:03:12,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608305522] [2025-03-09 06:03:12,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:03:12,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:03:12,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-09 06:03:12,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-09 06:03:12,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:03:12,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:03:12,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:03:12,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:03:12,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608305522] [2025-03-09 06:03:12,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608305522] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:03:12,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:03:12,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 06:03:12,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469787943] [2025-03-09 06:03:12,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:03:12,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:03:12,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:03:12,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:03:12,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:03:12,741 INFO L87 Difference]: Start difference. First operand 1380 states and 2543 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:03:13,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:03:13,456 INFO L93 Difference]: Finished difference Result 3903 states and 7302 transitions. [2025-03-09 06:03:13,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:03:13,457 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-03-09 06:03:13,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:03:13,478 INFO L225 Difference]: With dead ends: 3903 [2025-03-09 06:03:13,478 INFO L226 Difference]: Without dead ends: 2735 [2025-03-09 06:03:13,484 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-03-09 06:03:13,485 INFO L435 NwaCegarLoop]: 2760 mSDtfsCounter, 1515 mSDsluCounter, 4728 mSDsCounter, 0 mSdLazyCounter, 696 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2018 SdHoareTripleChecker+Valid, 7488 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-09 06:03:13,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2018 Valid, 7488 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 696 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-09 06:03:13,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2735 states. [2025-03-09 06:03:13,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2735 to 1380. [2025-03-09 06:03:13,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1380 states, 867 states have (on average 1.7716262975778547) internal successors, (1536), 1374 states have internal predecessors, (1536), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-03-09 06:03:13,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1380 states to 1380 states and 2542 transitions. [2025-03-09 06:03:13,753 INFO L78 Accepts]: Start accepts. Automaton has 1380 states and 2542 transitions. Word has length 62 [2025-03-09 06:03:13,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:03:13,754 INFO L471 AbstractCegarLoop]: Abstraction has 1380 states and 2542 transitions. [2025-03-09 06:03:13,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:03:13,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1380 states and 2542 transitions. [2025-03-09 06:03:13,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-09 06:03:13,756 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:03:13,756 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-03-09 06:03:13,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 06:03:13,756 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 06:03:13,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:03:13,757 INFO L85 PathProgramCache]: Analyzing trace with hash 475308803, now seen corresponding path program 1 times [2025-03-09 06:03:13,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:03:13,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987846499] [2025-03-09 06:03:13,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:03:13,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:03:13,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-09 06:03:13,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-09 06:03:13,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:03:13,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:03:13,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:03:13,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:03:13,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987846499] [2025-03-09 06:03:13,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987846499] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:03:13,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:03:13,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 06:03:13,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310866648] [2025-03-09 06:03:13,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:03:13,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 06:03:13,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:03:13,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 06:03:13,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 06:03:13,985 INFO L87 Difference]: Start difference. First operand 1380 states and 2542 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 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-03-09 06:03:14,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:03:14,135 INFO L93 Difference]: Finished difference Result 2755 states and 5079 transitions. [2025-03-09 06:03:14,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:03:14,136 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 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-03-09 06:03:14,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:03:14,145 INFO L225 Difference]: With dead ends: 2755 [2025-03-09 06:03:14,145 INFO L226 Difference]: Without dead ends: 1383 [2025-03-09 06:03:14,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 06:03:14,149 INFO L435 NwaCegarLoop]: 2468 mSDtfsCounter, 108 mSDsluCounter, 4852 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 7320 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 06:03:14,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 7320 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 06:03:14,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2025-03-09 06:03:14,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1380. [2025-03-09 06:03:14,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1380 states, 867 states have (on average 1.7635524798154556) internal successors, (1529), 1374 states have internal predecessors, (1529), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-03-09 06:03:14,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1380 states to 1380 states and 2535 transitions. [2025-03-09 06:03:14,266 INFO L78 Accepts]: Start accepts. Automaton has 1380 states and 2535 transitions. Word has length 79 [2025-03-09 06:03:14,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:03:14,266 INFO L471 AbstractCegarLoop]: Abstraction has 1380 states and 2535 transitions. [2025-03-09 06:03:14,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 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-03-09 06:03:14,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1380 states and 2535 transitions. [2025-03-09 06:03:14,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-09 06:03:14,268 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:03:14,268 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-03-09 06:03:14,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 06:03:14,269 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 06:03:14,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:03:14,269 INFO L85 PathProgramCache]: Analyzing trace with hash 759878653, now seen corresponding path program 1 times [2025-03-09 06:03:14,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:03:14,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704778118] [2025-03-09 06:03:14,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:03:14,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:03:14,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-09 06:03:14,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-09 06:03:14,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:03:14,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:03:14,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:03:14,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:03:14,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704778118] [2025-03-09 06:03:14,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704778118] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:03:14,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:03:14,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:03:14,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196320481] [2025-03-09 06:03:14,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:03:14,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:03:14,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:03:14,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:03:14,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:03:14,413 INFO L87 Difference]: Start difference. First operand 1380 states and 2535 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 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-03-09 06:03:14,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:03:14,616 INFO L93 Difference]: Finished difference Result 4019 states and 7456 transitions. [2025-03-09 06:03:14,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:03:14,617 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 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-03-09 06:03:14,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:03:14,635 INFO L225 Difference]: With dead ends: 4019 [2025-03-09 06:03:14,635 INFO L226 Difference]: Without dead ends: 2647 [2025-03-09 06:03:14,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-03-09 06:03:14,642 INFO L435 NwaCegarLoop]: 2909 mSDtfsCounter, 1341 mSDsluCounter, 2474 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1841 SdHoareTripleChecker+Valid, 5383 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 06:03:14,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1841 Valid, 5383 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 06:03:14,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2647 states. [2025-03-09 06:03:14,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2647 to 2643. [2025-03-09 06:03:14,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2643 states, 1630 states have (on average 1.7920245398773007) internal successors, (2921), 2637 states have internal predecessors, (2921), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2025-03-09 06:03:14,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2643 states to 2643 states and 4927 transitions. [2025-03-09 06:03:14,879 INFO L78 Accepts]: Start accepts. Automaton has 2643 states and 4927 transitions. Word has length 79 [2025-03-09 06:03:14,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:03:14,881 INFO L471 AbstractCegarLoop]: Abstraction has 2643 states and 4927 transitions. [2025-03-09 06:03:14,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 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-03-09 06:03:14,881 INFO L276 IsEmpty]: Start isEmpty. Operand 2643 states and 4927 transitions. [2025-03-09 06:03:14,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-09 06:03:14,882 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:03:14,883 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-03-09 06:03:14,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 06:03:14,883 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 06:03:14,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:03:14,884 INFO L85 PathProgramCache]: Analyzing trace with hash 131311521, now seen corresponding path program 1 times [2025-03-09 06:03:14,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:03:14,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264650487] [2025-03-09 06:03:14,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:03:14,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:03:14,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-09 06:03:14,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-09 06:03:14,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:03:14,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:03:15,204 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 06:03:15,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:03:15,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264650487] [2025-03-09 06:03:15,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264650487] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:03:15,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:03:15,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:03:15,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133612599] [2025-03-09 06:03:15,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:03:15,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:03:15,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:03:15,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:03:15,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:03:15,206 INFO L87 Difference]: Start difference. First operand 2643 states and 4927 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-03-09 06:03:16,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:03:16,150 INFO L93 Difference]: Finished difference Result 4882 states and 9265 transitions. [2025-03-09 06:03:16,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:03:16,151 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-03-09 06:03:16,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:03:16,229 INFO L225 Difference]: With dead ends: 4882 [2025-03-09 06:03:16,229 INFO L226 Difference]: Without dead ends: 4880 [2025-03-09 06:03:16,231 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-03-09 06:03:16,233 INFO L435 NwaCegarLoop]: 2714 mSDtfsCounter, 1424 mSDsluCounter, 4674 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1925 SdHoareTripleChecker+Valid, 7388 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-09 06:03:16,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1925 Valid, 7388 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 691 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-09 06:03:16,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4880 states. [2025-03-09 06:03:16,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4880 to 2706. [2025-03-09 06:03:16,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2706 states, 1690 states have (on average 1.7739644970414201) internal successors, (2998), 2697 states have internal predecessors, (2998), 1006 states have call successors, (1006), 2 states have call predecessors, (1006), 2 states have return successors, (1006), 8 states have call predecessors, (1006), 1006 states have call successors, (1006) [2025-03-09 06:03:16,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2706 states and 5010 transitions. [2025-03-09 06:03:16,692 INFO L78 Accepts]: Start accepts. Automaton has 2706 states and 5010 transitions. Word has length 94 [2025-03-09 06:03:16,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:03:16,692 INFO L471 AbstractCegarLoop]: Abstraction has 2706 states and 5010 transitions. [2025-03-09 06:03:16,692 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-03-09 06:03:16,693 INFO L276 IsEmpty]: Start isEmpty. Operand 2706 states and 5010 transitions. [2025-03-09 06:03:16,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-09 06:03:16,694 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:03:16,694 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-03-09 06:03:16,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 06:03:16,694 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 06:03:16,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:03:16,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1401824976, now seen corresponding path program 1 times [2025-03-09 06:03:16,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:03:16,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872376105] [2025-03-09 06:03:16,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:03:16,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:03:16,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-09 06:03:16,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-09 06:03:16,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:03:16,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:03:17,088 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 06:03:17,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:03:17,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872376105] [2025-03-09 06:03:17,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872376105] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:03:17,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881902182] [2025-03-09 06:03:17,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:03:17,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:03:17,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:03:17,091 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:03:17,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 06:03:17,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-09 06:03:17,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-09 06:03:17,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:03:17,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:03:17,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-09 06:03:17,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:03:17,316 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-03-09 06:03:17,331 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-03-09 06:03:17,348 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-03-09 06:03:18,018 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 06:03:18,018 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:03:18,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881902182] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:03:18,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:03:18,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2025-03-09 06:03:18,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289493518] [2025-03-09 06:03:18,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:03:18,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 06:03:18,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:03:18,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 06:03:18,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-09 06:03:18,021 INFO L87 Difference]: Start difference. First operand 2706 states and 5010 transitions. Second operand has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 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-03-09 06:03:20,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:03:20,684 INFO L93 Difference]: Finished difference Result 7548 states and 14214 transitions. [2025-03-09 06:03:20,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 06:03:20,685 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 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-03-09 06:03:20,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:03:20,725 INFO L225 Difference]: With dead ends: 7548 [2025-03-09 06:03:20,726 INFO L226 Difference]: Without dead ends: 4928 [2025-03-09 06:03:20,740 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-03-09 06:03:20,741 INFO L435 NwaCegarLoop]: 2743 mSDtfsCounter, 1779 mSDsluCounter, 15034 mSDsCounter, 0 mSdLazyCounter, 1717 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2281 SdHoareTripleChecker+Valid, 17777 SdHoareTripleChecker+Invalid, 1722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-09 06:03:20,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2281 Valid, 17777 Invalid, 1722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1717 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-09 06:03:20,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4928 states. [2025-03-09 06:03:21,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4928 to 2731. [2025-03-09 06:03:21,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2731 states, 1715 states have (on average 1.765597667638484) internal successors, (3028), 2722 states have internal predecessors, (3028), 1006 states have call successors, (1006), 2 states have call predecessors, (1006), 2 states have return successors, (1006), 8 states have call predecessors, (1006), 1006 states have call successors, (1006) [2025-03-09 06:03:21,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2731 states to 2731 states and 5040 transitions. [2025-03-09 06:03:21,317 INFO L78 Accepts]: Start accepts. Automaton has 2731 states and 5040 transitions. Word has length 100 [2025-03-09 06:03:21,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:03:21,318 INFO L471 AbstractCegarLoop]: Abstraction has 2731 states and 5040 transitions. [2025-03-09 06:03:21,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 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-03-09 06:03:21,318 INFO L276 IsEmpty]: Start isEmpty. Operand 2731 states and 5040 transitions. [2025-03-09 06:03:21,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-09 06:03:21,319 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:03:21,319 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-03-09 06:03:21,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 06:03:21,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-09 06:03:21,520 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 06:03:21,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:03:21,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1318465422, now seen corresponding path program 1 times [2025-03-09 06:03:21,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:03:21,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83386617] [2025-03-09 06:03:21,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:03:21,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:03:21,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-09 06:03:21,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-09 06:03:21,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:03:21,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:03:21,827 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 06:03:21,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:03:21,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83386617] [2025-03-09 06:03:21,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83386617] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:03:21,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945734455] [2025-03-09 06:03:21,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:03:21,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:03:21,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:03:21,834 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:03:21,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 06:03:21,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-09 06:03:22,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-09 06:03:22,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:03:22,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:03:22,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-09 06:03:22,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:04:26,343 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)