./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test3-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 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_test3-2.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 32a779d95d64b7b3ae1a801430dde2c7d15b3372c5d0cdd47679441a42687631 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 14:48:24,893 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 14:48:24,949 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 14:48:24,955 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 14:48:24,956 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 14:48:24,977 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 14:48:24,978 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 14:48:24,978 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 14:48:24,979 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 14:48:24,979 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 14:48:24,979 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 14:48:24,980 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 14:48:24,980 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 14:48:24,980 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 14:48:24,980 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 14:48:24,980 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 14:48:24,980 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 14:48:24,981 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 14:48:24,981 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 14:48:24,981 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 14:48:24,981 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 14:48:24,981 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 14:48:24,981 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 14:48:24,981 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 14:48:24,981 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 14:48:24,981 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 14:48:24,982 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 14:48:24,982 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 14:48:24,982 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 14:48:24,982 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 14:48:24,982 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 14:48:24,982 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 14:48:24,982 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 14:48:24,982 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 14:48:24,983 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 14:48:24,983 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 14:48:24,983 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 14:48:24,983 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 14:48:24,983 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 14:48:24,983 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 14:48:24,983 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 14:48:24,983 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 14:48:24,983 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 14:48:24,983 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 14:48:24,983 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 14:48:24,983 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 -> 32a779d95d64b7b3ae1a801430dde2c7d15b3372c5d0cdd47679441a42687631 [2025-03-04 14:48:25,202 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 14:48:25,210 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 14:48:25,211 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 14:48:25,213 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 14:48:25,213 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 14:48:25,215 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_test3-2.i [2025-03-04 14:48:26,301 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c45ff3cb/76e9f4151bb7400e93cd7bbcdc6ef99a/FLAG7220db88b [2025-03-04 14:48:26,575 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 14:48:26,576 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test3-2.i [2025-03-04 14:48:26,589 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c45ff3cb/76e9f4151bb7400e93cd7bbcdc6ef99a/FLAG7220db88b [2025-03-04 14:48:26,863 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c45ff3cb/76e9f4151bb7400e93cd7bbcdc6ef99a [2025-03-04 14:48:26,865 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 14:48:26,866 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 14:48:26,867 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 14:48:26,867 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 14:48:26,872 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 14:48:26,872 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:48:26" (1/1) ... [2025-03-04 14:48:26,873 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fffe656 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:48:26, skipping insertion in model container [2025-03-04 14:48:26,873 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:48:26" (1/1) ... [2025-03-04 14:48:26,907 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 14:48:27,252 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 14:48:27,272 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 14:48:27,375 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 14:48:27,407 INFO L204 MainTranslator]: Completed translation [2025-03-04 14:48:27,407 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:48:27 WrapperNode [2025-03-04 14:48:27,408 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 14:48:27,409 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 14:48:27,409 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 14:48:27,409 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 14:48:27,414 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:48:27" (1/1) ... [2025-03-04 14:48:27,441 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:48:27" (1/1) ... [2025-03-04 14:48:27,510 INFO L138 Inliner]: procedures = 177, calls = 330, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1577 [2025-03-04 14:48:27,511 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 14:48:27,511 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 14:48:27,511 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 14:48:27,511 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 14:48:27,519 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:48:27" (1/1) ... [2025-03-04 14:48:27,520 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:48:27" (1/1) ... [2025-03-04 14:48:27,534 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:48:27" (1/1) ... [2025-03-04 14:48:27,622 INFO L175 MemorySlicer]: Split 303 memory accesses to 3 slices as follows [2, 267, 34]. 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, 58, 4]. [2025-03-04 14:48:27,622 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:48:27" (1/1) ... [2025-03-04 14:48:27,622 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:48:27" (1/1) ... [2025-03-04 14:48:27,659 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:48:27" (1/1) ... [2025-03-04 14:48:27,661 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:48:27" (1/1) ... [2025-03-04 14:48:27,667 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:48:27" (1/1) ... [2025-03-04 14:48:27,670 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:48:27" (1/1) ... [2025-03-04 14:48:27,681 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 14:48:27,682 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 14:48:27,683 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 14:48:27,683 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 14:48:27,683 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:48:27" (1/1) ... [2025-03-04 14:48:27,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 14:48:27,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:48:27,706 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-04 14:48:27,708 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-04 14:48:27,722 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-03-04 14:48:27,723 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-03-04 14:48:27,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 14:48:27,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 14:48:27,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 14:48:27,723 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 14:48:27,723 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 14:48:27,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 14:48:27,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 14:48:27,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 14:48:27,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-04 14:48:27,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-04 14:48:27,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-04 14:48:27,723 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-04 14:48:27,723 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-04 14:48:27,723 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-04 14:48:27,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 14:48:27,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 14:48:27,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 14:48:27,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 14:48:27,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 14:48:27,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 14:48:27,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 14:48:27,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 14:48:27,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 14:48:27,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 14:48:27,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 14:48:27,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 14:48:27,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 14:48:27,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 14:48:27,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 14:48:27,878 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 14:48:27,879 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 14:48:29,009 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L733: 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-04 14:48:29,117 INFO L? ?]: Removed 355 outVars from TransFormulas that were not future-live. [2025-03-04 14:48:29,117 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 14:48:29,159 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 14:48:29,159 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-04 14:48:29,159 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:48:29 BoogieIcfgContainer [2025-03-04 14:48:29,160 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 14:48:29,161 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 14:48:29,161 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 14:48:29,167 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 14:48:29,167 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:48:26" (1/3) ... [2025-03-04 14:48:29,168 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@732b2938 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:48:29, skipping insertion in model container [2025-03-04 14:48:29,168 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:48:27" (2/3) ... [2025-03-04 14:48:29,169 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@732b2938 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:48:29, skipping insertion in model container [2025-03-04 14:48:29,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:48:29" (3/3) ... [2025-03-04 14:48:29,170 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_BER_test3-2.i [2025-03-04 14:48:29,182 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 14:48:29,183 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_BER_test3-2.i that has 6 procedures, 463 locations, 1 initial locations, 41 loop locations, and 8 error locations. [2025-03-04 14:48:29,230 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 14:48:29,238 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;@5123240d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 14:48:29,239 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-04 14:48:29,243 INFO L276 IsEmpty]: Start isEmpty. Operand has 455 states, 433 states have (on average 1.628175519630485) internal successors, (705), 448 states have internal predecessors, (705), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 14:48:29,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 14:48:29,247 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:48:29,247 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:48:29,248 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-04 14:48:29,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:48:29,252 INFO L85 PathProgramCache]: Analyzing trace with hash -2054463359, now seen corresponding path program 1 times [2025-03-04 14:48:29,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:48:29,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629056068] [2025-03-04 14:48:29,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:48:29,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:48:29,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 14:48:29,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 14:48:29,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:48:29,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:48:29,372 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-04 14:48:29,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:48:29,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629056068] [2025-03-04 14:48:29,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629056068] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:48:29,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:48:29,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:48:29,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546908630] [2025-03-04 14:48:29,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:48:29,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 14:48:29,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:48:29,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 14:48:29,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 14:48:29,394 INFO L87 Difference]: Start difference. First operand has 455 states, 433 states have (on average 1.628175519630485) internal successors, (705), 448 states have internal predecessors, (705), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) 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-04 14:48:29,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:48:29,489 INFO L93 Difference]: Finished difference Result 906 states and 1452 transitions. [2025-03-04 14:48:29,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 14:48:29,490 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-04 14:48:29,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:48:29,497 INFO L225 Difference]: With dead ends: 906 [2025-03-04 14:48:29,497 INFO L226 Difference]: Without dead ends: 414 [2025-03-04 14:48:29,500 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-04 14:48:29,504 INFO L435 NwaCegarLoop]: 607 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 607 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-03-04 14:48:29,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 607 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:48:29,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2025-03-04 14:48:29,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 414. [2025-03-04 14:48:29,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 396 states have (on average 1.4671717171717171) internal successors, (581), 408 states have internal predecessors, (581), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 14:48:29,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 597 transitions. [2025-03-04 14:48:29,551 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 597 transitions. Word has length 7 [2025-03-04 14:48:29,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:48:29,552 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 597 transitions. [2025-03-04 14:48:29,552 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-04 14:48:29,552 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 597 transitions. [2025-03-04 14:48:29,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 14:48:29,552 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:48:29,553 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:48:29,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 14:48:29,553 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-04 14:48:29,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:48:29,554 INFO L85 PathProgramCache]: Analyzing trace with hash -2054462398, now seen corresponding path program 1 times [2025-03-04 14:48:29,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:48:29,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265549071] [2025-03-04 14:48:29,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:48:29,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:48:29,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 14:48:29,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 14:48:29,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:48:29,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 14:48:29,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1977030081] [2025-03-04 14:48:29,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:48:29,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:48:29,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:48:29,597 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-04 14:48:29,599 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-04 14:48:29,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 14:48:29,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 14:48:29,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:48:29,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:48:29,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 14:48:29,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:48:29,747 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-04 14:48:29,766 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-04 14:48:29,766 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:48:29,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:48:29,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265549071] [2025-03-04 14:48:29,767 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 14:48:29,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977030081] [2025-03-04 14:48:29,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1977030081] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:48:29,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:48:29,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:48:29,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007245519] [2025-03-04 14:48:29,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:48:29,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:48:29,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:48:29,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:48:29,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:48:29,769 INFO L87 Difference]: Start difference. First operand 414 states and 597 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-04 14:48:30,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:48:30,019 INFO L93 Difference]: Finished difference Result 818 states and 1185 transitions. [2025-03-04 14:48:30,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:48:30,019 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-04 14:48:30,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:48:30,022 INFO L225 Difference]: With dead ends: 818 [2025-03-04 14:48:30,023 INFO L226 Difference]: Without dead ends: 816 [2025-03-04 14:48:30,023 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-04 14:48:30,023 INFO L435 NwaCegarLoop]: 534 mSDtfsCounter, 565 mSDsluCounter, 1056 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 1590 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 14:48:30,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 1590 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 14:48:30,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2025-03-04 14:48:30,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 420. [2025-03-04 14:48:30,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 402 states have (on average 1.462686567164179) internal successors, (588), 414 states have internal predecessors, (588), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 14:48:30,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 604 transitions. [2025-03-04 14:48:30,042 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 604 transitions. Word has length 7 [2025-03-04 14:48:30,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:48:30,042 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 604 transitions. [2025-03-04 14:48:30,042 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-04 14:48:30,042 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 604 transitions. [2025-03-04 14:48:30,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-04 14:48:30,042 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:48:30,043 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:48:30,049 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 14:48:30,243 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-04 14:48:30,243 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 14:48:30,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:48:30,244 INFO L85 PathProgramCache]: Analyzing trace with hash 822885562, now seen corresponding path program 1 times [2025-03-04 14:48:30,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:48:30,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380025909] [2025-03-04 14:48:30,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:48:30,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:48:30,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 14:48:30,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 14:48:30,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:48:30,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:48:30,394 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-04 14:48:30,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:48:30,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380025909] [2025-03-04 14:48:30,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380025909] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:48:30,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:48:30,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 14:48:30,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346973915] [2025-03-04 14:48:30,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:48:30,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:48:30,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:48:30,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:48:30,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:48:30,395 INFO L87 Difference]: Start difference. First operand 420 states and 604 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-04 14:48:30,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:48:30,621 INFO L93 Difference]: Finished difference Result 1023 states and 1485 transitions. [2025-03-04 14:48:30,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:48:30,621 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2025-03-04 14:48:30,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:48:30,624 INFO L225 Difference]: With dead ends: 1023 [2025-03-04 14:48:30,624 INFO L226 Difference]: Without dead ends: 815 [2025-03-04 14:48:30,625 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-04 14:48:30,625 INFO L435 NwaCegarLoop]: 534 mSDtfsCounter, 566 mSDsluCounter, 1057 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 574 SdHoareTripleChecker+Valid, 1591 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 14:48:30,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [574 Valid, 1591 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 14:48:30,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2025-03-04 14:48:30,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 420. [2025-03-04 14:48:30,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 402 states have (on average 1.4601990049751243) internal successors, (587), 414 states have internal predecessors, (587), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 14:48:30,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 603 transitions. [2025-03-04 14:48:30,654 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 603 transitions. Word has length 10 [2025-03-04 14:48:30,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:48:30,654 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 603 transitions. [2025-03-04 14:48:30,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-04 14:48:30,654 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 603 transitions. [2025-03-04 14:48:30,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-04 14:48:30,656 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:48:30,656 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-04 14:48:30,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 14:48:30,656 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-04 14:48:30,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:48:30,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1581610735, now seen corresponding path program 1 times [2025-03-04 14:48:30,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:48:30,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205189568] [2025-03-04 14:48:30,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:48:30,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:48:30,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-04 14:48:30,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-04 14:48:30,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:48:30,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:48:30,885 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-04 14:48:30,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:48:30,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205189568] [2025-03-04 14:48:30,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205189568] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:48:30,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:48:30,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 14:48:30,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332001220] [2025-03-04 14:48:30,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:48:30,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:48:30,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:48:30,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:48:30,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:48:30,888 INFO L87 Difference]: Start difference. First operand 420 states and 603 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-03-04 14:48:31,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:48:31,021 INFO L93 Difference]: Finished difference Result 835 states and 1201 transitions. [2025-03-04 14:48:31,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:48:31,021 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-03-04 14:48:31,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:48:31,023 INFO L225 Difference]: With dead ends: 835 [2025-03-04 14:48:31,023 INFO L226 Difference]: Without dead ends: 423 [2025-03-04 14:48:31,024 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-04 14:48:31,024 INFO L435 NwaCegarLoop]: 528 mSDtfsCounter, 105 mSDsluCounter, 972 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1500 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-03-04 14:48:31,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1500 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:48:31,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2025-03-04 14:48:31,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 420. [2025-03-04 14:48:31,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 402 states have (on average 1.4427860696517414) internal successors, (580), 414 states have internal predecessors, (580), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 14:48:31,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 596 transitions. [2025-03-04 14:48:31,033 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 596 transitions. Word has length 79 [2025-03-04 14:48:31,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:48:31,033 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 596 transitions. [2025-03-04 14:48:31,033 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-03-04 14:48:31,033 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 596 transitions. [2025-03-04 14:48:31,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-04 14:48:31,035 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:48:31,035 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-04 14:48:31,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 14:48:31,035 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-04 14:48:31,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:48:31,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1327412842, now seen corresponding path program 1 times [2025-03-04 14:48:31,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:48:31,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242816129] [2025-03-04 14:48:31,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:48:31,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:48:31,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-04 14:48:31,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-04 14:48:31,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:48:31,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:48:31,175 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-04 14:48:31,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:48:31,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242816129] [2025-03-04 14:48:31,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242816129] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:48:31,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:48:31,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:48:31,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072403968] [2025-03-04 14:48:31,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:48:31,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:48:31,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:48:31,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:48:31,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:48:31,177 INFO L87 Difference]: Start difference. First operand 420 states and 596 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-04 14:48:31,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:48:31,351 INFO L93 Difference]: Finished difference Result 1138 states and 1638 transitions. [2025-03-04 14:48:31,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:48:31,352 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-04 14:48:31,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:48:31,355 INFO L225 Difference]: With dead ends: 1138 [2025-03-04 14:48:31,355 INFO L226 Difference]: Without dead ends: 726 [2025-03-04 14:48:31,355 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-04 14:48:31,356 INFO L435 NwaCegarLoop]: 739 mSDtfsCounter, 389 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 1268 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 14:48:31,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 1268 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 14:48:31,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2025-03-04 14:48:31,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 705. [2025-03-04 14:48:31,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 687 states have (on average 1.4599708879184863) internal successors, (1003), 699 states have internal predecessors, (1003), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 14:48:31,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 1019 transitions. [2025-03-04 14:48:31,370 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 1019 transitions. Word has length 79 [2025-03-04 14:48:31,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:48:31,370 INFO L471 AbstractCegarLoop]: Abstraction has 705 states and 1019 transitions. [2025-03-04 14:48:31,371 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-04 14:48:31,371 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 1019 transitions. [2025-03-04 14:48:31,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-04 14:48:31,372 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:48:31,373 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-04 14:48:31,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 14:48:31,373 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-04 14:48:31,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:48:31,373 INFO L85 PathProgramCache]: Analyzing trace with hash -813187614, now seen corresponding path program 1 times [2025-03-04 14:48:31,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:48:31,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303389647] [2025-03-04 14:48:31,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:48:31,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:48:31,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 14:48:31,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 14:48:31,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:48:31,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:48:31,509 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-04 14:48:31,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:48:31,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303389647] [2025-03-04 14:48:31,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303389647] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:48:31,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:48:31,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:48:31,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756585421] [2025-03-04 14:48:31,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:48:31,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:48:31,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:48:31,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:48:31,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:48:31,511 INFO L87 Difference]: Start difference. First operand 705 states and 1019 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 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-04 14:48:31,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:48:31,611 INFO L93 Difference]: Finished difference Result 1346 states and 1950 transitions. [2025-03-04 14:48:31,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:48:31,611 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 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-04 14:48:31,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:48:31,614 INFO L225 Difference]: With dead ends: 1346 [2025-03-04 14:48:31,614 INFO L226 Difference]: Without dead ends: 717 [2025-03-04 14:48:31,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-04 14:48:31,616 INFO L435 NwaCegarLoop]: 542 mSDtfsCounter, 1 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1062 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:48:31,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1062 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:48:31,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2025-03-04 14:48:31,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 717. [2025-03-04 14:48:31,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 717 states, 699 states have (on average 1.452074391988555) internal successors, (1015), 711 states have internal predecessors, (1015), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 14:48:31,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1031 transitions. [2025-03-04 14:48:31,639 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1031 transitions. Word has length 94 [2025-03-04 14:48:31,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:48:31,640 INFO L471 AbstractCegarLoop]: Abstraction has 717 states and 1031 transitions. [2025-03-04 14:48:31,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 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-04 14:48:31,640 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1031 transitions. [2025-03-04 14:48:31,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-04 14:48:31,641 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:48:31,641 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-04 14:48:31,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 14:48:31,641 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 14:48:31,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:48:31,641 INFO L85 PathProgramCache]: Analyzing trace with hash -604489311, now seen corresponding path program 1 times [2025-03-04 14:48:31,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:48:31,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089569655] [2025-03-04 14:48:31,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:48:31,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:48:31,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 14:48:31,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 14:48:31,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:48:31,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:48:31,952 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-04 14:48:31,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:48:31,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089569655] [2025-03-04 14:48:31,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089569655] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:48:31,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:48:31,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:48:31,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042761146] [2025-03-04 14:48:31,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:48:31,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:48:31,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:48:31,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:48:31,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:48:31,955 INFO L87 Difference]: Start difference. First operand 717 states and 1031 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-04 14:48:32,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:48:32,143 INFO L93 Difference]: Finished difference Result 1018 states and 1460 transitions. [2025-03-04 14:48:32,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:48:32,143 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-04 14:48:32,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:48:32,147 INFO L225 Difference]: With dead ends: 1018 [2025-03-04 14:48:32,147 INFO L226 Difference]: Without dead ends: 1016 [2025-03-04 14:48:32,148 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-04 14:48:32,149 INFO L435 NwaCegarLoop]: 530 mSDtfsCounter, 475 mSDsluCounter, 1045 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 1575 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 14:48:32,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 1575 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 14:48:32,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2025-03-04 14:48:32,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 780. [2025-03-04 14:48:32,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 780 states, 759 states have (on average 1.4387351778656126) internal successors, (1092), 771 states have internal predecessors, (1092), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 14:48:32,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1114 transitions. [2025-03-04 14:48:32,176 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1114 transitions. Word has length 94 [2025-03-04 14:48:32,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:48:32,177 INFO L471 AbstractCegarLoop]: Abstraction has 780 states and 1114 transitions. [2025-03-04 14:48:32,178 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-04 14:48:32,178 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1114 transitions. [2025-03-04 14:48:32,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-04 14:48:32,179 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:48:32,179 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-04 14:48:32,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 14:48:32,179 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-04 14:48:32,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:48:32,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1706715248, now seen corresponding path program 1 times [2025-03-04 14:48:32,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:48:32,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861018464] [2025-03-04 14:48:32,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:48:32,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:48:32,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 14:48:32,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 14:48:32,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:48:32,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:48:32,600 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-04 14:48:32,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:48:32,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861018464] [2025-03-04 14:48:32,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861018464] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:48:32,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315944336] [2025-03-04 14:48:32,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:48:32,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:48:32,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:48:32,605 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-04 14:48:32,607 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-04 14:48:32,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 14:48:32,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 14:48:32,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:48:32,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:48:32,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-04 14:48:32,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:48:32,895 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-04 14:48:32,910 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-04 14:48:32,923 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 27 treesize of output 11 [2025-03-04 14:48:37,303 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 14:48:37,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 38 [2025-03-04 14:48:37,635 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-04 14:48:37,635 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:48:37,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315944336] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:48:37,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:48:37,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2025-03-04 14:48:37,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965984470] [2025-03-04 14:48:37,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:48:37,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 14:48:37,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:48:37,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 14:48:37,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=125, Unknown=1, NotChecked=0, Total=156 [2025-03-04 14:48:37,638 INFO L87 Difference]: Start difference. First operand 780 states and 1114 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-04 14:48:41,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 14:48:44,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:48:44,763 INFO L93 Difference]: Finished difference Result 1744 states and 2493 transitions. [2025-03-04 14:48:44,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 14:48:44,765 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-04 14:48:44,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:48:44,768 INFO L225 Difference]: With dead ends: 1744 [2025-03-04 14:48:44,769 INFO L226 Difference]: Without dead ends: 1056 [2025-03-04 14:48:44,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=90, Invalid=329, Unknown=1, NotChecked=0, Total=420 [2025-03-04 14:48:44,770 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 824 mSDsluCounter, 3363 mSDsCounter, 0 mSdLazyCounter, 1778 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 831 SdHoareTripleChecker+Valid, 3918 SdHoareTripleChecker+Invalid, 1787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1778 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2025-03-04 14:48:44,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [831 Valid, 3918 Invalid, 1787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1778 Invalid, 1 Unknown, 0 Unchecked, 6.8s Time] [2025-03-04 14:48:44,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2025-03-04 14:48:44,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 811. [2025-03-04 14:48:44,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 790 states have (on average 1.4278481012658228) internal successors, (1128), 802 states have internal predecessors, (1128), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 14:48:44,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1150 transitions. [2025-03-04 14:48:44,786 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1150 transitions. Word has length 100 [2025-03-04 14:48:44,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:48:44,786 INFO L471 AbstractCegarLoop]: Abstraction has 811 states and 1150 transitions. [2025-03-04 14:48:44,787 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-04 14:48:44,787 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1150 transitions. [2025-03-04 14:48:44,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-04 14:48:44,787 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:48:44,788 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-04 14:48:44,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 14:48:44,992 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,SelfDestructingSolverStorable7 [2025-03-04 14:48:44,992 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 14:48:44,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:48:44,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1721199823, now seen corresponding path program 1 times [2025-03-04 14:48:44,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:48:44,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540831940] [2025-03-04 14:48:44,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:48:44,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:48:45,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 14:48:45,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 14:48:45,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:48:45,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:48:45,101 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-04 14:48:45,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:48:45,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540831940] [2025-03-04 14:48:45,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540831940] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:48:45,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:48:45,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 14:48:45,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267814308] [2025-03-04 14:48:45,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:48:45,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:48:45,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:48:45,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:48:45,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:48:45,103 INFO L87 Difference]: Start difference. First operand 811 states and 1150 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 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-04 14:48:45,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:48:45,224 INFO L93 Difference]: Finished difference Result 1451 states and 2061 transitions. [2025-03-04 14:48:45,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 14:48:45,226 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 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-04 14:48:45,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:48:45,228 INFO L225 Difference]: With dead ends: 1451 [2025-03-04 14:48:45,228 INFO L226 Difference]: Without dead ends: 672 [2025-03-04 14:48:45,229 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-04 14:48:45,230 INFO L435 NwaCegarLoop]: 462 mSDtfsCounter, 9 mSDsluCounter, 905 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1367 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:48:45,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1367 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:48:45,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2025-03-04 14:48:45,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 672. [2025-03-04 14:48:45,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 651 states have (on average 1.411674347158218) internal successors, (919), 663 states have internal predecessors, (919), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 14:48:45,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 941 transitions. [2025-03-04 14:48:45,247 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 941 transitions. Word has length 100 [2025-03-04 14:48:45,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:48:45,248 INFO L471 AbstractCegarLoop]: Abstraction has 672 states and 941 transitions. [2025-03-04 14:48:45,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 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-04 14:48:45,248 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 941 transitions. [2025-03-04 14:48:45,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-04 14:48:45,249 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:48:45,249 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-04 14:48:45,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 14:48:45,250 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 14:48:45,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:48:45,250 INFO L85 PathProgramCache]: Analyzing trace with hash 661353628, now seen corresponding path program 1 times [2025-03-04 14:48:45,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:48:45,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813721535] [2025-03-04 14:48:45,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:48:45,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:48:45,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-04 14:48:45,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 14:48:45,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:48:45,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:48:45,509 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-04 14:48:45,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:48:45,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813721535] [2025-03-04 14:48:45,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813721535] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:48:45,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905197308] [2025-03-04 14:48:45,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:48:45,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:48:45,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:48:45,513 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-04 14:48:45,515 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-04 14:48:45,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-04 14:48:45,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 14:48:45,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:48:45,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:48:45,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-04 14:48:45,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:49:18,816 WARN L286 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-04 14:49:30,829 WARN L286 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-04 14:49:35,856 WARN L286 SmtUtils]: Spent 5.03s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-04 14:49:52,286 WARN L286 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-04 14:50:01,321 WARN L286 SmtUtils]: Spent 9.03s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)