./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 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/busybox-1.22.0/head-3.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 9d0d62704d9d2a7d6604a8f9e55e356598a3d0a692f256361f60668a3d4dba4c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:02:25,148 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:02:25,192 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-01-10 06:02:25,198 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:02:25,199 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:02:25,220 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:02:25,220 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:02:25,220 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:02:25,221 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:02:25,221 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:02:25,221 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:02:25,221 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:02:25,221 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:02:25,221 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:02:25,221 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:02:25,221 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:02:25,221 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:02:25,221 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:02:25,221 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:02:25,221 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:02:25,222 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:02:25,222 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:02:25,222 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:02:25,222 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:02:25,222 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:02:25,222 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:02:25,222 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:02:25,222 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:02:25,222 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:02:25,222 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:02:25,222 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:02:25,222 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:02:25,222 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:02:25,222 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:02:25,222 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:02:25,222 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:02:25,224 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:02:25,224 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:02:25,224 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:02:25,224 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:02:25,224 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:02:25,224 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:02:25,224 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:02:25,224 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:02:25,224 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:02:25,225 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:02:25,225 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:02:25,225 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9d0d62704d9d2a7d6604a8f9e55e356598a3d0a692f256361f60668a3d4dba4c [2025-01-10 06:02:25,428 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:02:25,434 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:02:25,436 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:02:25,437 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:02:25,438 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:02:25,439 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/head-3.i [2025-01-10 06:02:26,518 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bc85f3ce1/1768debf3ded40d3992e6224e9d068f4/FLAG6870e4c85 [2025-01-10 06:02:26,843 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:02:26,843 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/head-3.i [2025-01-10 06:02:26,860 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bc85f3ce1/1768debf3ded40d3992e6224e9d068f4/FLAG6870e4c85 [2025-01-10 06:02:27,085 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bc85f3ce1/1768debf3ded40d3992e6224e9d068f4 [2025-01-10 06:02:27,087 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:02:27,088 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:02:27,089 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:02:27,089 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:02:27,092 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:02:27,092 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:02:27" (1/1) ... [2025-01-10 06:02:27,093 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cfc6d9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:02:27, skipping insertion in model container [2025-01-10 06:02:27,093 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:02:27" (1/1) ... [2025-01-10 06:02:27,148 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:02:27,879 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:02:27,901 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:02:28,016 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:02:28,149 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-01-10 06:02:28,156 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:02:28,158 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:02:28 WrapperNode [2025-01-10 06:02:28,158 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:02:28,159 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:02:28,159 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:02:28,159 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:02:28,164 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:02:28" (1/1) ... [2025-01-10 06:02:28,195 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:02:28" (1/1) ... [2025-01-10 06:02:28,253 INFO L138 Inliner]: procedures = 581, calls = 697, calls flagged for inlining = 30, calls inlined = 28, statements flattened = 1397 [2025-01-10 06:02:28,254 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:02:28,254 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:02:28,254 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:02:28,255 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:02:28,262 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:02:28" (1/1) ... [2025-01-10 06:02:28,262 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:02:28" (1/1) ... [2025-01-10 06:02:28,276 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:02:28" (1/1) ... [2025-01-10 06:02:28,334 INFO L175 MemorySlicer]: Split 566 memory accesses to 19 slices as follows [47, 2, 32, 20, 3, 1, 2, 9, 3, 15, 9, 24, 10, 2, 355, 4, 18, 7, 3]. 63 percent of accesses are in the largest equivalence class. The 379 initializations are split as follows [2, 2, 2, 4, 3, 0, 2, 1, 0, 0, 0, 0, 7, 0, 355, 1, 0, 0, 0]. The 120 writes are split as follows [35, 0, 21, 15, 0, 1, 0, 4, 3, 1, 6, 21, 0, 1, 0, 1, 4, 7, 0]. [2025-01-10 06:02:28,335 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:02:28" (1/1) ... [2025-01-10 06:02:28,335 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:02:28" (1/1) ... [2025-01-10 06:02:28,385 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:02:28" (1/1) ... [2025-01-10 06:02:28,390 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:02:28" (1/1) ... [2025-01-10 06:02:28,402 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:02:28" (1/1) ... [2025-01-10 06:02:28,421 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:02:28" (1/1) ... [2025-01-10 06:02:28,433 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:02:28" (1/1) ... [2025-01-10 06:02:28,451 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:02:28,455 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:02:28,455 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:02:28,455 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:02:28,455 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:02:28" (1/1) ... [2025-01-10 06:02:28,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:02:28,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:02:28,483 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 06:02:28,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 06:02:28,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#0 [2025-01-10 06:02:28,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#1 [2025-01-10 06:02:28,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#2 [2025-01-10 06:02:28,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#3 [2025-01-10 06:02:28,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#4 [2025-01-10 06:02:28,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#5 [2025-01-10 06:02:28,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#6 [2025-01-10 06:02:28,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#7 [2025-01-10 06:02:28,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#8 [2025-01-10 06:02:28,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#9 [2025-01-10 06:02:28,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#10 [2025-01-10 06:02:28,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#11 [2025-01-10 06:02:28,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#12 [2025-01-10 06:02:28,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#13 [2025-01-10 06:02:28,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#14 [2025-01-10 06:02:28,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#15 [2025-01-10 06:02:28,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#16 [2025-01-10 06:02:28,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#17 [2025-01-10 06:02:28,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#18 [2025-01-10 06:02:28,504 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#0 [2025-01-10 06:02:28,504 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#1 [2025-01-10 06:02:28,504 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#2 [2025-01-10 06:02:28,504 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#3 [2025-01-10 06:02:28,504 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#4 [2025-01-10 06:02:28,504 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#5 [2025-01-10 06:02:28,504 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#6 [2025-01-10 06:02:28,504 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#7 [2025-01-10 06:02:28,504 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#8 [2025-01-10 06:02:28,504 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#9 [2025-01-10 06:02:28,504 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#10 [2025-01-10 06:02:28,504 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#11 [2025-01-10 06:02:28,504 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#12 [2025-01-10 06:02:28,504 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#13 [2025-01-10 06:02:28,504 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#14 [2025-01-10 06:02:28,504 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#15 [2025-01-10 06:02:28,504 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#16 [2025-01-10 06:02:28,505 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#17 [2025-01-10 06:02:28,505 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#18 [2025-01-10 06:02:28,505 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_getc [2025-01-10 06:02:28,505 INFO L138 BoogieDeclarations]: Found implementation of procedure _IO_getc [2025-01-10 06:02:28,505 INFO L130 BoogieDeclarations]: Found specification of procedure xrealloc [2025-01-10 06:02:28,505 INFO L138 BoogieDeclarations]: Found implementation of procedure xrealloc [2025-01-10 06:02:28,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 06:02:28,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-01-10 06:02:28,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-01-10 06:02:28,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-01-10 06:02:28,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-01-10 06:02:28,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-01-10 06:02:28,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-01-10 06:02:28,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-01-10 06:02:28,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-01-10 06:02:28,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2025-01-10 06:02:28,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2025-01-10 06:02:28,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#10 [2025-01-10 06:02:28,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#11 [2025-01-10 06:02:28,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#12 [2025-01-10 06:02:28,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#13 [2025-01-10 06:02:28,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#14 [2025-01-10 06:02:28,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#15 [2025-01-10 06:02:28,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#16 [2025-01-10 06:02:28,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#17 [2025-01-10 06:02:28,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#18 [2025-01-10 06:02:28,506 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-01-10 06:02:28,506 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-01-10 06:02:28,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-01-10 06:02:28,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-01-10 06:02:28,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-01-10 06:02:28,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-01-10 06:02:28,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-01-10 06:02:28,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-01-10 06:02:28,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-01-10 06:02:28,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-01-10 06:02:28,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-01-10 06:02:28,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-01-10 06:02:28,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-01-10 06:02:28,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-01-10 06:02:28,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-01-10 06:02:28,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-01-10 06:02:28,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-01-10 06:02:28,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-01-10 06:02:28,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-01-10 06:02:28,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-01-10 06:02:28,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-01-10 06:02:28,507 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 06:02:28,507 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 06:02:28,507 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 06:02:28,507 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-10 06:02:28,507 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-10 06:02:28,507 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-10 06:02:28,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-10 06:02:28,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-01-10 06:02:28,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-01-10 06:02:28,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-01-10 06:02:28,509 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-01-10 06:02:28,509 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-01-10 06:02:28,509 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-01-10 06:02:28,509 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-01-10 06:02:28,509 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-01-10 06:02:28,509 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-01-10 06:02:28,509 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-01-10 06:02:28,509 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-01-10 06:02:28,509 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-01-10 06:02:28,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 06:02:28,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:02:28,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-10 06:02:28,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-10 06:02:28,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-10 06:02:28,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-10 06:02:28,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-01-10 06:02:28,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-01-10 06:02:28,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-01-10 06:02:28,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-01-10 06:02:28,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-01-10 06:02:28,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-01-10 06:02:28,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-01-10 06:02:28,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-01-10 06:02:28,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-01-10 06:02:28,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-01-10 06:02:28,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-01-10 06:02:28,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-01-10 06:02:28,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-01-10 06:02:28,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-01-10 06:02:28,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-01-10 06:02:28,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:02:28,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:02:28,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#0 [2025-01-10 06:02:28,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#1 [2025-01-10 06:02:28,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#2 [2025-01-10 06:02:28,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#3 [2025-01-10 06:02:28,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#4 [2025-01-10 06:02:28,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#5 [2025-01-10 06:02:28,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#6 [2025-01-10 06:02:28,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#7 [2025-01-10 06:02:28,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#8 [2025-01-10 06:02:28,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#9 [2025-01-10 06:02:28,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#10 [2025-01-10 06:02:28,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#11 [2025-01-10 06:02:28,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#12 [2025-01-10 06:02:28,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#13 [2025-01-10 06:02:28,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#14 [2025-01-10 06:02:28,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#15 [2025-01-10 06:02:28,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#16 [2025-01-10 06:02:28,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#17 [2025-01-10 06:02:28,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#18 [2025-01-10 06:02:28,510 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#0 [2025-01-10 06:02:28,510 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#1 [2025-01-10 06:02:28,510 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#2 [2025-01-10 06:02:28,510 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#3 [2025-01-10 06:02:28,510 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#4 [2025-01-10 06:02:28,510 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#5 [2025-01-10 06:02:28,510 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#6 [2025-01-10 06:02:28,510 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#7 [2025-01-10 06:02:28,510 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#8 [2025-01-10 06:02:28,510 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#9 [2025-01-10 06:02:28,510 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#10 [2025-01-10 06:02:28,510 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#11 [2025-01-10 06:02:28,510 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#12 [2025-01-10 06:02:28,510 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#13 [2025-01-10 06:02:28,510 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#14 [2025-01-10 06:02:28,510 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#15 [2025-01-10 06:02:28,511 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#16 [2025-01-10 06:02:28,511 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#17 [2025-01-10 06:02:28,511 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#18 [2025-01-10 06:02:28,511 INFO L130 BoogieDeclarations]: Found specification of procedure xmalloc [2025-01-10 06:02:28,512 INFO L138 BoogieDeclarations]: Found implementation of procedure xmalloc [2025-01-10 06:02:28,512 INFO L130 BoogieDeclarations]: Found specification of procedure getopt [2025-01-10 06:02:28,512 INFO L138 BoogieDeclarations]: Found implementation of procedure getopt [2025-01-10 06:02:28,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-01-10 06:02:28,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-01-10 06:02:28,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-01-10 06:02:28,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-01-10 06:02:28,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-01-10 06:02:28,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-01-10 06:02:28,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-01-10 06:02:28,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-01-10 06:02:28,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2025-01-10 06:02:28,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2025-01-10 06:02:28,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#10 [2025-01-10 06:02:28,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#11 [2025-01-10 06:02:28,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#12 [2025-01-10 06:02:28,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#13 [2025-01-10 06:02:28,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#14 [2025-01-10 06:02:28,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#15 [2025-01-10 06:02:28,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#16 [2025-01-10 06:02:28,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#17 [2025-01-10 06:02:28,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#18 [2025-01-10 06:02:28,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-01-10 06:02:28,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-01-10 06:02:28,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-01-10 06:02:28,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-01-10 06:02:28,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-01-10 06:02:28,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-01-10 06:02:28,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-01-10 06:02:28,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-01-10 06:02:28,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-01-10 06:02:28,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-01-10 06:02:28,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-01-10 06:02:28,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-01-10 06:02:28,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-01-10 06:02:28,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-01-10 06:02:28,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-01-10 06:02:28,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-01-10 06:02:28,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-01-10 06:02:28,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#17 [2025-01-10 06:02:28,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#18 [2025-01-10 06:02:28,514 INFO L130 BoogieDeclarations]: Found specification of procedure bb_simple_perror_msg [2025-01-10 06:02:28,514 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_simple_perror_msg [2025-01-10 06:02:28,514 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-10 06:02:28,514 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-10 06:02:28,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 06:02:28,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-10 06:02:28,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-10 06:02:28,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-10 06:02:28,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-10 06:02:28,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-01-10 06:02:28,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-01-10 06:02:28,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-01-10 06:02:28,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-01-10 06:02:28,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-01-10 06:02:28,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-01-10 06:02:28,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-01-10 06:02:28,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-01-10 06:02:28,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-01-10 06:02:28,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-01-10 06:02:28,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-01-10 06:02:28,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-01-10 06:02:28,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-01-10 06:02:28,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-01-10 06:02:28,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-01-10 06:02:28,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 06:02:28,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 06:02:28,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 06:02:28,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-10 06:02:28,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-10 06:02:28,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-10 06:02:28,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-10 06:02:28,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-01-10 06:02:28,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-01-10 06:02:28,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-01-10 06:02:28,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-01-10 06:02:28,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-01-10 06:02:28,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-01-10 06:02:28,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-01-10 06:02:28,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-01-10 06:02:28,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-01-10 06:02:28,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-01-10 06:02:28,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-01-10 06:02:28,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-01-10 06:02:28,515 INFO L130 BoogieDeclarations]: Found specification of procedure xmalloc_fgets [2025-01-10 06:02:28,515 INFO L138 BoogieDeclarations]: Found implementation of procedure xmalloc_fgets [2025-01-10 06:02:28,515 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg_and_die [2025-01-10 06:02:28,515 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg_and_die [2025-01-10 06:02:28,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:02:28,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 06:02:28,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 06:02:28,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-10 06:02:28,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-10 06:02:28,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-10 06:02:28,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-10 06:02:28,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-10 06:02:28,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-10 06:02:28,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-10 06:02:28,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-10 06:02:28,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-10 06:02:28,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-01-10 06:02:28,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-01-10 06:02:28,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-01-10 06:02:28,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-01-10 06:02:28,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-01-10 06:02:28,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-01-10 06:02:28,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-01-10 06:02:28,943 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:02:28,946 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:02:35,059 INFO L? ?]: Removed 600 outVars from TransFormulas that were not future-live. [2025-01-10 06:02:35,059 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:02:35,075 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:02:35,076 INFO L312 CfgBuilder]: Removed 38 assume(true) statements. [2025-01-10 06:02:35,076 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:02:35 BoogieIcfgContainer [2025-01-10 06:02:35,076 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:02:35,079 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:02:35,079 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:02:35,083 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:02:35,083 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:02:27" (1/3) ... [2025-01-10 06:02:35,084 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36271df9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:02:35, skipping insertion in model container [2025-01-10 06:02:35,084 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:02:28" (2/3) ... [2025-01-10 06:02:35,084 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36271df9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:02:35, skipping insertion in model container [2025-01-10 06:02:35,084 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:02:35" (3/3) ... [2025-01-10 06:02:35,086 INFO L128 eAbstractionObserver]: Analyzing ICFG head-3.i [2025-01-10 06:02:35,103 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:02:35,107 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG head-3.i that has 48 procedures, 531 locations, 1 initial locations, 41 loop locations, and 54 error locations. [2025-01-10 06:02:35,155 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:02:35,164 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;@6e82948b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:02:35,164 INFO L334 AbstractCegarLoop]: Starting to check reachability of 54 error locations. [2025-01-10 06:02:35,169 INFO L276 IsEmpty]: Start isEmpty. Operand has 390 states, 295 states have (on average 1.6) internal successors, (472), 352 states have internal predecessors, (472), 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-01-10 06:02:35,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-10 06:02:35,173 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:02:35,174 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-10 06:02:35,174 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-01-10 06:02:35,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:02:35,178 INFO L85 PathProgramCache]: Analyzing trace with hash 24444612, now seen corresponding path program 1 times [2025-01-10 06:02:35,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:02:35,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733324217] [2025-01-10 06:02:35,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:02:35,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:02:36,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 06:02:36,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 06:02:36,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:02:36,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:02:36,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:02:36,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:02:36,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733324217] [2025-01-10 06:02:36,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733324217] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:02:36,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:02:36,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:02:36,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760443208] [2025-01-10 06:02:36,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:02:36,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:02:36,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:02:36,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:02:36,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:02:36,697 INFO L87 Difference]: Start difference. First operand has 390 states, 295 states have (on average 1.6) internal successors, (472), 352 states have internal predecessors, (472), 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-01-10 06:02:36,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:02:36,824 INFO L93 Difference]: Finished difference Result 653 states and 922 transitions. [2025-01-10 06:02:36,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:02:36,826 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-01-10 06:02:36,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:02:36,836 INFO L225 Difference]: With dead ends: 653 [2025-01-10 06:02:36,837 INFO L226 Difference]: Without dead ends: 267 [2025-01-10 06:02:36,844 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-01-10 06:02:36,846 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 1 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:02:36,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 694 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:02:36,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-01-10 06:02:36,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2025-01-10 06:02:36,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 214 states have (on average 1.4672897196261683) 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-01-10 06:02:36,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 354 transitions. [2025-01-10 06:02:36,907 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 354 transitions. Word has length 4 [2025-01-10 06:02:36,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:02:36,907 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 354 transitions. [2025-01-10 06:02:36,907 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-01-10 06:02:36,907 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 354 transitions. [2025-01-10 06:02:36,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-10 06:02:36,908 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:02:36,908 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-01-10 06:02:36,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:02:36,908 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-01-10 06:02:36,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:02:36,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1914205982, now seen corresponding path program 1 times [2025-01-10 06:02:36,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:02:36,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844852323] [2025-01-10 06:02:36,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:02:36,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:02:37,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:02:37,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:02:37,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:02:37,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:02:38,038 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:02:38,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:02:38,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844852323] [2025-01-10 06:02:38,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844852323] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:02:38,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210350527] [2025-01-10 06:02:38,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:02:38,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:02:38,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:02:38,044 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:02:38,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 06:02:38,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:02:39,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:02:39,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:02:39,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:02:39,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 1664 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 06:02:39,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:02:39,070 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:02:39,071 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:02:39,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210350527] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:02:39,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:02:39,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-01-10 06:02:39,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011592596] [2025-01-10 06:02:39,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:02:39,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:02:39,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:02:39,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:02:39,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:02:39,073 INFO L87 Difference]: Start difference. First operand 267 states and 354 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-01-10 06:02:39,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:02:39,130 INFO L93 Difference]: Finished difference Result 267 states and 354 transitions. [2025-01-10 06:02:39,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:02:39,132 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-01-10 06:02:39,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:02:39,133 INFO L225 Difference]: With dead ends: 267 [2025-01-10 06:02:39,133 INFO L226 Difference]: Without dead ends: 266 [2025-01-10 06:02:39,134 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-01-10 06:02:39,134 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 1 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:02:39,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 689 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:02:39,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-01-10 06:02:39,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2025-01-10 06:02:39,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 214 states have (on average 1.4626168224299065) internal successors, (313), 239 states have internal predecessors, (313), 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-01-10 06:02:39,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 353 transitions. [2025-01-10 06:02:39,153 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 353 transitions. Word has length 7 [2025-01-10 06:02:39,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:02:39,154 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 353 transitions. [2025-01-10 06:02:39,155 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-01-10 06:02:39,155 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 353 transitions. [2025-01-10 06:02:39,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 06:02:39,155 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:02:39,155 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-01-10 06:02:39,165 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 06:02:39,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:02:39,359 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-01-10 06:02:39,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:02:39,360 INFO L85 PathProgramCache]: Analyzing trace with hash 789157506, now seen corresponding path program 1 times [2025-01-10 06:02:39,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:02:39,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593859291] [2025-01-10 06:02:39,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:02:39,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:02:39,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:02:39,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:02:39,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:02:39,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:02:39,979 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:02:39,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:02:39,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593859291] [2025-01-10 06:02:39,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593859291] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:02:39,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:02:39,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:02:39,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723074048] [2025-01-10 06:02:39,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:02:39,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:02:39,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:02:39,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:02:39,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:02:39,981 INFO L87 Difference]: Start difference. First operand 266 states and 353 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-01-10 06:02:40,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:02:40,010 INFO L93 Difference]: Finished difference Result 266 states and 353 transitions. [2025-01-10 06:02:40,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:02:40,011 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-01-10 06:02:40,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:02:40,013 INFO L225 Difference]: With dead ends: 266 [2025-01-10 06:02:40,016 INFO L226 Difference]: Without dead ends: 265 [2025-01-10 06:02:40,017 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-01-10 06:02:40,017 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 0 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:02:40,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 690 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:02:40,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2025-01-10 06:02:40,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 263. [2025-01-10 06:02:40,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 212 states have (on average 1.4622641509433962) internal successors, (310), 236 states have internal predecessors, (310), 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-01-10 06:02:40,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 350 transitions. [2025-01-10 06:02:40,036 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 350 transitions. Word has length 8 [2025-01-10 06:02:40,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:02:40,036 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 350 transitions. [2025-01-10 06:02:40,036 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-01-10 06:02:40,036 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 350 transitions. [2025-01-10 06:02:40,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-10 06:02:40,037 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:02:40,037 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:02:40,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:02:40,037 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-01-10 06:02:40,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:02:40,038 INFO L85 PathProgramCache]: Analyzing trace with hash -842275046, now seen corresponding path program 1 times [2025-01-10 06:02:40,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:02:40,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423151403] [2025-01-10 06:02:40,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:02:40,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:02:40,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:02:40,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:02:40,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:02:40,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:02:40,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:02:40,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:02:40,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423151403] [2025-01-10 06:02:40,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423151403] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:02:40,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453174869] [2025-01-10 06:02:40,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:02:40,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:02:40,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:02:40,696 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:02:40,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 06:02:41,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:02:41,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:02:41,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:02:41,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:02:41,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 1681 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 06:02:41,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:02:41,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:02:41,715 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:02:41,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453174869] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:02:41,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:02:41,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-01-10 06:02:41,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692198896] [2025-01-10 06:02:41,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:02:41,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:02:41,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:02:41,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:02:41,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:02:41,716 INFO L87 Difference]: Start difference. First operand 263 states and 350 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-01-10 06:02:41,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:02:41,750 INFO L93 Difference]: Finished difference Result 263 states and 350 transitions. [2025-01-10 06:02:41,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:02:41,752 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-01-10 06:02:41,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:02:41,753 INFO L225 Difference]: With dead ends: 263 [2025-01-10 06:02:41,753 INFO L226 Difference]: Without dead ends: 261 [2025-01-10 06:02:41,753 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-01-10 06:02:41,754 INFO L435 NwaCegarLoop]: 339 mSDtfsCounter, 203 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:02:41,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 468 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:02:41,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2025-01-10 06:02:41,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2025-01-10 06:02:41,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 212 states have (on average 1.4528301886792452) internal successors, (308), 234 states have internal predecessors, (308), 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-01-10 06:02:41,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 348 transitions. [2025-01-10 06:02:41,774 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 348 transitions. Word has length 12 [2025-01-10 06:02:41,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:02:41,775 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 348 transitions. [2025-01-10 06:02:41,776 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-01-10 06:02:41,776 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 348 transitions. [2025-01-10 06:02:41,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-10 06:02:41,776 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:02:41,776 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:02:41,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 06:02:41,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:02:41,977 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-01-10 06:02:41,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:02:41,977 INFO L85 PathProgramCache]: Analyzing trace with hash -340721839, now seen corresponding path program 1 times [2025-01-10 06:02:41,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:02:41,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678887792] [2025-01-10 06:02:41,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:02:41,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:02:42,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:02:42,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:02:42,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:02:42,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:02:42,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:02:42,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:02:42,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678887792] [2025-01-10 06:02:42,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678887792] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:02:42,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220769823] [2025-01-10 06:02:42,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:02:42,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:02:42,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:02:42,628 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:02:42,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 06:02:43,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:02:43,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:02:43,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:02:43,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:02:43,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 1682 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 06:02:43,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:02:43,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:02:43,644 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:02:43,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:02:43,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1220769823] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:02:43,739 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:02:43,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-10 06:02:43,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577199482] [2025-01-10 06:02:43,740 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:02:43,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:02:43,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:02:43,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:02:43,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:02:43,740 INFO L87 Difference]: Start difference. First operand 261 states and 348 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-01-10 06:02:43,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:02:43,821 INFO L93 Difference]: Finished difference Result 525 states and 701 transitions. [2025-01-10 06:02:43,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:02:43,822 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-01-10 06:02:43,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:02:43,824 INFO L225 Difference]: With dead ends: 525 [2025-01-10 06:02:43,825 INFO L226 Difference]: Without dead ends: 270 [2025-01-10 06:02:43,826 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-01-10 06:02:43,826 INFO L435 NwaCegarLoop]: 344 mSDtfsCounter, 4 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:02:43,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 686 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:02:43,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-01-10 06:02:43,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2025-01-10 06:02:43,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 221 states have (on average 1.4343891402714932) internal successors, (317), 243 states have internal predecessors, (317), 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-01-10 06:02:43,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 357 transitions. [2025-01-10 06:02:43,838 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 357 transitions. Word has length 13 [2025-01-10 06:02:43,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:02:43,838 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 357 transitions. [2025-01-10 06:02:43,838 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-01-10 06:02:43,839 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 357 transitions. [2025-01-10 06:02:43,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-10 06:02:43,839 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:02:43,839 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:02:43,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 06:02:44,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:02:44,040 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-01-10 06:02:44,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:02:44,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1331919411, now seen corresponding path program 2 times [2025-01-10 06:02:44,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:02:44,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668135344] [2025-01-10 06:02:44,041 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:02:44,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:02:44,408 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-01-10 06:02:44,450 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 22 statements. [2025-01-10 06:02:44,451 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:02:44,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:02:44,857 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 06:02:44,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:02:44,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668135344] [2025-01-10 06:02:44,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668135344] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:02:44,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:02:44,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:02:44,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563047860] [2025-01-10 06:02:44,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:02:44,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:02:44,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:02:44,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:02:44,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:02:44,859 INFO L87 Difference]: Start difference. First operand 270 states and 357 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-01-10 06:02:45,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:02:45,024 INFO L93 Difference]: Finished difference Result 270 states and 357 transitions. [2025-01-10 06:02:45,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:02:45,024 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-01-10 06:02:45,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:02:45,026 INFO L225 Difference]: With dead ends: 270 [2025-01-10 06:02:45,027 INFO L226 Difference]: Without dead ends: 268 [2025-01-10 06:02:45,028 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-01-10 06:02:45,029 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 202 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 1128 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:02:45,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 1128 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:02:45,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2025-01-10 06:02:45,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2025-01-10 06:02:45,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 221 states have (on average 1.4253393665158371) 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-01-10 06:02:45,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 355 transitions. [2025-01-10 06:02:45,048 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 355 transitions. Word has length 22 [2025-01-10 06:02:45,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:02:45,049 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 355 transitions. [2025-01-10 06:02:45,049 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-01-10 06:02:45,049 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 355 transitions. [2025-01-10 06:02:45,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-10 06:02:45,049 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:02:45,050 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:02:45,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:02:45,050 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-01-10 06:02:45,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:02:45,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1962969568, now seen corresponding path program 1 times [2025-01-10 06:02:45,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:02:45,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219121876] [2025-01-10 06:02:45,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:02:45,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:02:45,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 06:02:45,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 06:02:45,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:02:45,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:02:45,709 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 06:02:45,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:02:45,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219121876] [2025-01-10 06:02:45,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219121876] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:02:45,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:02:45,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:02:45,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143750886] [2025-01-10 06:02:45,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:02:45,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:02:45,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:02:45,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:02:45,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:02:45,711 INFO L87 Difference]: Start difference. First operand 268 states and 355 transitions. Second operand has 3 states, 2 states have (on average 8.0) 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-01-10 06:02:45,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:02:45,765 INFO L93 Difference]: Finished difference Result 519 states and 694 transitions. [2025-01-10 06:02:45,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:02:45,766 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) 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-01-10 06:02:45,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:02:45,767 INFO L225 Difference]: With dead ends: 519 [2025-01-10 06:02:45,767 INFO L226 Difference]: Without dead ends: 271 [2025-01-10 06:02:45,767 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-01-10 06:02:45,768 INFO L435 NwaCegarLoop]: 342 mSDtfsCounter, 1 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:02:45,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 679 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:02:45,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2025-01-10 06:02:45,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2025-01-10 06:02:45,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 224 states have (on average 1.4196428571428572) 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-01-10 06:02:45,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 358 transitions. [2025-01-10 06:02:45,780 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 358 transitions. Word has length 27 [2025-01-10 06:02:45,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:02:45,780 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 358 transitions. [2025-01-10 06:02:45,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) 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-01-10 06:02:45,780 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 358 transitions. [2025-01-10 06:02:45,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-10 06:02:45,781 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:02:45,781 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-01-10 06:02:45,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 06:02:45,781 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-01-10 06:02:45,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:02:45,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1449123133, now seen corresponding path program 1 times [2025-01-10 06:02:45,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:02:45,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395506352] [2025-01-10 06:02:45,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:02:45,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:02:46,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 06:02:46,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 06:02:46,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:02:46,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:02:46,413 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 06:02:46,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:02:46,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395506352] [2025-01-10 06:02:46,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395506352] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:02:46,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245422931] [2025-01-10 06:02:46,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:02:46,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:02:46,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:02:46,417 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:02:46,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 06:02:47,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 06:02:47,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 06:02:47,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:02:47,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:02:47,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 1871 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 06:02:47,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:02:47,618 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:02:47,619 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:02:47,927 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:02:47,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1245422931] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:02:47,928 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:02:47,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-01-10 06:02:47,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930222144] [2025-01-10 06:02:47,929 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:02:47,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 06:02:47,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:02:47,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 06:02:47,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-01-10 06:02:47,930 INFO L87 Difference]: Start difference. First operand 271 states and 358 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-01-10 06:02:48,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:02:48,199 INFO L93 Difference]: Finished difference Result 544 states and 724 transitions. [2025-01-10 06:02:48,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 06:02:48,200 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-01-10 06:02:48,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:02:48,202 INFO L225 Difference]: With dead ends: 544 [2025-01-10 06:02:48,202 INFO L226 Difference]: Without dead ends: 288 [2025-01-10 06:02:48,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-01-10 06:02:48,204 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 5 mSDsluCounter, 1336 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1672 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 06:02:48,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1672 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 06:02:48,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2025-01-10 06:02:48,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2025-01-10 06:02:48,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 242 states have (on average 1.384297520661157) internal successors, (335), 261 states have internal predecessors, (335), 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-01-10 06:02:48,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 375 transitions. [2025-01-10 06:02:48,214 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 375 transitions. Word has length 30 [2025-01-10 06:02:48,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:02:48,215 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 375 transitions. [2025-01-10 06:02:48,215 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-01-10 06:02:48,215 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 375 transitions. [2025-01-10 06:02:48,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-10 06:02:48,216 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:02:48,216 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] [2025-01-10 06:02:48,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 06:02:48,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-01-10 06:02:48,419 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-01-10 06:02:48,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:02:48,420 INFO L85 PathProgramCache]: Analyzing trace with hash 540608445, now seen corresponding path program 1 times [2025-01-10 06:02:48,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:02:48,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786924754] [2025-01-10 06:02:48,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:02:48,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:02:48,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-10 06:02:48,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-10 06:02:48,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:02:48,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:02:49,071 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-01-10 06:02:49,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:02:49,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786924754] [2025-01-10 06:02:49,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786924754] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:02:49,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:02:49,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:02:49,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754744275] [2025-01-10 06:02:49,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:02:49,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:02:49,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:02:49,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:02:49,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:02:49,074 INFO L87 Difference]: Start difference. First operand 288 states and 375 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-01-10 06:02:49,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:02:49,156 INFO L93 Difference]: Finished difference Result 300 states and 389 transitions. [2025-01-10 06:02:49,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:02:49,157 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 48 [2025-01-10 06:02:49,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:02:49,159 INFO L225 Difference]: With dead ends: 300 [2025-01-10 06:02:49,159 INFO L226 Difference]: Without dead ends: 298 [2025-01-10 06:02:49,159 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-01-10 06:02:49,160 INFO L435 NwaCegarLoop]: 339 mSDtfsCounter, 2 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:02:49,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 674 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:02:49,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2025-01-10 06:02:49,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 297. [2025-01-10 06:02:49,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 251 states have (on average 1.3824701195219125) internal successors, (347), 270 states have internal predecessors, (347), 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-01-10 06:02:49,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 387 transitions. [2025-01-10 06:02:49,171 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 387 transitions. Word has length 48 [2025-01-10 06:02:49,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:02:49,171 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 387 transitions. [2025-01-10 06:02:49,171 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-01-10 06:02:49,172 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 387 transitions. [2025-01-10 06:02:49,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-10 06:02:49,172 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:02:49,172 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-01-10 06:02:49,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 06:02:49,173 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-01-10 06:02:49,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:02:49,173 INFO L85 PathProgramCache]: Analyzing trace with hash -421012514, now seen corresponding path program 1 times [2025-01-10 06:02:49,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:02:49,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528592292] [2025-01-10 06:02:49,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:02:49,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:02:49,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-10 06:02:49,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-10 06:02:49,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:02:49,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:02:49,825 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-01-10 06:02:49,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:02:49,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528592292] [2025-01-10 06:02:49,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528592292] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:02:49,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:02:49,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:02:49,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143972360] [2025-01-10 06:02:49,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:02:49,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:02:49,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:02:49,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:02:49,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:02:49,827 INFO L87 Difference]: Start difference. First operand 297 states and 387 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-01-10 06:02:49,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:02:49,876 INFO L93 Difference]: Finished difference Result 297 states and 387 transitions. [2025-01-10 06:02:49,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:02:49,877 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-01-10 06:02:49,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:02:49,878 INFO L225 Difference]: With dead ends: 297 [2025-01-10 06:02:49,879 INFO L226 Difference]: Without dead ends: 296 [2025-01-10 06:02:49,879 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-01-10 06:02:49,880 INFO L435 NwaCegarLoop]: 340 mSDtfsCounter, 0 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:02:49,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 677 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:02:49,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2025-01-10 06:02:49,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 292. [2025-01-10 06:02:49,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 247 states have (on average 1.3805668016194332) internal successors, (341), 265 states have internal predecessors, (341), 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-01-10 06:02:49,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 381 transitions. [2025-01-10 06:02:49,891 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 381 transitions. Word has length 49 [2025-01-10 06:02:49,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:02:49,891 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 381 transitions. [2025-01-10 06:02:49,891 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-01-10 06:02:49,892 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 381 transitions. [2025-01-10 06:02:49,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-10 06:02:49,892 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:02:49,892 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-01-10 06:02:49,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 06:02:49,893 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-01-10 06:02:49,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:02:49,893 INFO L85 PathProgramCache]: Analyzing trace with hash 741558910, now seen corresponding path program 1 times [2025-01-10 06:02:49,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:02:49,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555745606] [2025-01-10 06:02:49,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:02:49,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:02:50,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-10 06:02:50,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-10 06:02:50,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:02:50,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:02:50,834 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:02:50,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:02:50,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555745606] [2025-01-10 06:02:50,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555745606] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:02:50,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:02:50,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:02:50,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147695037] [2025-01-10 06:02:50,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:02:50,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:02:50,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:02:50,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:02:50,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:02:50,836 INFO L87 Difference]: Start difference. First operand 292 states and 381 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-01-10 06:02:52,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:02:52,380 INFO L93 Difference]: Finished difference Result 795 states and 1071 transitions. [2025-01-10 06:02:52,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 06:02:52,380 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-01-10 06:02:52,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:02:52,385 INFO L225 Difference]: With dead ends: 795 [2025-01-10 06:02:52,385 INFO L226 Difference]: Without dead ends: 562 [2025-01-10 06:02:52,386 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-01-10 06:02:52,386 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 542 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 557 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-10 06:02:52,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [557 Valid, 937 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-10 06:02:52,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2025-01-10 06:02:52,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 388. [2025-01-10 06:02:52,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 336 states have (on average 1.4136904761904763) internal successors, (475), 356 states have internal predecessors, (475), 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-01-10 06:02:52,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 524 transitions. [2025-01-10 06:02:52,405 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 524 transitions. Word has length 55 [2025-01-10 06:02:52,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:02:52,406 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 524 transitions. [2025-01-10 06:02:52,406 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-01-10 06:02:52,406 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 524 transitions. [2025-01-10 06:02:52,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-10 06:02:52,406 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:02:52,407 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-01-10 06:02:52,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 06:02:52,407 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-01-10 06:02:52,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:02:52,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1421617280, now seen corresponding path program 1 times [2025-01-10 06:02:52,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:02:52,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266833837] [2025-01-10 06:02:52,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:02:52,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:02:52,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-10 06:02:53,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-10 06:02:53,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:02:53,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:02:53,635 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:02:53,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:02:53,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266833837] [2025-01-10 06:02:53,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266833837] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:02:53,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:02:53,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 06:02:53,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497969829] [2025-01-10 06:02:53,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:02:53,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:02:53,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:02:53,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:02:53,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:02:53,637 INFO L87 Difference]: Start difference. First operand 388 states and 524 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-01-10 06:02:53,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:02:53,951 INFO L93 Difference]: Finished difference Result 722 states and 988 transitions. [2025-01-10 06:02:53,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:02:53,952 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-01-10 06:02:53,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:02:53,955 INFO L225 Difference]: With dead ends: 722 [2025-01-10 06:02:53,955 INFO L226 Difference]: Without dead ends: 388 [2025-01-10 06:02:53,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:02:53,957 INFO L435 NwaCegarLoop]: 331 mSDtfsCounter, 204 mSDsluCounter, 1099 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 1430 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.3s IncrementalHoareTripleChecker+Time [2025-01-10 06:02:53,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 1430 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 06:02:53,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2025-01-10 06:02:53,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 388. [2025-01-10 06:02:53,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 336 states have (on average 1.4107142857142858) internal successors, (474), 356 states have internal predecessors, (474), 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-01-10 06:02:53,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 523 transitions. [2025-01-10 06:02:53,971 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 523 transitions. Word has length 55 [2025-01-10 06:02:53,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:02:53,971 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 523 transitions. [2025-01-10 06:02:53,971 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-01-10 06:02:53,972 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 523 transitions. [2025-01-10 06:02:53,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-10 06:02:53,972 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:02:53,972 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-01-10 06:02:53,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 06:02:53,973 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-01-10 06:02:53,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:02:53,973 INFO L85 PathProgramCache]: Analyzing trace with hash 2091395788, now seen corresponding path program 1 times [2025-01-10 06:02:53,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:02:53,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143878670] [2025-01-10 06:02:53,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:02:53,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:02:54,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-10 06:02:54,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-10 06:02:54,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:02:54,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:02:54,637 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-01-10 06:02:54,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:02:54,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143878670] [2025-01-10 06:02:54,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143878670] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:02:54,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130224100] [2025-01-10 06:02:54,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:02:54,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:02:54,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:02:54,640 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:02:54,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 06:02:55,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-10 06:02:55,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-10 06:02:55,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:02:55,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:02:55,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 2044 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 06:02:55,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:02:55,698 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-01-10 06:02:55,698 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:02:55,749 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-01-10 06:02:55,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [130224100] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:02:55,750 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:02:55,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-10 06:02:55,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003536124] [2025-01-10 06:02:55,750 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:02:55,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:02:55,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:02:55,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:02:55,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:02:55,751 INFO L87 Difference]: Start difference. First operand 388 states and 523 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-01-10 06:02:55,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:02:55,810 INFO L93 Difference]: Finished difference Result 751 states and 1024 transitions. [2025-01-10 06:02:55,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:02:55,811 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-01-10 06:02:55,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:02:55,814 INFO L225 Difference]: With dead ends: 751 [2025-01-10 06:02:55,814 INFO L226 Difference]: Without dead ends: 406 [2025-01-10 06:02:55,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:02:55,815 INFO L435 NwaCegarLoop]: 340 mSDtfsCounter, 4 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1014 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:02:55,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1014 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:02:55,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2025-01-10 06:02:55,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 406. [2025-01-10 06:02:55,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 354 states have (on average 1.3898305084745763) internal successors, (492), 374 states have internal predecessors, (492), 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-01-10 06:02:55,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 541 transitions. [2025-01-10 06:02:55,830 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 541 transitions. Word has length 55 [2025-01-10 06:02:55,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:02:55,831 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 541 transitions. [2025-01-10 06:02:55,831 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-01-10 06:02:55,831 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 541 transitions. [2025-01-10 06:02:55,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-10 06:02:55,833 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:02:55,833 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-01-10 06:02:55,845 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-10 06:02:56,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-10 06:02:56,034 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-01-10 06:02:56,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:02:56,034 INFO L85 PathProgramCache]: Analyzing trace with hash -586366860, now seen corresponding path program 1 times [2025-01-10 06:02:56,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:02:56,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417875575] [2025-01-10 06:02:56,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:02:56,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:02:56,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-10 06:02:56,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-10 06:02:56,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:02:56,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:02:56,736 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:02:56,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:02:56,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417875575] [2025-01-10 06:02:56,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417875575] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:02:56,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742859890] [2025-01-10 06:02:56,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:02:56,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:02:56,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:02:56,738 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:02:56,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 06:02:57,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-10 06:02:57,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-10 06:02:57,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:02:57,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:02:57,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 2131 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 06:02:57,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:02:57,957 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:02:57,957 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:02:58,204 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:02:58,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1742859890] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:02:58,204 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:02:58,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-01-10 06:02:58,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310665394] [2025-01-10 06:02:58,205 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:02:58,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 06:02:58,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:02:58,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 06:02:58,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-10 06:02:58,206 INFO L87 Difference]: Start difference. First operand 406 states and 541 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-01-10 06:02:58,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:02:58,339 INFO L93 Difference]: Finished difference Result 796 states and 1075 transitions. [2025-01-10 06:02:58,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 06:02:58,342 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-01-10 06:02:58,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:02:58,345 INFO L225 Difference]: With dead ends: 796 [2025-01-10 06:02:58,345 INFO L226 Difference]: Without dead ends: 442 [2025-01-10 06:02:58,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-10 06:02:58,347 INFO L435 NwaCegarLoop]: 340 mSDtfsCounter, 4 mSDsluCounter, 1011 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1351 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:02:58,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1351 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:02:58,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2025-01-10 06:02:58,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 442. [2025-01-10 06:02:58,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 390 states have (on average 1.353846153846154) internal successors, (528), 410 states have internal predecessors, (528), 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-01-10 06:02:58,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 577 transitions. [2025-01-10 06:02:58,366 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 577 transitions. Word has length 71 [2025-01-10 06:02:58,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:02:58,366 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 577 transitions. [2025-01-10 06:02:58,367 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-01-10 06:02:58,367 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 577 transitions. [2025-01-10 06:02:58,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-10 06:02:58,368 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:02:58,368 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-01-10 06:02:58,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-10 06:02:58,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-01-10 06:02:58,569 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-01-10 06:02:58,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:02:58,569 INFO L85 PathProgramCache]: Analyzing trace with hash -561210092, now seen corresponding path program 2 times [2025-01-10 06:02:58,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:02:58,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457954782] [2025-01-10 06:02:58,569 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:02:58,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:02:58,980 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 89 statements into 2 equivalence classes. [2025-01-10 06:02:59,068 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 89 statements. [2025-01-10 06:02:59,068 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:02:59,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:02:59,750 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-01-10 06:02:59,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:02:59,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457954782] [2025-01-10 06:02:59,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457954782] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:02:59,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:02:59,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 06:02:59,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103267811] [2025-01-10 06:02:59,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:02:59,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 06:02:59,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:02:59,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 06:02:59,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:02:59,753 INFO L87 Difference]: Start difference. First operand 442 states and 577 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-01-10 06:03:01,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:03:01,031 INFO L93 Difference]: Finished difference Result 757 states and 1004 transitions. [2025-01-10 06:03:01,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 06:03:01,032 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-01-10 06:03:01,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:03:01,037 INFO L225 Difference]: With dead ends: 757 [2025-01-10 06:03:01,037 INFO L226 Difference]: Without dead ends: 756 [2025-01-10 06:03:01,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2025-01-10 06:03:01,039 INFO L435 NwaCegarLoop]: 310 mSDtfsCounter, 851 mSDsluCounter, 1542 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 867 SdHoareTripleChecker+Valid, 1852 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:03:01,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [867 Valid, 1852 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-10 06:03:01,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2025-01-10 06:03:01,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 482. [2025-01-10 06:03:01,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 429 states have (on average 1.3706293706293706) internal successors, (588), 449 states have internal predecessors, (588), 27 states have call successors, (27), 12 states have call predecessors, (27), 13 states have return successors, (25), 21 states have call predecessors, (25), 21 states have call successors, (25) [2025-01-10 06:03:01,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 640 transitions. [2025-01-10 06:03:01,063 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 640 transitions. Word has length 89 [2025-01-10 06:03:01,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:03:01,063 INFO L471 AbstractCegarLoop]: Abstraction has 482 states and 640 transitions. [2025-01-10 06:03:01,063 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-01-10 06:03:01,064 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 640 transitions. [2025-01-10 06:03:01,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-10 06:03:01,064 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:03:01,064 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-01-10 06:03:01,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 06:03:01,064 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-01-10 06:03:01,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:03:01,065 INFO L85 PathProgramCache]: Analyzing trace with hash -217642652, now seen corresponding path program 1 times [2025-01-10 06:03:01,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:03:01,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444037774] [2025-01-10 06:03:01,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:03:01,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:03:01,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-10 06:03:01,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-10 06:03:01,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:03:01,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:03:02,332 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2025-01-10 06:03:02,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:03:02,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444037774] [2025-01-10 06:03:02,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444037774] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:03:02,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908806435] [2025-01-10 06:03:02,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:03:02,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:03:02,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:03:02,336 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:03:02,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 06:03:03,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-10 06:03:03,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-10 06:03:03,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:03:03,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:03:03,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 2270 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 06:03:03,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:03:04,047 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-01-10 06:03:04,047 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:03:04,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [908806435] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:03:04,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:03:04,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2025-01-10 06:03:04,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338184829] [2025-01-10 06:03:04,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:03:04,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:03:04,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:03:04,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:03:04,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-01-10 06:03:04,048 INFO L87 Difference]: Start difference. First operand 482 states and 640 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 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-01-10 06:03:04,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:03:04,735 INFO L93 Difference]: Finished difference Result 744 states and 998 transitions. [2025-01-10 06:03:04,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:03:04,735 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 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 90 [2025-01-10 06:03:04,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:03:04,738 INFO L225 Difference]: With dead ends: 744 [2025-01-10 06:03:04,738 INFO L226 Difference]: Without dead ends: 415 [2025-01-10 06:03:04,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-01-10 06:03:04,740 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 430 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-10 06:03:04,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 596 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-10 06:03:04,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2025-01-10 06:03:04,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 415. [2025-01-10 06:03:04,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 368 states have (on average 1.328804347826087) internal successors, (489), 384 states have internal predecessors, (489), 25 states have call successors, (25), 12 states have call predecessors, (25), 12 states have return successors, (21), 19 states have call predecessors, (21), 19 states have call successors, (21) [2025-01-10 06:03:04,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 535 transitions. [2025-01-10 06:03:04,759 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 535 transitions. Word has length 90 [2025-01-10 06:03:04,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:03:04,759 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 535 transitions. [2025-01-10 06:03:04,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 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-01-10 06:03:04,759 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 535 transitions. [2025-01-10 06:03:04,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-10 06:03:04,760 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:03:04,761 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-01-10 06:03:04,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-10 06:03:04,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:03:04,962 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting getoptErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-01-10 06:03:04,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:03:04,962 INFO L85 PathProgramCache]: Analyzing trace with hash -2143426507, now seen corresponding path program 1 times [2025-01-10 06:03:04,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:03:04,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546003999] [2025-01-10 06:03:04,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:03:04,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:03:05,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-10 06:03:05,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-10 06:03:05,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:03:05,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:03:05,614 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2025-01-10 06:03:05,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:03:05,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546003999] [2025-01-10 06:03:05,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546003999] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:03:05,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:03:05,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:03:05,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939305011] [2025-01-10 06:03:05,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:03:05,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:03:05,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:03:05,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:03:05,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:03:05,616 INFO L87 Difference]: Start difference. First operand 415 states and 535 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 06:03:05,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:03:05,656 INFO L93 Difference]: Finished difference Result 719 states and 958 transitions. [2025-01-10 06:03:05,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:03:05,656 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 1 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 101 [2025-01-10 06:03:05,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:03:05,658 INFO L225 Difference]: With dead ends: 719 [2025-01-10 06:03:05,658 INFO L226 Difference]: Without dead ends: 417 [2025-01-10 06:03:05,659 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-01-10 06:03:05,659 INFO L435 NwaCegarLoop]: 338 mSDtfsCounter, 0 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:03:05,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 672 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:03:05,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2025-01-10 06:03:05,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 417. [2025-01-10 06:03:05,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 370 states have (on average 1.327027027027027) internal successors, (491), 386 states have internal predecessors, (491), 25 states have call successors, (25), 12 states have call predecessors, (25), 12 states have return successors, (21), 19 states have call predecessors, (21), 19 states have call successors, (21) [2025-01-10 06:03:05,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 537 transitions. [2025-01-10 06:03:05,676 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 537 transitions. Word has length 101 [2025-01-10 06:03:05,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:03:05,676 INFO L471 AbstractCegarLoop]: Abstraction has 417 states and 537 transitions. [2025-01-10 06:03:05,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 06:03:05,676 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 537 transitions. [2025-01-10 06:03:05,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-10 06:03:05,677 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:03:05,677 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-01-10 06:03:05,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 06:03:05,677 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting getoptErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-01-10 06:03:05,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:03:05,678 INFO L85 PathProgramCache]: Analyzing trace with hash 462597047, now seen corresponding path program 1 times [2025-01-10 06:03:05,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:03:05,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379073606] [2025-01-10 06:03:05,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:03:05,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:03:06,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-10 06:03:06,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-10 06:03:06,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:03:06,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:03:06,631 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2025-01-10 06:03:06,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:03:06,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379073606] [2025-01-10 06:03:06,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379073606] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:03:06,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:03:06,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:03:06,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500620889] [2025-01-10 06:03:06,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:03:06,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:03:06,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:03:06,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:03:06,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:03:06,632 INFO L87 Difference]: Start difference. First operand 417 states and 537 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-01-10 06:03:06,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:03:06,962 INFO L93 Difference]: Finished difference Result 817 states and 1072 transitions. [2025-01-10 06:03:06,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:03:06,963 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-01-10 06:03:06,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:03:06,966 INFO L225 Difference]: With dead ends: 817 [2025-01-10 06:03:06,966 INFO L226 Difference]: Without dead ends: 815 [2025-01-10 06:03:06,967 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-01-10 06:03:06,967 INFO L435 NwaCegarLoop]: 327 mSDtfsCounter, 604 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 604 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 06:03:06,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [604 Valid, 891 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 06:03:06,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2025-01-10 06:03:06,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 489. [2025-01-10 06:03:06,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 437 states have (on average 1.3501144164759726) internal successors, (590), 454 states have internal predecessors, (590), 27 states have call successors, (27), 14 states have call predecessors, (27), 15 states have return successors, (25), 21 states have call predecessors, (25), 21 states have call successors, (25) [2025-01-10 06:03:06,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 642 transitions. [2025-01-10 06:03:06,985 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 642 transitions. Word has length 101 [2025-01-10 06:03:06,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:03:06,986 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 642 transitions. [2025-01-10 06:03:06,986 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-01-10 06:03:06,986 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 642 transitions. [2025-01-10 06:03:06,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-10 06:03:06,987 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:03:06,987 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-01-10 06:03:06,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 06:03:06,987 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-01-10 06:03:06,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:03:06,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1098596571, now seen corresponding path program 1 times [2025-01-10 06:03:06,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:03:06,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224163971] [2025-01-10 06:03:06,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:03:06,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:03:07,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-10 06:03:07,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-10 06:03:07,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:03:07,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:03:07,795 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-01-10 06:03:07,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:03:07,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224163971] [2025-01-10 06:03:07,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224163971] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:03:07,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:03:07,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:03:07,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914291516] [2025-01-10 06:03:07,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:03:07,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:03:07,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:03:07,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:03:07,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:03:07,796 INFO L87 Difference]: Start difference. First operand 489 states and 642 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-01-10 06:03:07,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:03:07,879 INFO L93 Difference]: Finished difference Result 500 states and 652 transitions. [2025-01-10 06:03:07,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:03:07,880 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-01-10 06:03:07,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:03:07,882 INFO L225 Difference]: With dead ends: 500 [2025-01-10 06:03:07,883 INFO L226 Difference]: Without dead ends: 497 [2025-01-10 06:03:07,883 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:03:07,884 INFO L435 NwaCegarLoop]: 335 mSDtfsCounter, 13 mSDsluCounter, 1000 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1335 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:03:07,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1335 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:03:07,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2025-01-10 06:03:07,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 494. [2025-01-10 06:03:07,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 441 states have (on average 1.3492063492063493) internal successors, (595), 458 states have internal predecessors, (595), 27 states have call successors, (27), 15 states have call predecessors, (27), 16 states have return successors, (25), 21 states have call predecessors, (25), 21 states have call successors, (25) [2025-01-10 06:03:07,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 647 transitions. [2025-01-10 06:03:07,914 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 647 transitions. Word has length 102 [2025-01-10 06:03:07,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:03:07,914 INFO L471 AbstractCegarLoop]: Abstraction has 494 states and 647 transitions. [2025-01-10 06:03:07,914 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-01-10 06:03:07,915 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 647 transitions. [2025-01-10 06:03:07,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-10 06:03:07,916 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:03:07,916 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-01-10 06:03:07,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-10 06:03:07,917 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-01-10 06:03:07,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:03:07,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1098598493, now seen corresponding path program 1 times [2025-01-10 06:03:07,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:03:07,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355637351] [2025-01-10 06:03:07,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:03:07,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:03:08,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-10 06:03:08,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-10 06:03:08,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:03:08,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:03:08,966 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-01-10 06:03:08,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:03:08,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355637351] [2025-01-10 06:03:08,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355637351] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:03:08,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:03:08,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:03:08,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840749667] [2025-01-10 06:03:08,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:03:08,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:03:08,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:03:08,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:03:08,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:03:08,968 INFO L87 Difference]: Start difference. First operand 494 states and 647 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-01-10 06:03:09,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:03:09,151 INFO L93 Difference]: Finished difference Result 866 states and 1175 transitions. [2025-01-10 06:03:09,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:03:09,151 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-01-10 06:03:09,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:03:09,154 INFO L225 Difference]: With dead ends: 866 [2025-01-10 06:03:09,154 INFO L226 Difference]: Without dead ends: 711 [2025-01-10 06:03:09,155 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-01-10 06:03:09,155 INFO L435 NwaCegarLoop]: 376 mSDtfsCounter, 172 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 1067 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:03:09,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 1067 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:03:09,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2025-01-10 06:03:09,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 619. [2025-01-10 06:03:09,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 563 states have (on average 1.3907637655417406) internal successors, (783), 580 states have internal predecessors, (783), 30 states have call successors, (30), 15 states have call predecessors, (30), 16 states have return successors, (32), 24 states have call predecessors, (32), 24 states have call successors, (32) [2025-01-10 06:03:09,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 845 transitions. [2025-01-10 06:03:09,174 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 845 transitions. Word has length 102 [2025-01-10 06:03:09,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:03:09,175 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 845 transitions. [2025-01-10 06:03:09,175 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-01-10 06:03:09,175 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 845 transitions. [2025-01-10 06:03:09,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-10 06:03:09,176 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:03:09,176 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-01-10 06:03:09,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-10 06:03:09,176 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-01-10 06:03:09,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:03:09,176 INFO L85 PathProgramCache]: Analyzing trace with hash 859390874, now seen corresponding path program 1 times [2025-01-10 06:03:09,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:03:09,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027491467] [2025-01-10 06:03:09,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:03:09,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:03:09,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-10 06:03:09,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-10 06:03:09,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:03:09,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:03:09,961 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-01-10 06:03:09,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:03:09,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027491467] [2025-01-10 06:03:09,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027491467] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:03:09,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:03:09,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:03:09,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582303364] [2025-01-10 06:03:09,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:03:09,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:03:09,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:03:09,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:03:09,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:03:09,964 INFO L87 Difference]: Start difference. First operand 619 states and 845 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-01-10 06:03:10,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:03:10,079 INFO L93 Difference]: Finished difference Result 1143 states and 1597 transitions. [2025-01-10 06:03:10,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:03:10,080 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-01-10 06:03:10,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:03:10,083 INFO L225 Difference]: With dead ends: 1143 [2025-01-10 06:03:10,083 INFO L226 Difference]: Without dead ends: 637 [2025-01-10 06:03:10,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:03:10,085 INFO L435 NwaCegarLoop]: 337 mSDtfsCounter, 0 mSDsluCounter, 998 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1335 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:03:10,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1335 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:03:10,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2025-01-10 06:03:10,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 633. [2025-01-10 06:03:10,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 574 states have (on average 1.3832752613240418) internal successors, (794), 590 states have internal predecessors, (794), 30 states have call successors, (30), 15 states have call predecessors, (30), 19 states have return successors, (38), 28 states have call predecessors, (38), 24 states have call successors, (38) [2025-01-10 06:03:10,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 862 transitions. [2025-01-10 06:03:10,120 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 862 transitions. Word has length 101 [2025-01-10 06:03:10,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:03:10,120 INFO L471 AbstractCegarLoop]: Abstraction has 633 states and 862 transitions. [2025-01-10 06:03:10,120 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-01-10 06:03:10,121 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 862 transitions. [2025-01-10 06:03:10,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-10 06:03:10,122 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:03:10,122 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-01-10 06:03:10,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-10 06:03:10,122 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-01-10 06:03:10,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:03:10,123 INFO L85 PathProgramCache]: Analyzing trace with hash -541504591, now seen corresponding path program 1 times [2025-01-10 06:03:10,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:03:10,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045257840] [2025-01-10 06:03:10,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:03:10,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:03:10,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-10 06:03:10,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-10 06:03:10,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:03:10,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:03:11,481 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-01-10 06:03:11,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:03:11,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045257840] [2025-01-10 06:03:11,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045257840] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:03:11,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:03:11,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:03:11,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164036598] [2025-01-10 06:03:11,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:03:11,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:03:11,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:03:11,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:03:11,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:03:11,483 INFO L87 Difference]: Start difference. First operand 633 states and 862 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-01-10 06:03:15,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-10 06:03:19,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-10 06:03:20,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:03:20,327 INFO L93 Difference]: Finished difference Result 875 states and 1192 transitions. [2025-01-10 06:03:20,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:03:20,328 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-01-10 06:03:20,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:03:20,331 INFO L225 Difference]: With dead ends: 875 [2025-01-10 06:03:20,331 INFO L226 Difference]: Without dead ends: 729 [2025-01-10 06:03:20,332 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-01-10 06:03:20,333 INFO L435 NwaCegarLoop]: 428 mSDtfsCounter, 443 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 11 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 1088 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2025-01-10 06:03:20,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 1088 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 150 Invalid, 2 Unknown, 0 Unchecked, 8.7s Time] [2025-01-10 06:03:20,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2025-01-10 06:03:20,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 647. [2025-01-10 06:03:20,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 587 states have (on average 1.3816013628620103) internal successors, (811), 603 states have internal predecessors, (811), 31 states have call successors, (31), 15 states have call predecessors, (31), 19 states have return successors, (39), 29 states have call predecessors, (39), 25 states have call successors, (39) [2025-01-10 06:03:20,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 881 transitions. [2025-01-10 06:03:20,359 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 881 transitions. Word has length 103 [2025-01-10 06:03:20,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:03:20,360 INFO L471 AbstractCegarLoop]: Abstraction has 647 states and 881 transitions. [2025-01-10 06:03:20,360 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-01-10 06:03:20,360 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 881 transitions. [2025-01-10 06:03:20,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-10 06:03:20,361 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:03:20,361 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-01-10 06:03:20,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-10 06:03:20,361 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-01-10 06:03:20,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:03:20,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1128310605, now seen corresponding path program 1 times [2025-01-10 06:03:20,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:03:20,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617482316] [2025-01-10 06:03:20,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:03:20,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:03:20,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-10 06:03:20,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-10 06:03:20,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:03:20,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:03:23,555 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-01-10 06:03:23,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:03:23,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617482316] [2025-01-10 06:03:23,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617482316] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:03:23,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:03:23,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-10 06:03:23,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542229558] [2025-01-10 06:03:23,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:03:23,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 06:03:23,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:03:23,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 06:03:23,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-01-10 06:03:23,556 INFO L87 Difference]: Start difference. First operand 647 states and 881 transitions. Second operand has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 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-01-10 06:03:27,580 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-01-10 06:03:31,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-10 06:03:35,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-10 06:03:39,687 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 [] [2025-01-10 06:03:43,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-10 06:03:46,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:03:46,190 INFO L93 Difference]: Finished difference Result 1175 states and 1605 transitions. [2025-01-10 06:03:46,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 06:03:46,191 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 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) Word has length 103 [2025-01-10 06:03:46,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:03:46,195 INFO L225 Difference]: With dead ends: 1175 [2025-01-10 06:03:46,195 INFO L226 Difference]: Without dead ends: 1029 [2025-01-10 06:03:46,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2025-01-10 06:03:46,196 INFO L435 NwaCegarLoop]: 493 mSDtfsCounter, 857 mSDsluCounter, 2809 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 53 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 867 SdHoareTripleChecker+Valid, 3302 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.4s IncrementalHoareTripleChecker+Time [2025-01-10 06:03:46,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [867 Valid, 3302 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 760 Invalid, 5 Unknown, 0 Unchecked, 22.4s Time] [2025-01-10 06:03:46,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2025-01-10 06:03:46,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 735. [2025-01-10 06:03:46,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 735 states, 673 states have (on average 1.3982169390787518) internal successors, (941), 687 states have internal predecessors, (941), 33 states have call successors, (33), 15 states have call predecessors, (33), 19 states have return successors, (47), 33 states have call predecessors, (47), 27 states have call successors, (47) [2025-01-10 06:03:46,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 1021 transitions. [2025-01-10 06:03:46,244 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 1021 transitions. Word has length 103 [2025-01-10 06:03:46,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:03:46,245 INFO L471 AbstractCegarLoop]: Abstraction has 735 states and 1021 transitions. [2025-01-10 06:03:46,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 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-01-10 06:03:46,245 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 1021 transitions. [2025-01-10 06:03:46,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-10 06:03:46,246 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:03:46,246 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, 1, 1, 1, 1] [2025-01-10 06:03:46,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-10 06:03:46,247 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-01-10 06:03:46,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:03:46,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1765361573, now seen corresponding path program 1 times [2025-01-10 06:03:46,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:03:46,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716659124] [2025-01-10 06:03:46,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:03:46,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:03:46,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-10 06:03:46,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-10 06:03:46,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:03:46,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:03:47,053 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2025-01-10 06:03:47,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:03:47,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716659124] [2025-01-10 06:03:47,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716659124] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:03:47,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:03:47,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:03:47,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638004753] [2025-01-10 06:03:47,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:03:47,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:03:47,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:03:47,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:03:47,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:03:47,056 INFO L87 Difference]: Start difference. First operand 735 states and 1021 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 06:03:47,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:03:47,143 INFO L93 Difference]: Finished difference Result 1374 states and 1970 transitions. [2025-01-10 06:03:47,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:03:47,144 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 105 [2025-01-10 06:03:47,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:03:47,146 INFO L225 Difference]: With dead ends: 1374 [2025-01-10 06:03:47,147 INFO L226 Difference]: Without dead ends: 752 [2025-01-10 06:03:47,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:03:47,148 INFO L435 NwaCegarLoop]: 335 mSDtfsCounter, 8 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:03:47,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 992 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:03:47,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2025-01-10 06:03:47,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 746. [2025-01-10 06:03:47,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 746 states, 684 states have (on average 1.391812865497076) internal successors, (952), 698 states have internal predecessors, (952), 33 states have call successors, (33), 15 states have call predecessors, (33), 19 states have return successors, (47), 33 states have call predecessors, (47), 27 states have call successors, (47) [2025-01-10 06:03:47,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1032 transitions. [2025-01-10 06:03:47,174 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1032 transitions. Word has length 105 [2025-01-10 06:03:47,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:03:47,174 INFO L471 AbstractCegarLoop]: Abstraction has 746 states and 1032 transitions. [2025-01-10 06:03:47,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 06:03:47,175 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1032 transitions. [2025-01-10 06:03:47,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-10 06:03:47,175 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:03:47,175 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, 1, 1, 1] [2025-01-10 06:03:47,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-10 06:03:47,176 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 51 more)] === [2025-01-10 06:03:47,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:03:47,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1102065791, now seen corresponding path program 1 times [2025-01-10 06:03:47,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:03:47,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937748543] [2025-01-10 06:03:47,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:03:47,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:03:47,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-10 06:03:47,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-10 06:03:47,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:03:47,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:03:48,230 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2025-01-10 06:03:48,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:03:48,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937748543] [2025-01-10 06:03:48,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937748543] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:03:48,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429197105] [2025-01-10 06:03:48,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:03:48,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:03:48,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:03:48,235 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:03:48,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 06:03:49,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-10 06:03:49,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-10 06:03:49,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:03:49,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:03:49,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 2310 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 06:03:49,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:03:50,702 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2025-01-10 06:03:50,702 INFO L312 TraceCheckSpWp]: Computing backward predicates...