./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/head-3.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/busybox-1.22.0/head-3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 64bit --witnessprinter.graph.data.programhash 9d0d62704d9d2a7d6604a8f9e55e356598a3d0a692f256361f60668a3d4dba4c --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 05:52:48,849 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 05:52:48,904 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-09 05:52:48,910 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 05:52:48,910 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 05:52:48,924 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 05:52:48,925 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 05:52:48,925 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 05:52:48,925 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 05:52:48,925 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 05:52:48,926 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 05:52:48,926 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 05:52:48,926 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 05:52:48,926 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 05:52:48,927 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 05:52:48,927 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 05:52:48,927 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 05:52:48,927 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 05:52:48,927 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 05:52:48,927 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 05:52:48,928 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 05:52:48,928 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 05:52:48,928 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 05:52:48,928 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 05:52:48,928 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 05:52:48,928 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 05:52:48,928 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 05:52:48,928 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 05:52:48,928 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 05:52:48,928 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 05:52:48,928 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 05:52:48,928 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 05:52:48,928 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 05:52:48,929 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 05:52:48,929 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 05:52:48,929 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 05:52:48,929 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 05:52:48,929 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 05:52:48,929 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 05:52:48,930 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 05:52:48,930 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 05:52:48,930 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 05:52:48,930 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9d0d62704d9d2a7d6604a8f9e55e356598a3d0a692f256361f60668a3d4dba4c [2025-03-09 05:52:49,137 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 05:52:49,144 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 05:52:49,147 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 05:52:49,148 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 05:52:49,148 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 05:52:49,149 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/head-3.i [2025-03-09 05:52:50,268 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88c414958/e681f8ab896943ac8c4949d50f55e286/FLAG95e6c151d [2025-03-09 05:52:50,584 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 05:52:50,585 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/head-3.i [2025-03-09 05:52:50,607 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88c414958/e681f8ab896943ac8c4949d50f55e286/FLAG95e6c151d [2025-03-09 05:52:50,835 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88c414958/e681f8ab896943ac8c4949d50f55e286 [2025-03-09 05:52:50,837 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 05:52:50,838 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 05:52:50,839 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 05:52:50,839 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 05:52:50,842 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 05:52:50,842 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 05:52:50" (1/1) ... [2025-03-09 05:52:50,843 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b8b4742 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:52:50, skipping insertion in model container [2025-03-09 05:52:50,843 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 05:52:50" (1/1) ... [2025-03-09 05:52:50,896 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 05:52:51,672 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 05:52:51,703 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 05:52:51,813 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 05:52:51,925 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-03-09 05:52:51,932 INFO L204 MainTranslator]: Completed translation [2025-03-09 05:52:51,933 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:52:51 WrapperNode [2025-03-09 05:52:51,933 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 05:52:51,934 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 05:52:51,934 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 05:52:51,934 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 05:52:51,938 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:52:51" (1/1) ... [2025-03-09 05:52:51,968 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:52:51" (1/1) ... [2025-03-09 05:52:52,055 INFO L138 Inliner]: procedures = 581, calls = 697, calls flagged for inlining = 30, calls inlined = 28, statements flattened = 1397 [2025-03-09 05:52:52,056 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 05:52:52,056 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 05:52:52,056 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 05:52:52,056 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 05:52:52,064 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:52:51" (1/1) ... [2025-03-09 05:52:52,064 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:52:51" (1/1) ... [2025-03-09 05:52:52,078 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:52:51" (1/1) ... [2025-03-09 05:52:52,137 INFO L175 MemorySlicer]: Split 566 memory accesses to 19 slices as follows [3, 2, 9, 3, 2, 7, 2, 20, 9, 32, 24, 10, 15, 355, 18, 47, 3, 1, 4]. 63 percent of accesses are in the largest equivalence class. The 379 initializations are split as follows [0, 2, 0, 3, 0, 0, 2, 4, 1, 2, 0, 7, 0, 355, 0, 2, 0, 0, 1]. The 120 writes are split as follows [3, 0, 6, 0, 1, 7, 0, 15, 4, 21, 21, 0, 1, 0, 4, 35, 0, 1, 1]. [2025-03-09 05:52:52,137 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:52:51" (1/1) ... [2025-03-09 05:52:52,138 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:52:51" (1/1) ... [2025-03-09 05:52:52,177 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:52:51" (1/1) ... [2025-03-09 05:52:52,181 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:52:51" (1/1) ... [2025-03-09 05:52:52,199 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:52:51" (1/1) ... [2025-03-09 05:52:52,209 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:52:51" (1/1) ... [2025-03-09 05:52:52,224 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 05:52:52,226 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 05:52:52,227 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 05:52:52,227 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 05:52:52,228 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:52:51" (1/1) ... [2025-03-09 05:52:52,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 05:52:52,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:52:52,258 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 05:52:52,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 05:52:52,277 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#0 [2025-03-09 05:52:52,277 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#1 [2025-03-09 05:52:52,277 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#2 [2025-03-09 05:52:52,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#3 [2025-03-09 05:52:52,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#4 [2025-03-09 05:52:52,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#5 [2025-03-09 05:52:52,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#6 [2025-03-09 05:52:52,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#7 [2025-03-09 05:52:52,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#8 [2025-03-09 05:52:52,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#9 [2025-03-09 05:52:52,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#10 [2025-03-09 05:52:52,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#11 [2025-03-09 05:52:52,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#12 [2025-03-09 05:52:52,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#13 [2025-03-09 05:52:52,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#14 [2025-03-09 05:52:52,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#15 [2025-03-09 05:52:52,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#16 [2025-03-09 05:52:52,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#17 [2025-03-09 05:52:52,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#18 [2025-03-09 05:52:52,278 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#0 [2025-03-09 05:52:52,278 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#1 [2025-03-09 05:52:52,278 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#2 [2025-03-09 05:52:52,278 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#3 [2025-03-09 05:52:52,278 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#4 [2025-03-09 05:52:52,278 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#5 [2025-03-09 05:52:52,279 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#6 [2025-03-09 05:52:52,279 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#7 [2025-03-09 05:52:52,279 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#8 [2025-03-09 05:52:52,279 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#9 [2025-03-09 05:52:52,279 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#10 [2025-03-09 05:52:52,279 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#11 [2025-03-09 05:52:52,279 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#12 [2025-03-09 05:52:52,279 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#13 [2025-03-09 05:52:52,279 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#14 [2025-03-09 05:52:52,279 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#15 [2025-03-09 05:52:52,279 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#16 [2025-03-09 05:52:52,279 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#17 [2025-03-09 05:52:52,279 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#18 [2025-03-09 05:52:52,279 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_getc [2025-03-09 05:52:52,279 INFO L138 BoogieDeclarations]: Found implementation of procedure _IO_getc [2025-03-09 05:52:52,279 INFO L130 BoogieDeclarations]: Found specification of procedure xrealloc [2025-03-09 05:52:52,279 INFO L138 BoogieDeclarations]: Found implementation of procedure xrealloc [2025-03-09 05:52:52,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 05:52:52,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-03-09 05:52:52,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-03-09 05:52:52,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-03-09 05:52:52,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-03-09 05:52:52,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-03-09 05:52:52,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-03-09 05:52:52,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-03-09 05:52:52,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-03-09 05:52:52,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2025-03-09 05:52:52,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2025-03-09 05:52:52,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#10 [2025-03-09 05:52:52,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#11 [2025-03-09 05:52:52,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#12 [2025-03-09 05:52:52,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#13 [2025-03-09 05:52:52,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#14 [2025-03-09 05:52:52,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#15 [2025-03-09 05:52:52,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#16 [2025-03-09 05:52:52,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#17 [2025-03-09 05:52:52,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#18 [2025-03-09 05:52:52,282 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-03-09 05:52:52,282 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-03-09 05:52:52,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-09 05:52:52,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-09 05:52:52,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-09 05:52:52,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-09 05:52:52,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-09 05:52:52,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-09 05:52:52,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-09 05:52:52,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-09 05:52:52,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-09 05:52:52,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-03-09 05:52:52,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-03-09 05:52:52,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-03-09 05:52:52,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-03-09 05:52:52,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-03-09 05:52:52,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-03-09 05:52:52,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-03-09 05:52:52,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-03-09 05:52:52,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-03-09 05:52:52,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-03-09 05:52:52,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 05:52:52,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 05:52:52,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 05:52:52,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-09 05:52:52,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-09 05:52:52,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-09 05:52:52,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-09 05:52:52,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-09 05:52:52,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-09 05:52:52,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-09 05:52:52,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-09 05:52:52,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-09 05:52:52,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-09 05:52:52,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-09 05:52:52,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-09 05:52:52,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-09 05:52:52,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-09 05:52:52,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-03-09 05:52:52,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-03-09 05:52:52,283 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 05:52:52,283 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 05:52:52,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-09 05:52:52,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-09 05:52:52,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-09 05:52:52,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-09 05:52:52,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-09 05:52:52,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-09 05:52:52,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-09 05:52:52,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-09 05:52:52,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-09 05:52:52,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-09 05:52:52,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-09 05:52:52,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-09 05:52:52,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-09 05:52:52,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-09 05:52:52,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-09 05:52:52,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-03-09 05:52:52,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-03-09 05:52:52,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-03-09 05:52:52,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-03-09 05:52:52,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 05:52:52,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 05:52:52,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#0 [2025-03-09 05:52:52,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#1 [2025-03-09 05:52:52,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#2 [2025-03-09 05:52:52,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#3 [2025-03-09 05:52:52,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#4 [2025-03-09 05:52:52,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#5 [2025-03-09 05:52:52,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#6 [2025-03-09 05:52:52,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#7 [2025-03-09 05:52:52,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#8 [2025-03-09 05:52:52,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#9 [2025-03-09 05:52:52,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#10 [2025-03-09 05:52:52,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#11 [2025-03-09 05:52:52,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#12 [2025-03-09 05:52:52,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#13 [2025-03-09 05:52:52,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#14 [2025-03-09 05:52:52,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#15 [2025-03-09 05:52:52,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#16 [2025-03-09 05:52:52,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#17 [2025-03-09 05:52:52,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#18 [2025-03-09 05:52:52,288 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#0 [2025-03-09 05:52:52,288 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#1 [2025-03-09 05:52:52,288 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#2 [2025-03-09 05:52:52,288 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#3 [2025-03-09 05:52:52,288 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#4 [2025-03-09 05:52:52,288 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#5 [2025-03-09 05:52:52,288 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#6 [2025-03-09 05:52:52,288 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#7 [2025-03-09 05:52:52,288 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#8 [2025-03-09 05:52:52,288 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#9 [2025-03-09 05:52:52,288 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#10 [2025-03-09 05:52:52,288 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#11 [2025-03-09 05:52:52,288 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#12 [2025-03-09 05:52:52,288 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#13 [2025-03-09 05:52:52,288 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#14 [2025-03-09 05:52:52,288 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#15 [2025-03-09 05:52:52,288 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#16 [2025-03-09 05:52:52,288 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#17 [2025-03-09 05:52:52,288 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#18 [2025-03-09 05:52:52,288 INFO L130 BoogieDeclarations]: Found specification of procedure xmalloc [2025-03-09 05:52:52,288 INFO L138 BoogieDeclarations]: Found implementation of procedure xmalloc [2025-03-09 05:52:52,288 INFO L130 BoogieDeclarations]: Found specification of procedure getopt [2025-03-09 05:52:52,288 INFO L138 BoogieDeclarations]: Found implementation of procedure getopt [2025-03-09 05:52:52,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-03-09 05:52:52,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-03-09 05:52:52,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-03-09 05:52:52,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-03-09 05:52:52,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-03-09 05:52:52,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-03-09 05:52:52,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-03-09 05:52:52,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-03-09 05:52:52,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2025-03-09 05:52:52,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2025-03-09 05:52:52,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#10 [2025-03-09 05:52:52,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#11 [2025-03-09 05:52:52,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#12 [2025-03-09 05:52:52,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#13 [2025-03-09 05:52:52,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#14 [2025-03-09 05:52:52,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#15 [2025-03-09 05:52:52,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#16 [2025-03-09 05:52:52,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#17 [2025-03-09 05:52:52,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#18 [2025-03-09 05:52:52,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-09 05:52:52,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-09 05:52:52,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-09 05:52:52,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-09 05:52:52,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-09 05:52:52,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-09 05:52:52,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-09 05:52:52,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-09 05:52:52,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-03-09 05:52:52,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-03-09 05:52:52,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-03-09 05:52:52,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-03-09 05:52:52,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-03-09 05:52:52,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-03-09 05:52:52,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-03-09 05:52:52,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-03-09 05:52:52,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-03-09 05:52:52,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#17 [2025-03-09 05:52:52,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#18 [2025-03-09 05:52:52,292 INFO L130 BoogieDeclarations]: Found specification of procedure bb_simple_perror_msg [2025-03-09 05:52:52,292 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_simple_perror_msg [2025-03-09 05:52:52,292 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-09 05:52:52,292 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-09 05:52:52,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 05:52:52,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-09 05:52:52,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-09 05:52:52,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-09 05:52:52,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-09 05:52:52,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-09 05:52:52,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-09 05:52:52,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-09 05:52:52,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-09 05:52:52,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-09 05:52:52,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-09 05:52:52,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-09 05:52:52,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-09 05:52:52,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-09 05:52:52,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-09 05:52:52,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-09 05:52:52,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-03-09 05:52:52,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-03-09 05:52:52,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-03-09 05:52:52,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-03-09 05:52:52,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 05:52:52,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 05:52:52,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 05:52:52,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-09 05:52:52,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-09 05:52:52,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-09 05:52:52,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-09 05:52:52,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-09 05:52:52,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-09 05:52:52,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-09 05:52:52,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-09 05:52:52,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-09 05:52:52,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-09 05:52:52,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-09 05:52:52,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-09 05:52:52,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-09 05:52:52,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-09 05:52:52,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-03-09 05:52:52,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-03-09 05:52:52,293 INFO L130 BoogieDeclarations]: Found specification of procedure xmalloc_fgets [2025-03-09 05:52:52,293 INFO L138 BoogieDeclarations]: Found implementation of procedure xmalloc_fgets [2025-03-09 05:52:52,293 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg_and_die [2025-03-09 05:52:52,293 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg_and_die [2025-03-09 05:52:52,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 05:52:52,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 05:52:52,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 05:52:52,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-09 05:52:52,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-09 05:52:52,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-09 05:52:52,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-09 05:52:52,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-09 05:52:52,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-09 05:52:52,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-09 05:52:52,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-09 05:52:52,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-09 05:52:52,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-09 05:52:52,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-09 05:52:52,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-09 05:52:52,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-09 05:52:52,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-09 05:52:52,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-09 05:52:52,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-09 05:52:52,725 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 05:52:52,727 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 05:52:52,908 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2863: havoc #t~nondet150; [2025-03-09 05:52:53,307 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2773: call ULTIMATE.dealloc(~#i~0#1.base, ~#i~0#1.offset);havoc ~#i~0#1.base, ~#i~0#1.offset; [2025-03-09 05:52:57,939 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2420: havoc fclose_if_not_stdin_#t~bitwise80#1; [2025-03-09 05:52:57,939 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2492: call ULTIMATE.dealloc(__main_~#negative_N~0#1.base, __main_~#negative_N~0#1.offset);havoc __main_~#negative_N~0#1.base, __main_~#negative_N~0#1.offset; [2025-03-09 05:52:58,071 INFO L? ?]: Removed 600 outVars from TransFormulas that were not future-live. [2025-03-09 05:52:58,071 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 05:52:58,097 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 05:52:58,097 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 05:52:58,098 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 05:52:58 BoogieIcfgContainer [2025-03-09 05:52:58,098 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 05:52:58,102 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 05:52:58,102 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 05:52:58,105 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 05:52:58,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 05:52:50" (1/3) ... [2025-03-09 05:52:58,105 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e43193a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 05:52:58, skipping insertion in model container [2025-03-09 05:52:58,106 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:52:51" (2/3) ... [2025-03-09 05:52:58,106 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e43193a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 05:52:58, skipping insertion in model container [2025-03-09 05:52:58,106 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 05:52:58" (3/3) ... [2025-03-09 05:52:58,107 INFO L128 eAbstractionObserver]: Analyzing ICFG head-3.i [2025-03-09 05:52:58,117 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 05:52:58,121 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG head-3.i that has 48 procedures, 533 locations, 1 initial locations, 41 loop locations, and 54 error locations. [2025-03-09 05:52:58,171 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 05:52:58,182 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;@3adf5eed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 05:52:58,183 INFO L334 AbstractCegarLoop]: Starting to check reachability of 54 error locations. [2025-03-09 05:52:58,186 INFO L276 IsEmpty]: Start isEmpty. Operand has 392 states, 297 states have (on average 1.595959595959596) internal successors, (474), 354 states have internal predecessors, (474), 29 states have call successors, (29), 12 states have call predecessors, (29), 12 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-09 05:52:58,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-09 05:52:58,189 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:52:58,190 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-09 05:52:58,190 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-03-09 05:52:58,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:52:58,193 INFO L85 PathProgramCache]: Analyzing trace with hash 25549695, now seen corresponding path program 1 times [2025-03-09 05:52:58,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:52:58,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860772288] [2025-03-09 05:52:58,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:52:58,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:52:58,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 05:52:59,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 05:52:59,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:52:59,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:52:59,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 05:52:59,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:52:59,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860772288] [2025-03-09 05:52:59,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860772288] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:52:59,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:52:59,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:52:59,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591718823] [2025-03-09 05:52:59,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:52:59,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:52:59,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:52:59,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:52:59,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:52:59,416 INFO L87 Difference]: Start difference. First operand has 392 states, 297 states have (on average 1.595959595959596) internal successors, (474), 354 states have internal predecessors, (474), 29 states have call successors, (29), 12 states have call predecessors, (29), 12 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 05:52:59,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:52:59,521 INFO L93 Difference]: Finished difference Result 656 states and 925 transitions. [2025-03-09 05:52:59,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:52:59,524 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2025-03-09 05:52:59,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:52:59,531 INFO L225 Difference]: With dead ends: 656 [2025-03-09 05:52:59,532 INFO L226 Difference]: Without dead ends: 268 [2025-03-09 05:52:59,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:52:59,537 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 1 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:52:59,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 694 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:52:59,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2025-03-09 05:52:59,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2025-03-09 05:52:59,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 215 states have (on average 1.4651162790697674) internal successors, (315), 241 states have internal predecessors, (315), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-09 05:52:59,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 355 transitions. [2025-03-09 05:52:59,583 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 355 transitions. Word has length 4 [2025-03-09 05:52:59,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:52:59,584 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 355 transitions. [2025-03-09 05:52:59,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 05:52:59,584 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 355 transitions. [2025-03-09 05:52:59,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-09 05:52:59,585 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:52:59,585 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-09 05:52:59,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 05:52:59,585 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-03-09 05:52:59,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:52:59,586 INFO L85 PathProgramCache]: Analyzing trace with hash 942511131, now seen corresponding path program 1 times [2025-03-09 05:52:59,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:52:59,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947319958] [2025-03-09 05:52:59,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:52:59,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:53:00,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 05:53:00,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 05:53:00,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:53:00,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:53:00,336 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 05:53:00,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:53:00,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947319958] [2025-03-09 05:53:00,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947319958] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:53:00,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [394729953] [2025-03-09 05:53:00,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:53:00,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:53:00,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:53:00,339 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:53:00,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 05:53:01,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 05:53:01,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 05:53:01,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:53:01,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:53:01,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 1664 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:53:01,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:53:01,333 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 05:53:01,333 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:53:01,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [394729953] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:53:01,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 05:53:01,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-09 05:53:01,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663836904] [2025-03-09 05:53:01,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:53:01,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 05:53:01,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:53:01,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 05:53:01,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:53:01,335 INFO L87 Difference]: Start difference. First operand 268 states and 355 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 05:53:01,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:53:01,424 INFO L93 Difference]: Finished difference Result 268 states and 355 transitions. [2025-03-09 05:53:01,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 05:53:01,424 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-09 05:53:01,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:53:01,426 INFO L225 Difference]: With dead ends: 268 [2025-03-09 05:53:01,426 INFO L226 Difference]: Without dead ends: 267 [2025-03-09 05:53:01,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:53:01,427 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 1 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:53:01,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 689 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:53:01,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-03-09 05:53:01,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2025-03-09 05:53:01,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 215 states have (on average 1.4604651162790698) internal successors, (314), 240 states have internal predecessors, (314), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-09 05:53:01,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 354 transitions. [2025-03-09 05:53:01,438 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 354 transitions. Word has length 7 [2025-03-09 05:53:01,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:53:01,438 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 354 transitions. [2025-03-09 05:53:01,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 05:53:01,438 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 354 transitions. [2025-03-09 05:53:01,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 05:53:01,439 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:53:01,439 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-03-09 05:53:01,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 05:53:01,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:53:01,643 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-03-09 05:53:01,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:53:01,643 INFO L85 PathProgramCache]: Analyzing trace with hash -846925247, now seen corresponding path program 1 times [2025-03-09 05:53:01,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:53:01,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998706961] [2025-03-09 05:53:01,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:53:01,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:53:02,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 05:53:02,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 05:53:02,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:53:02,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:53:02,280 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 05:53:02,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:53:02,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998706961] [2025-03-09 05:53:02,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998706961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:53:02,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:53:02,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:53:02,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792578955] [2025-03-09 05:53:02,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:53:02,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:53:02,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:53:02,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:53:02,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:53:02,281 INFO L87 Difference]: Start difference. First operand 267 states and 354 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 05:53:02,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:53:02,318 INFO L93 Difference]: Finished difference Result 267 states and 354 transitions. [2025-03-09 05:53:02,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:53:02,322 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2025-03-09 05:53:02,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:53:02,323 INFO L225 Difference]: With dead ends: 267 [2025-03-09 05:53:02,323 INFO L226 Difference]: Without dead ends: 266 [2025-03-09 05:53:02,323 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:53:02,324 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 0 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:53:02,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 690 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:53:02,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-03-09 05:53:02,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 264. [2025-03-09 05:53:02,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 213 states have (on average 1.460093896713615) internal successors, (311), 237 states have internal predecessors, (311), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-09 05:53:02,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 351 transitions. [2025-03-09 05:53:02,342 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 351 transitions. Word has length 8 [2025-03-09 05:53:02,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:53:02,342 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 351 transitions. [2025-03-09 05:53:02,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 05:53:02,342 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 351 transitions. [2025-03-09 05:53:02,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-09 05:53:02,343 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:53:02,343 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:53:02,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 05:53:02,343 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-03-09 05:53:02,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:53:02,343 INFO L85 PathProgramCache]: Analyzing trace with hash -100986760, now seen corresponding path program 1 times [2025-03-09 05:53:02,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:53:02,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282577444] [2025-03-09 05:53:02,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:53:02,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:53:02,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 05:53:02,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 05:53:02,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:53:02,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:53:02,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 05:53:02,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:53:02,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282577444] [2025-03-09 05:53:02,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282577444] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:53:02,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392649218] [2025-03-09 05:53:02,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:53:02,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:53:02,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:53:02,986 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:53:02,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 05:53:03,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 05:53:03,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 05:53:03,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:53:03,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:53:03,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 1681 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 05:53:03,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:53:04,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 05:53:04,002 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:53:04,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392649218] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:53:04,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 05:53:04,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-09 05:53:04,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864586271] [2025-03-09 05:53:04,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:53:04,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:53:04,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:53:04,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:53:04,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:53:04,004 INFO L87 Difference]: Start difference. First operand 264 states and 351 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:53:04,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:53:04,054 INFO L93 Difference]: Finished difference Result 264 states and 351 transitions. [2025-03-09 05:53:04,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:53:04,055 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2025-03-09 05:53:04,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:53:04,057 INFO L225 Difference]: With dead ends: 264 [2025-03-09 05:53:04,057 INFO L226 Difference]: Without dead ends: 262 [2025-03-09 05:53:04,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:53:04,058 INFO L435 NwaCegarLoop]: 339 mSDtfsCounter, 204 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:53:04,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 468 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:53:04,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2025-03-09 05:53:04,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 262. [2025-03-09 05:53:04,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 213 states have (on average 1.4507042253521127) internal successors, (309), 235 states have internal predecessors, (309), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-09 05:53:04,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 349 transitions. [2025-03-09 05:53:04,074 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 349 transitions. Word has length 12 [2025-03-09 05:53:04,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:53:04,076 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 349 transitions. [2025-03-09 05:53:04,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:53:04,076 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 349 transitions. [2025-03-09 05:53:04,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-09 05:53:04,076 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:53:04,076 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:53:04,086 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 05:53:04,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-09 05:53:04,277 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-03-09 05:53:04,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:53:04,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1164378494, now seen corresponding path program 1 times [2025-03-09 05:53:04,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:53:04,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299049769] [2025-03-09 05:53:04,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:53:04,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:53:04,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 05:53:04,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 05:53:04,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:53:04,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:53:04,900 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 05:53:04,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:53:04,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299049769] [2025-03-09 05:53:04,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299049769] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:53:04,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751704765] [2025-03-09 05:53:04,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:53:04,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:53:04,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:53:04,904 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:53:04,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 05:53:05,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 05:53:05,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 05:53:05,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:53:05,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:53:05,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 1682 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:53:05,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:53:05,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 05:53:05,845 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:53:05,932 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 05:53:05,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [751704765] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:53:05,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 05:53:05,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-09 05:53:05,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91226109] [2025-03-09 05:53:05,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 05:53:05,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 05:53:05,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:53:05,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 05:53:05,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:53:05,933 INFO L87 Difference]: Start difference. First operand 262 states and 349 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 05:53:06,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:53:06,027 INFO L93 Difference]: Finished difference Result 527 states and 703 transitions. [2025-03-09 05:53:06,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 05:53:06,028 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 13 [2025-03-09 05:53:06,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:53:06,029 INFO L225 Difference]: With dead ends: 527 [2025-03-09 05:53:06,030 INFO L226 Difference]: Without dead ends: 271 [2025-03-09 05:53:06,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:53:06,031 INFO L435 NwaCegarLoop]: 344 mSDtfsCounter, 4 mSDsluCounter, 1026 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1370 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:53:06,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1370 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:53:06,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2025-03-09 05:53:06,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2025-03-09 05:53:06,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 222 states have (on average 1.4324324324324325) internal successors, (318), 244 states have internal predecessors, (318), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-09 05:53:06,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 358 transitions. [2025-03-09 05:53:06,043 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 358 transitions. Word has length 13 [2025-03-09 05:53:06,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:53:06,043 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 358 transitions. [2025-03-09 05:53:06,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 05:53:06,043 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 358 transitions. [2025-03-09 05:53:06,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-09 05:53:06,044 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:53:06,044 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:53:06,057 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 05:53:06,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:53:06,244 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-03-09 05:53:06,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:53:06,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1278173922, now seen corresponding path program 2 times [2025-03-09 05:53:06,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:53:06,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557297434] [2025-03-09 05:53:06,245 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 05:53:06,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:53:06,635 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-09 05:53:06,672 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 22 statements. [2025-03-09 05:53:06,672 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 05:53:06,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:53:07,033 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-09 05:53:07,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:53:07,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557297434] [2025-03-09 05:53:07,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557297434] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:53:07,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:53:07,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 05:53:07,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106531421] [2025-03-09 05:53:07,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:53:07,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 05:53:07,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:53:07,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 05:53:07,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:53:07,035 INFO L87 Difference]: Start difference. First operand 271 states and 358 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:53:07,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:53:07,212 INFO L93 Difference]: Finished difference Result 271 states and 358 transitions. [2025-03-09 05:53:07,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 05:53:07,213 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2025-03-09 05:53:07,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:53:07,214 INFO L225 Difference]: With dead ends: 271 [2025-03-09 05:53:07,214 INFO L226 Difference]: Without dead ends: 269 [2025-03-09 05:53:07,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:53:07,215 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 203 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 1128 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 05:53:07,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 1128 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 05:53:07,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2025-03-09 05:53:07,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2025-03-09 05:53:07,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 222 states have (on average 1.4234234234234233) internal successors, (316), 242 states have internal predecessors, (316), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-09 05:53:07,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 356 transitions. [2025-03-09 05:53:07,223 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 356 transitions. Word has length 22 [2025-03-09 05:53:07,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:53:07,224 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 356 transitions. [2025-03-09 05:53:07,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:53:07,224 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 356 transitions. [2025-03-09 05:53:07,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-09 05:53:07,224 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:53:07,224 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:53:07,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 05:53:07,225 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-03-09 05:53:07,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:53:07,225 INFO L85 PathProgramCache]: Analyzing trace with hash -523982033, now seen corresponding path program 1 times [2025-03-09 05:53:07,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:53:07,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151598261] [2025-03-09 05:53:07,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:53:07,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:53:07,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 05:53:07,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 05:53:07,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:53:07,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:53:07,885 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-09 05:53:07,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:53:07,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151598261] [2025-03-09 05:53:07,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151598261] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:53:07,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:53:07,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 05:53:07,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583765617] [2025-03-09 05:53:07,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:53:07,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:53:07,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:53:07,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:53:07,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:53:07,886 INFO L87 Difference]: Start difference. First operand 269 states and 356 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:53:07,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:53:07,957 INFO L93 Difference]: Finished difference Result 521 states and 696 transitions. [2025-03-09 05:53:07,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:53:07,958 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2025-03-09 05:53:07,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:53:07,960 INFO L225 Difference]: With dead ends: 521 [2025-03-09 05:53:07,962 INFO L226 Difference]: Without dead ends: 272 [2025-03-09 05:53:07,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:53:07,963 INFO L435 NwaCegarLoop]: 342 mSDtfsCounter, 2 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:53:07,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 679 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:53:07,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2025-03-09 05:53:07,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2025-03-09 05:53:07,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 225 states have (on average 1.4177777777777778) internal successors, (319), 245 states have internal predecessors, (319), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-09 05:53:07,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 359 transitions. [2025-03-09 05:53:07,979 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 359 transitions. Word has length 27 [2025-03-09 05:53:07,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:53:07,979 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 359 transitions. [2025-03-09 05:53:07,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:53:07,979 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 359 transitions. [2025-03-09 05:53:07,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-09 05:53:07,979 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:53:07,980 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:53:07,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 05:53:07,980 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-03-09 05:53:07,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:53:07,980 INFO L85 PathProgramCache]: Analyzing trace with hash -2032082149, now seen corresponding path program 1 times [2025-03-09 05:53:07,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:53:07,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879439384] [2025-03-09 05:53:07,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:53:07,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:53:08,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 05:53:08,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 05:53:08,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:53:08,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:53:08,576 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-09 05:53:08,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:53:08,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879439384] [2025-03-09 05:53:08,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879439384] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:53:08,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:53:08,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:53:08,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724642488] [2025-03-09 05:53:08,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:53:08,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:53:08,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:53:08,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:53:08,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:53:08,579 INFO L87 Difference]: Start difference. First operand 272 states and 359 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:53:08,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:53:08,643 INFO L93 Difference]: Finished difference Result 285 states and 374 transitions. [2025-03-09 05:53:08,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:53:08,643 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2025-03-09 05:53:08,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:53:08,645 INFO L225 Difference]: With dead ends: 285 [2025-03-09 05:53:08,645 INFO L226 Difference]: Without dead ends: 283 [2025-03-09 05:53:08,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:53:08,645 INFO L435 NwaCegarLoop]: 340 mSDtfsCounter, 3 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:53:08,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 676 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:53:08,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2025-03-09 05:53:08,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 281. [2025-03-09 05:53:08,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 234 states have (on average 1.4188034188034189) internal successors, (332), 254 states have internal predecessors, (332), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-09 05:53:08,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 372 transitions. [2025-03-09 05:53:08,655 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 372 transitions. Word has length 30 [2025-03-09 05:53:08,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:53:08,655 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 372 transitions. [2025-03-09 05:53:08,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:53:08,656 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 372 transitions. [2025-03-09 05:53:08,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-09 05:53:08,656 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:53:08,656 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:53:08,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 05:53:08,656 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-03-09 05:53:08,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:53:08,657 INFO L85 PathProgramCache]: Analyzing trace with hash -2032081989, now seen corresponding path program 1 times [2025-03-09 05:53:08,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:53:08,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754714400] [2025-03-09 05:53:08,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:53:08,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:53:09,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 05:53:09,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 05:53:09,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:53:09,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:53:09,302 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-09 05:53:09,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:53:09,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754714400] [2025-03-09 05:53:09,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754714400] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:53:09,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539422083] [2025-03-09 05:53:09,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:53:09,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:53:09,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:53:09,305 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:53:09,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 05:53:10,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 05:53:10,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 05:53:10,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:53:10,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:53:10,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 1871 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 05:53:10,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:53:10,466 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 05:53:10,466 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:53:10,633 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 05:53:10,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1539422083] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:53:10,634 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 05:53:10,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-03-09 05:53:10,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305497089] [2025-03-09 05:53:10,634 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 05:53:10,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 05:53:10,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:53:10,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 05:53:10,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-09 05:53:10,635 INFO L87 Difference]: Start difference. First operand 281 states and 372 transitions. Second operand has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 05:53:10,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:53:10,952 INFO L93 Difference]: Finished difference Result 564 states and 752 transitions. [2025-03-09 05:53:10,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 05:53:10,953 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2025-03-09 05:53:10,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:53:10,954 INFO L225 Difference]: With dead ends: 564 [2025-03-09 05:53:10,954 INFO L226 Difference]: Without dead ends: 298 [2025-03-09 05:53:10,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-09 05:53:10,955 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 5 mSDsluCounter, 2004 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2340 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 05:53:10,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2340 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 05:53:10,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2025-03-09 05:53:10,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2025-03-09 05:53:10,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 252 states have (on average 1.380952380952381) internal successors, (348), 271 states have internal predecessors, (348), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-09 05:53:10,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 388 transitions. [2025-03-09 05:53:10,963 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 388 transitions. Word has length 30 [2025-03-09 05:53:10,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:53:10,964 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 388 transitions. [2025-03-09 05:53:10,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 05:53:10,964 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 388 transitions. [2025-03-09 05:53:10,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-09 05:53:10,965 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:53:10,965 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:53:10,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-09 05:53:11,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:53:11,166 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-03-09 05:53:11,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:53:11,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1631962897, now seen corresponding path program 1 times [2025-03-09 05:53:11,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:53:11,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354164905] [2025-03-09 05:53:11,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:53:11,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:53:11,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-09 05:53:11,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-09 05:53:11,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:53:11,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:53:11,714 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-03-09 05:53:11,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:53:11,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354164905] [2025-03-09 05:53:11,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354164905] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:53:11,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:53:11,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:53:11,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144900959] [2025-03-09 05:53:11,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:53:11,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:53:11,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:53:11,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:53:11,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:53:11,715 INFO L87 Difference]: Start difference. First operand 298 states and 388 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:53:11,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:53:11,752 INFO L93 Difference]: Finished difference Result 298 states and 388 transitions. [2025-03-09 05:53:11,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:53:11,753 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2025-03-09 05:53:11,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:53:11,754 INFO L225 Difference]: With dead ends: 298 [2025-03-09 05:53:11,754 INFO L226 Difference]: Without dead ends: 297 [2025-03-09 05:53:11,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:53:11,755 INFO L435 NwaCegarLoop]: 340 mSDtfsCounter, 0 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:53:11,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 677 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:53:11,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2025-03-09 05:53:11,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 293. [2025-03-09 05:53:11,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 248 states have (on average 1.3790322580645162) internal successors, (342), 266 states have internal predecessors, (342), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-09 05:53:11,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 382 transitions. [2025-03-09 05:53:11,769 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 382 transitions. Word has length 49 [2025-03-09 05:53:11,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:53:11,770 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 382 transitions. [2025-03-09 05:53:11,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:53:11,770 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 382 transitions. [2025-03-09 05:53:11,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-09 05:53:11,772 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:53:11,773 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:53:11,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 05:53:11,773 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-03-09 05:53:11,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:53:11,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1211742527, now seen corresponding path program 1 times [2025-03-09 05:53:11,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:53:11,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077243540] [2025-03-09 05:53:11,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:53:11,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:53:12,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-09 05:53:12,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-09 05:53:12,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:53:12,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:53:12,462 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 05:53:12,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:53:12,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077243540] [2025-03-09 05:53:12,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077243540] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:53:12,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:53:12,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 05:53:12,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100227222] [2025-03-09 05:53:12,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:53:12,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 05:53:12,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:53:12,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 05:53:12,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:53:12,463 INFO L87 Difference]: Start difference. First operand 293 states and 382 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 05:53:14,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:53:14,053 INFO L93 Difference]: Finished difference Result 798 states and 1074 transitions. [2025-03-09 05:53:14,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 05:53:14,053 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 55 [2025-03-09 05:53:14,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:53:14,059 INFO L225 Difference]: With dead ends: 798 [2025-03-09 05:53:14,059 INFO L226 Difference]: Without dead ends: 564 [2025-03-09 05:53:14,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:53:14,060 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 543 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-09 05:53:14,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [558 Valid, 937 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-09 05:53:14,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2025-03-09 05:53:14,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 389. [2025-03-09 05:53:14,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 337 states have (on average 1.4124629080118694) internal successors, (476), 357 states have internal predecessors, (476), 26 states have call successors, (26), 12 states have call predecessors, (26), 13 states have return successors, (23), 20 states have call predecessors, (23), 20 states have call successors, (23) [2025-03-09 05:53:14,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 525 transitions. [2025-03-09 05:53:14,075 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 525 transitions. Word has length 55 [2025-03-09 05:53:14,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:53:14,075 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 525 transitions. [2025-03-09 05:53:14,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 05:53:14,076 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 525 transitions. [2025-03-09 05:53:14,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-09 05:53:14,076 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:53:14,076 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:53:14,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 05:53:14,077 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-03-09 05:53:14,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:53:14,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1275770306, now seen corresponding path program 1 times [2025-03-09 05:53:14,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:53:14,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344395440] [2025-03-09 05:53:14,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:53:14,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:53:14,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-09 05:53:14,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-09 05:53:14,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:53:14,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:53:15,044 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 05:53:15,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:53:15,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344395440] [2025-03-09 05:53:15,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344395440] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:53:15,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:53:15,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 05:53:15,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608971496] [2025-03-09 05:53:15,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:53:15,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 05:53:15,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:53:15,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 05:53:15,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 05:53:15,045 INFO L87 Difference]: Start difference. First operand 389 states and 525 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 05:53:15,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:53:15,511 INFO L93 Difference]: Finished difference Result 506 states and 699 transitions. [2025-03-09 05:53:15,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 05:53:15,512 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 55 [2025-03-09 05:53:15,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:53:15,514 INFO L225 Difference]: With dead ends: 506 [2025-03-09 05:53:15,515 INFO L226 Difference]: Without dead ends: 505 [2025-03-09 05:53:15,516 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-09 05:53:15,516 INFO L435 NwaCegarLoop]: 330 mSDtfsCounter, 108 mSDsluCounter, 1244 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 1574 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 05:53:15,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 1574 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 05:53:15,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2025-03-09 05:53:15,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 488. [2025-03-09 05:53:15,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 430 states have (on average 1.4348837209302325) internal successors, (617), 452 states have internal predecessors, (617), 28 states have call successors, (28), 14 states have call predecessors, (28), 17 states have return successors, (34), 22 states have call predecessors, (34), 22 states have call successors, (34) [2025-03-09 05:53:15,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 679 transitions. [2025-03-09 05:53:15,537 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 679 transitions. Word has length 55 [2025-03-09 05:53:15,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:53:15,538 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 679 transitions. [2025-03-09 05:53:15,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 05:53:15,538 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 679 transitions. [2025-03-09 05:53:15,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-09 05:53:15,540 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:53:15,540 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:53:15,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 05:53:15,540 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-03-09 05:53:15,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:53:15,540 INFO L85 PathProgramCache]: Analyzing trace with hash -2131693309, now seen corresponding path program 1 times [2025-03-09 05:53:15,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:53:15,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998320585] [2025-03-09 05:53:15,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:53:15,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:53:15,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-09 05:53:16,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-09 05:53:16,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:53:16,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:53:16,417 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 05:53:16,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:53:16,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998320585] [2025-03-09 05:53:16,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998320585] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:53:16,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:53:16,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 05:53:16,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257182025] [2025-03-09 05:53:16,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:53:16,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 05:53:16,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:53:16,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 05:53:16,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 05:53:16,418 INFO L87 Difference]: Start difference. First operand 488 states and 679 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 05:53:16,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:53:16,649 INFO L93 Difference]: Finished difference Result 922 states and 1298 transitions. [2025-03-09 05:53:16,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 05:53:16,650 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 55 [2025-03-09 05:53:16,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:53:16,652 INFO L225 Difference]: With dead ends: 922 [2025-03-09 05:53:16,652 INFO L226 Difference]: Without dead ends: 488 [2025-03-09 05:53:16,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 05:53:16,654 INFO L435 NwaCegarLoop]: 331 mSDtfsCounter, 211 mSDsluCounter, 972 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 1303 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 05:53:16,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 1303 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 05:53:16,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2025-03-09 05:53:16,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 488. [2025-03-09 05:53:16,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 430 states have (on average 1.4325581395348836) internal successors, (616), 452 states have internal predecessors, (616), 28 states have call successors, (28), 14 states have call predecessors, (28), 17 states have return successors, (34), 22 states have call predecessors, (34), 22 states have call successors, (34) [2025-03-09 05:53:16,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 678 transitions. [2025-03-09 05:53:16,667 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 678 transitions. Word has length 55 [2025-03-09 05:53:16,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:53:16,667 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 678 transitions. [2025-03-09 05:53:16,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 05:53:16,668 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 678 transitions. [2025-03-09 05:53:16,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-09 05:53:16,668 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:53:16,668 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:53:16,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 05:53:16,668 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-03-09 05:53:16,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:53:16,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1331281127, now seen corresponding path program 1 times [2025-03-09 05:53:16,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:53:16,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300993196] [2025-03-09 05:53:16,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:53:16,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:53:17,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-09 05:53:17,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-09 05:53:17,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:53:17,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:53:17,360 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-09 05:53:17,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:53:17,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300993196] [2025-03-09 05:53:17,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300993196] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:53:17,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352899203] [2025-03-09 05:53:17,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:53:17,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:53:17,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:53:17,362 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:53:17,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 05:53:18,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-09 05:53:18,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-09 05:53:18,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:53:18,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:53:18,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 2044 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:53:18,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:53:18,469 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-09 05:53:18,470 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:53:18,566 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-09 05:53:18,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352899203] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:53:18,566 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 05:53:18,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-09 05:53:18,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839765528] [2025-03-09 05:53:18,566 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 05:53:18,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 05:53:18,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:53:18,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 05:53:18,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:53:18,567 INFO L87 Difference]: Start difference. First operand 488 states and 678 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:53:18,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:53:18,679 INFO L93 Difference]: Finished difference Result 951 states and 1334 transitions. [2025-03-09 05:53:18,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 05:53:18,680 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2025-03-09 05:53:18,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:53:18,682 INFO L225 Difference]: With dead ends: 951 [2025-03-09 05:53:18,683 INFO L226 Difference]: Without dead ends: 506 [2025-03-09 05:53:18,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:53:18,684 INFO L435 NwaCegarLoop]: 340 mSDtfsCounter, 4 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1014 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:53:18,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1014 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:53:18,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2025-03-09 05:53:18,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 506. [2025-03-09 05:53:18,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 448 states have (on average 1.4151785714285714) internal successors, (634), 470 states have internal predecessors, (634), 28 states have call successors, (28), 14 states have call predecessors, (28), 17 states have return successors, (34), 22 states have call predecessors, (34), 22 states have call successors, (34) [2025-03-09 05:53:18,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 696 transitions. [2025-03-09 05:53:18,700 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 696 transitions. Word has length 55 [2025-03-09 05:53:18,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:53:18,701 INFO L471 AbstractCegarLoop]: Abstraction has 506 states and 696 transitions. [2025-03-09 05:53:18,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:53:18,701 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 696 transitions. [2025-03-09 05:53:18,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-09 05:53:18,701 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:53:18,702 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:53:18,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-09 05:53:18,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-09 05:53:18,902 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-03-09 05:53:18,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:53:18,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1093656651, now seen corresponding path program 1 times [2025-03-09 05:53:18,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:53:18,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395443684] [2025-03-09 05:53:18,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:53:18,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:53:19,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-09 05:53:19,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-09 05:53:19,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:53:19,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:53:19,743 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 05:53:19,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:53:19,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395443684] [2025-03-09 05:53:19,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395443684] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:53:19,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935143561] [2025-03-09 05:53:19,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:53:19,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:53:19,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:53:19,746 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:53:19,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 05:53:20,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-09 05:53:20,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-09 05:53:20,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:53:20,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:53:20,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 2131 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 05:53:20,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:53:20,949 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 05:53:20,949 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:53:21,240 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 05:53:21,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [935143561] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:53:21,240 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 05:53:21,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-09 05:53:21,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746145653] [2025-03-09 05:53:21,241 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 05:53:21,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 05:53:21,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:53:21,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 05:53:21,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-09 05:53:21,241 INFO L87 Difference]: Start difference. First operand 506 states and 696 transitions. Second operand has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 states have internal predecessors, (64), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 05:53:21,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:53:21,328 INFO L93 Difference]: Finished difference Result 996 states and 1385 transitions. [2025-03-09 05:53:21,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 05:53:21,329 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 states have internal predecessors, (64), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 71 [2025-03-09 05:53:21,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:53:21,331 INFO L225 Difference]: With dead ends: 996 [2025-03-09 05:53:21,331 INFO L226 Difference]: Without dead ends: 542 [2025-03-09 05:53:21,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-09 05:53:21,333 INFO L435 NwaCegarLoop]: 340 mSDtfsCounter, 4 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:53:21,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 677 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:53:21,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2025-03-09 05:53:21,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 542. [2025-03-09 05:53:21,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 484 states have (on average 1.384297520661157) internal successors, (670), 506 states have internal predecessors, (670), 28 states have call successors, (28), 14 states have call predecessors, (28), 17 states have return successors, (34), 22 states have call predecessors, (34), 22 states have call successors, (34) [2025-03-09 05:53:21,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 732 transitions. [2025-03-09 05:53:21,348 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 732 transitions. Word has length 71 [2025-03-09 05:53:21,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:53:21,349 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 732 transitions. [2025-03-09 05:53:21,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 states have internal predecessors, (64), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 05:53:21,349 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 732 transitions. [2025-03-09 05:53:21,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-09 05:53:21,349 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:53:21,349 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:53:21,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-09 05:53:21,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-09 05:53:21,550 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-03-09 05:53:21,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:53:21,551 INFO L85 PathProgramCache]: Analyzing trace with hash -74286645, now seen corresponding path program 2 times [2025-03-09 05:53:21,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:53:21,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368052515] [2025-03-09 05:53:21,551 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 05:53:21,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:53:21,962 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 89 statements into 2 equivalence classes. [2025-03-09 05:53:22,023 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 89 statements. [2025-03-09 05:53:22,023 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 05:53:22,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:53:22,742 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-09 05:53:22,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:53:22,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368052515] [2025-03-09 05:53:22,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368052515] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:53:22,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:53:22,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 05:53:22,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888732827] [2025-03-09 05:53:22,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:53:22,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 05:53:22,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:53:22,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 05:53:22,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 05:53:22,745 INFO L87 Difference]: Start difference. First operand 542 states and 732 transitions. Second operand has 8 states, 6 states have (on average 5.166666666666667) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 05:53:25,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:53:25,247 INFO L93 Difference]: Finished difference Result 807 states and 1102 transitions. [2025-03-09 05:53:25,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 05:53:25,248 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 5.166666666666667) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 89 [2025-03-09 05:53:25,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:53:25,251 INFO L225 Difference]: With dead ends: 807 [2025-03-09 05:53:25,252 INFO L226 Difference]: Without dead ends: 806 [2025-03-09 05:53:25,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-03-09 05:53:25,253 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 867 mSDsluCounter, 1026 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 882 SdHoareTripleChecker+Valid, 1259 SdHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-09 05:53:25,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [882 Valid, 1259 Invalid, 730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-09 05:53:25,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2025-03-09 05:53:25,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 729. [2025-03-09 05:53:25,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 650 states have (on average 1.4) internal successors, (910), 673 states have internal predecessors, (910), 43 states have call successors, (43), 20 states have call predecessors, (43), 23 states have return successors, (50), 37 states have call predecessors, (50), 37 states have call successors, (50) [2025-03-09 05:53:25,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 1003 transitions. [2025-03-09 05:53:25,282 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 1003 transitions. Word has length 89 [2025-03-09 05:53:25,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:53:25,282 INFO L471 AbstractCegarLoop]: Abstraction has 729 states and 1003 transitions. [2025-03-09 05:53:25,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 5.166666666666667) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 05:53:25,282 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 1003 transitions. [2025-03-09 05:53:25,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-09 05:53:25,285 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:53:25,285 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:53:25,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-09 05:53:25,285 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-03-09 05:53:25,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:53:25,286 INFO L85 PathProgramCache]: Analyzing trace with hash 249271598, now seen corresponding path program 1 times [2025-03-09 05:53:25,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:53:25,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135098500] [2025-03-09 05:53:25,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:53:25,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:53:25,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-09 05:53:25,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-09 05:53:25,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:53:25,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:53:26,938 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2025-03-09 05:53:26,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:53:26,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135098500] [2025-03-09 05:53:26,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135098500] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:53:26,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754110338] [2025-03-09 05:53:26,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:53:26,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:53:26,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:53:26,940 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:53:26,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 05:53:27,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-09 05:53:28,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-09 05:53:28,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:53:28,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:53:28,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 2277 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 05:53:28,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:53:28,991 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2025-03-09 05:53:28,991 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:53:29,803 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2025-03-09 05:53:29,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754110338] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:53:29,803 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 05:53:29,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2025-03-09 05:53:29,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363013039] [2025-03-09 05:53:29,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 05:53:29,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-09 05:53:29,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:53:29,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-09 05:53:29,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2025-03-09 05:53:29,805 INFO L87 Difference]: Start difference. First operand 729 states and 1003 transitions. Second operand has 25 states, 25 states have (on average 2.84) internal successors, (71), 22 states have internal predecessors, (71), 5 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-09 05:53:33,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:53:33,973 INFO L93 Difference]: Finished difference Result 1354 states and 1861 transitions. [2025-03-09 05:53:33,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-09 05:53:33,973 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.84) internal successors, (71), 22 states have internal predecessors, (71), 5 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Word has length 90 [2025-03-09 05:53:33,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:53:33,976 INFO L225 Difference]: With dead ends: 1354 [2025-03-09 05:53:33,977 INFO L226 Difference]: Without dead ends: 737 [2025-03-09 05:53:33,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 166 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=263, Invalid=1069, Unknown=0, NotChecked=0, Total=1332 [2025-03-09 05:53:33,978 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 1344 mSDsluCounter, 3043 mSDsCounter, 0 mSdLazyCounter, 1830 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1362 SdHoareTripleChecker+Valid, 3270 SdHoareTripleChecker+Invalid, 2001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 1830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-03-09 05:53:33,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1362 Valid, 3270 Invalid, 2001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 1830 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-03-09 05:53:33,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2025-03-09 05:53:33,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 707. [2025-03-09 05:53:33,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 625 states have (on average 1.3552) internal successors, (847), 650 states have internal predecessors, (847), 47 states have call successors, (47), 23 states have call predecessors, (47), 24 states have return successors, (41), 35 states have call predecessors, (41), 35 states have call successors, (41) [2025-03-09 05:53:33,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 935 transitions. [2025-03-09 05:53:34,000 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 935 transitions. Word has length 90 [2025-03-09 05:53:34,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:53:34,000 INFO L471 AbstractCegarLoop]: Abstraction has 707 states and 935 transitions. [2025-03-09 05:53:34,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.84) internal successors, (71), 22 states have internal predecessors, (71), 5 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-09 05:53:34,020 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 935 transitions. [2025-03-09 05:53:34,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-09 05:53:34,021 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:53:34,021 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 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] [2025-03-09 05:53:34,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-09 05:53:34,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:53:34,222 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-03-09 05:53:34,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:53:34,223 INFO L85 PathProgramCache]: Analyzing trace with hash -877303811, now seen corresponding path program 1 times [2025-03-09 05:53:34,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:53:34,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743498349] [2025-03-09 05:53:34,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:53:34,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:53:34,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-09 05:53:34,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-09 05:53:34,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:53:34,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:53:35,077 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2025-03-09 05:53:35,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:53:35,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743498349] [2025-03-09 05:53:35,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743498349] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:53:35,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:53:35,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 05:53:35,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501624805] [2025-03-09 05:53:35,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:53:35,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 05:53:35,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:53:35,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 05:53:35,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 05:53:35,079 INFO L87 Difference]: Start difference. First operand 707 states and 935 transitions. Second operand has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 05:53:35,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:53:35,486 INFO L93 Difference]: Finished difference Result 1010 states and 1344 transitions. [2025-03-09 05:53:35,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 05:53:35,487 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 101 [2025-03-09 05:53:35,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:53:35,490 INFO L225 Difference]: With dead ends: 1010 [2025-03-09 05:53:35,490 INFO L226 Difference]: Without dead ends: 1008 [2025-03-09 05:53:35,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 05:53:35,491 INFO L435 NwaCegarLoop]: 327 mSDtfsCounter, 870 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 870 SdHoareTripleChecker+Valid, 887 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 05:53:35,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [870 Valid, 887 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 05:53:35,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2025-03-09 05:53:35,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 827. [2025-03-09 05:53:35,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 827 states, 737 states have (on average 1.3772048846675713) internal successors, (1015), 764 states have internal predecessors, (1015), 50 states have call successors, (50), 26 states have call predecessors, (50), 29 states have return successors, (49), 38 states have call predecessors, (49), 38 states have call successors, (49) [2025-03-09 05:53:35,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1114 transitions. [2025-03-09 05:53:35,518 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1114 transitions. Word has length 101 [2025-03-09 05:53:35,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:53:35,519 INFO L471 AbstractCegarLoop]: Abstraction has 827 states and 1114 transitions. [2025-03-09 05:53:35,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 05:53:35,519 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1114 transitions. [2025-03-09 05:53:35,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-09 05:53:35,520 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:53:35,520 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:53:35,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-09 05:53:35,521 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-03-09 05:53:35,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:53:35,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1061703267, now seen corresponding path program 1 times [2025-03-09 05:53:35,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:53:35,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553646775] [2025-03-09 05:53:35,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:53:35,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:53:35,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-09 05:53:35,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-09 05:53:35,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:53:35,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:53:36,293 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-09 05:53:36,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:53:36,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553646775] [2025-03-09 05:53:36,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553646775] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:53:36,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:53:36,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 05:53:36,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324601909] [2025-03-09 05:53:36,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:53:36,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 05:53:36,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:53:36,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 05:53:36,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:53:36,294 INFO L87 Difference]: Start difference. First operand 827 states and 1114 transitions. Second operand has 5 states, 4 states have (on average 10.75) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 05:53:40,319 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-09 05:53:44,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-09 05:53:44,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:53:44,638 INFO L93 Difference]: Finished difference Result 949 states and 1312 transitions. [2025-03-09 05:53:44,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 05:53:44,639 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.75) internal successors, (43), 5 states have internal predecessors, (43), 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 101 [2025-03-09 05:53:44,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:53:44,642 INFO L225 Difference]: With dead ends: 949 [2025-03-09 05:53:44,642 INFO L226 Difference]: Without dead ends: 947 [2025-03-09 05:53:44,642 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 05:53:44,643 INFO L435 NwaCegarLoop]: 330 mSDtfsCounter, 30 mSDsluCounter, 964 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1294 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2025-03-09 05:53:44,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1294 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 2 Unknown, 0 Unchecked, 8.3s Time] [2025-03-09 05:53:44,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2025-03-09 05:53:44,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 851. [2025-03-09 05:53:44,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 851 states, 761 states have (on average 1.3731931668856767) internal successors, (1045), 788 states have internal predecessors, (1045), 50 states have call successors, (50), 26 states have call predecessors, (50), 29 states have return successors, (49), 38 states have call predecessors, (49), 38 states have call successors, (49) [2025-03-09 05:53:44,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1144 transitions. [2025-03-09 05:53:44,680 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1144 transitions. Word has length 101 [2025-03-09 05:53:44,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:53:44,681 INFO L471 AbstractCegarLoop]: Abstraction has 851 states and 1144 transitions. [2025-03-09 05:53:44,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.75) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 05:53:44,681 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1144 transitions. [2025-03-09 05:53:44,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-09 05:53:44,683 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:53:44,683 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:53:44,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-09 05:53:44,683 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-03-09 05:53:44,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:53:44,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1061733058, now seen corresponding path program 1 times [2025-03-09 05:53:44,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:53:44,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061636348] [2025-03-09 05:53:44,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:53:44,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:53:45,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-09 05:53:45,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-09 05:53:45,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:53:45,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:53:45,415 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-09 05:53:45,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:53:45,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061636348] [2025-03-09 05:53:45,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061636348] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:53:45,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:53:45,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 05:53:45,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660529264] [2025-03-09 05:53:45,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:53:45,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 05:53:45,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:53:45,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 05:53:45,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:53:45,417 INFO L87 Difference]: Start difference. First operand 851 states and 1144 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 05:53:45,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:53:45,538 INFO L93 Difference]: Finished difference Result 1526 states and 2086 transitions. [2025-03-09 05:53:45,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 05:53:45,539 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 101 [2025-03-09 05:53:45,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:53:45,542 INFO L225 Difference]: With dead ends: 1526 [2025-03-09 05:53:45,542 INFO L226 Difference]: Without dead ends: 827 [2025-03-09 05:53:45,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:53:45,546 INFO L435 NwaCegarLoop]: 338 mSDtfsCounter, 0 mSDsluCounter, 1001 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1339 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:53:45,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1339 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:53:45,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2025-03-09 05:53:45,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 823. [2025-03-09 05:53:45,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 823 states, 730 states have (on average 1.358904109589041) internal successors, (992), 757 states have internal predecessors, (992), 50 states have call successors, (50), 26 states have call predecessors, (50), 32 states have return successors, (54), 41 states have call predecessors, (54), 38 states have call successors, (54) [2025-03-09 05:53:45,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1096 transitions. [2025-03-09 05:53:45,570 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1096 transitions. Word has length 101 [2025-03-09 05:53:45,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:53:45,570 INFO L471 AbstractCegarLoop]: Abstraction has 823 states and 1096 transitions. [2025-03-09 05:53:45,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 05:53:45,570 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1096 transitions. [2025-03-09 05:53:45,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-09 05:53:45,571 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:53:45,571 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:53:45,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-09 05:53:45,571 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting bb_verror_msgErr27ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-03-09 05:53:45,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:53:45,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1930487274, now seen corresponding path program 1 times [2025-03-09 05:53:45,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:53:45,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77196969] [2025-03-09 05:53:45,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:53:45,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:53:45,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-09 05:53:45,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-09 05:53:45,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:53:45,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:53:46,268 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-09 05:53:46,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:53:46,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77196969] [2025-03-09 05:53:46,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77196969] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:53:46,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:53:46,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 05:53:46,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279630665] [2025-03-09 05:53:46,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:53:46,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 05:53:46,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:53:46,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 05:53:46,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:53:46,269 INFO L87 Difference]: Start difference. First operand 823 states and 1096 transitions. Second operand has 5 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 05:53:46,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:53:46,365 INFO L93 Difference]: Finished difference Result 834 states and 1106 transitions. [2025-03-09 05:53:46,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 05:53:46,366 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 102 [2025-03-09 05:53:46,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:53:46,368 INFO L225 Difference]: With dead ends: 834 [2025-03-09 05:53:46,368 INFO L226 Difference]: Without dead ends: 831 [2025-03-09 05:53:46,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 05:53:46,369 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 13 mSDsluCounter, 1003 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1339 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:53:46,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1339 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:53:46,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2025-03-09 05:53:46,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 828. [2025-03-09 05:53:46,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 828 states, 734 states have (on average 1.3583106267029972) internal successors, (997), 761 states have internal predecessors, (997), 50 states have call successors, (50), 27 states have call predecessors, (50), 33 states have return successors, (54), 41 states have call predecessors, (54), 38 states have call successors, (54) [2025-03-09 05:53:46,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1101 transitions. [2025-03-09 05:53:46,393 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1101 transitions. Word has length 102 [2025-03-09 05:53:46,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:53:46,393 INFO L471 AbstractCegarLoop]: Abstraction has 828 states and 1101 transitions. [2025-03-09 05:53:46,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 05:53:46,393 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1101 transitions. [2025-03-09 05:53:46,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-09 05:53:46,394 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:53:46,394 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:53:46,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-09 05:53:46,395 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting bb_verror_msgErr27ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-03-09 05:53:46,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:53:46,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1930486313, now seen corresponding path program 1 times [2025-03-09 05:53:46,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:53:46,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785450557] [2025-03-09 05:53:46,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:53:46,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:53:46,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-09 05:53:46,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-09 05:53:46,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:53:46,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:53:47,297 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-09 05:53:47,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:53:47,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785450557] [2025-03-09 05:53:47,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785450557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:53:47,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:53:47,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 05:53:47,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183641863] [2025-03-09 05:53:47,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:53:47,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 05:53:47,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:53:47,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 05:53:47,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 05:53:47,301 INFO L87 Difference]: Start difference. First operand 828 states and 1101 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 05:53:47,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:53:47,461 INFO L93 Difference]: Finished difference Result 1544 states and 2124 transitions. [2025-03-09 05:53:47,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 05:53:47,461 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 102 [2025-03-09 05:53:47,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:53:47,465 INFO L225 Difference]: With dead ends: 1544 [2025-03-09 05:53:47,465 INFO L226 Difference]: Without dead ends: 1241 [2025-03-09 05:53:47,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:53:47,467 INFO L435 NwaCegarLoop]: 377 mSDtfsCounter, 174 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 1070 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:53:47,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 1070 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:53:47,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2025-03-09 05:53:47,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 1064. [2025-03-09 05:53:47,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1064 states, 965 states have (on average 1.3937823834196892) internal successors, (1345), 989 states have internal predecessors, (1345), 55 states have call successors, (55), 27 states have call predecessors, (55), 33 states have return successors, (75), 49 states have call predecessors, (75), 43 states have call successors, (75) [2025-03-09 05:53:47,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 1475 transitions. [2025-03-09 05:53:47,495 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 1475 transitions. Word has length 102 [2025-03-09 05:53:47,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:53:47,495 INFO L471 AbstractCegarLoop]: Abstraction has 1064 states and 1475 transitions. [2025-03-09 05:53:47,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 05:53:47,496 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1475 transitions. [2025-03-09 05:53:47,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-09 05:53:47,496 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:53:47,496 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:53:47,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-09 05:53:47,497 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-03-09 05:53:47,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:53:47,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1758958370, now seen corresponding path program 1 times [2025-03-09 05:53:47,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:53:47,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537399251] [2025-03-09 05:53:47,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:53:47,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:53:47,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-09 05:53:47,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-09 05:53:47,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:53:47,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:53:48,434 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-09 05:53:48,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:53:48,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537399251] [2025-03-09 05:53:48,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537399251] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:53:48,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:53:48,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 05:53:48,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663416804] [2025-03-09 05:53:48,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:53:48,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 05:53:48,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:53:48,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 05:53:48,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:53:48,435 INFO L87 Difference]: Start difference. First operand 1064 states and 1475 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 05:53:52,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-09 05:53:56,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-09 05:53:57,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:53:57,334 INFO L93 Difference]: Finished difference Result 1539 states and 2126 transitions. [2025-03-09 05:53:57,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 05:53:57,335 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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 103 [2025-03-09 05:53:57,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:53:57,339 INFO L225 Difference]: With dead ends: 1539 [2025-03-09 05:53:57,339 INFO L226 Difference]: Without dead ends: 1253 [2025-03-09 05:53:57,340 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:53:57,340 INFO L435 NwaCegarLoop]: 426 mSDtfsCounter, 449 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 11 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2025-03-09 05:53:57,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 1086 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 154 Invalid, 2 Unknown, 0 Unchecked, 8.8s Time] [2025-03-09 05:53:57,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states. [2025-03-09 05:53:57,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 1092. [2025-03-09 05:53:57,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1092 states, 991 states have (on average 1.3915237134207872) internal successors, (1379), 1015 states have internal predecessors, (1379), 57 states have call successors, (57), 27 states have call predecessors, (57), 33 states have return successors, (77), 51 states have call predecessors, (77), 45 states have call successors, (77) [2025-03-09 05:53:57,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1092 states to 1092 states and 1513 transitions. [2025-03-09 05:53:57,375 INFO L78 Accepts]: Start accepts. Automaton has 1092 states and 1513 transitions. Word has length 103 [2025-03-09 05:53:57,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:53:57,375 INFO L471 AbstractCegarLoop]: Abstraction has 1092 states and 1513 transitions. [2025-03-09 05:53:57,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 05:53:57,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1092 states and 1513 transitions. [2025-03-09 05:53:57,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-09 05:53:57,377 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:53:57,377 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:53:57,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-09 05:53:57,377 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-03-09 05:53:57,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:53:57,377 INFO L85 PathProgramCache]: Analyzing trace with hash -2052361377, now seen corresponding path program 1 times [2025-03-09 05:53:57,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:53:57,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820741475] [2025-03-09 05:53:57,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:53:57,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:53:57,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-09 05:53:57,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-09 05:53:57,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:53:57,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:00,262 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2025-03-09 05:54:00,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:54:00,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820741475] [2025-03-09 05:54:00,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820741475] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:54:00,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707469375] [2025-03-09 05:54:00,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:00,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:54:00,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:54:00,264 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:54:00,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 05:54:01,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-09 05:54:01,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-09 05:54:01,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:01,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:01,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 2343 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-09 05:54:01,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:54:03,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2025-03-09 05:54:03,192 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-09 05:54:03,192 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:54:03,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [707469375] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:54:03,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 05:54:03,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [14] total 21 [2025-03-09 05:54:03,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559750383] [2025-03-09 05:54:03,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:54:03,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 05:54:03,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:54:03,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 05:54:03,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2025-03-09 05:54:03,193 INFO L87 Difference]: Start difference. First operand 1092 states and 1513 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 05:54:07,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-09 05:54:11,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []