./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/readlink-1.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/readlink-1.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 990b71a8318a9381d9db0e6d81697b685ad4c408107fd3f1c2acfe3caabf2a23 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:03:56,921 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:03:56,969 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:03:56,972 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:03:56,973 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:03:56,990 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:03:56,991 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:03:56,991 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:03:56,991 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:03:56,991 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:03:56,991 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:03:56,991 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:03:56,992 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:03:56,992 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:03:56,992 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:03:56,992 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:03:56,992 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:03:56,992 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:03:56,992 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:03:56,992 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:03:56,993 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:03:56,993 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:03:56,993 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:03:56,993 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:03:56,993 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:03:56,993 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:03:56,993 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:03:56,993 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:03:56,993 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:03:56,993 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:03:56,993 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:03:56,994 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:03:56,994 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:03:56,994 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:03:56,994 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:03:56,994 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:03:56,994 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:03:56,994 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:03:56,994 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:03:56,994 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:03:56,994 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:03:56,994 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:03:56,994 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:03:56,994 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:03:56,994 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:03:56,994 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:03:56,994 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:03:56,994 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 -> 990b71a8318a9381d9db0e6d81697b685ad4c408107fd3f1c2acfe3caabf2a23 [2025-01-10 06:03:57,256 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:03:57,269 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:03:57,273 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:03:57,274 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:03:57,275 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:03:57,276 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/readlink-1.i [2025-01-10 06:03:58,583 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/552e96d6c/cde484853f8c4473aa98bec703e5864d/FLAG60914cecc [2025-01-10 06:03:59,231 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:03:59,232 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/readlink-1.i [2025-01-10 06:03:59,268 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/552e96d6c/cde484853f8c4473aa98bec703e5864d/FLAG60914cecc [2025-01-10 06:03:59,686 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/552e96d6c/cde484853f8c4473aa98bec703e5864d [2025-01-10 06:03:59,689 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:03:59,690 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:03:59,691 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:03:59,691 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:03:59,695 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:03:59,696 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:03:59" (1/1) ... [2025-01-10 06:03:59,697 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bdb535f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:03:59, skipping insertion in model container [2025-01-10 06:03:59,697 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:03:59" (1/1) ... [2025-01-10 06:03:59,743 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:04:00,650 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:04:00,686 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:04:00,856 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:04:01,018 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-01-10 06:04:01,032 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:04:01,033 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:04:01 WrapperNode [2025-01-10 06:04:01,033 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:04:01,034 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:04:01,034 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:04:01,034 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:04:01,047 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:04:01" (1/1) ... [2025-01-10 06:04:01,088 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:04:01" (1/1) ... [2025-01-10 06:04:01,153 INFO L138 Inliner]: procedures = 575, calls = 732, calls flagged for inlining = 29, calls inlined = 27, statements flattened = 1939 [2025-01-10 06:04:01,154 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:04:01,155 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:04:01,155 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:04:01,155 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:04:01,162 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:04:01" (1/1) ... [2025-01-10 06:04:01,162 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:04:01" (1/1) ... [2025-01-10 06:04:01,173 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:04:01" (1/1) ... [2025-01-10 06:04:01,223 INFO L175 MemorySlicer]: Split 616 memory accesses to 22 slices as follows [2, 3, 3, 3, 38, 3, 29, 4, 15, 17, 44, 2, 9, 3, 17, 17, 355, 15, 3, 23, 4, 7]. 58 percent of accesses are in the largest equivalence class. The 384 initializations are split as follows [2, 0, 3, 0, 9, 3, 2, 4, 0, 1, 0, 0, 1, 0, 0, 4, 355, 0, 0, 0, 0, 0]. The 98 writes are split as follows [0, 0, 0, 0, 0, 0, 19, 0, 1, 15, 12, 1, 4, 0, 17, 4, 0, 3, 0, 11, 4, 7]. [2025-01-10 06:04:01,224 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:04:01" (1/1) ... [2025-01-10 06:04:01,224 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:04:01" (1/1) ... [2025-01-10 06:04:01,280 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:04:01" (1/1) ... [2025-01-10 06:04:01,288 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:04:01" (1/1) ... [2025-01-10 06:04:01,305 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:04:01" (1/1) ... [2025-01-10 06:04:01,331 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:04:01" (1/1) ... [2025-01-10 06:04:01,341 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:04:01" (1/1) ... [2025-01-10 06:04:01,360 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:04:01,361 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:04:01,361 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:04:01,361 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:04:01,362 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:04:01" (1/1) ... [2025-01-10 06:04:01,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:04:01,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:04:01,397 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:04:01,404 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:04:01,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#0 [2025-01-10 06:04:01,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#1 [2025-01-10 06:04:01,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#2 [2025-01-10 06:04:01,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#3 [2025-01-10 06:04:01,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#4 [2025-01-10 06:04:01,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#5 [2025-01-10 06:04:01,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#6 [2025-01-10 06:04:01,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#7 [2025-01-10 06:04:01,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#8 [2025-01-10 06:04:01,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#9 [2025-01-10 06:04:01,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#10 [2025-01-10 06:04:01,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#11 [2025-01-10 06:04:01,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#12 [2025-01-10 06:04:01,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#13 [2025-01-10 06:04:01,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#14 [2025-01-10 06:04:01,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#15 [2025-01-10 06:04:01,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#16 [2025-01-10 06:04:01,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#17 [2025-01-10 06:04:01,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#18 [2025-01-10 06:04:01,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#19 [2025-01-10 06:04:01,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#20 [2025-01-10 06:04:01,431 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#21 [2025-01-10 06:04:01,431 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#0 [2025-01-10 06:04:01,431 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#1 [2025-01-10 06:04:01,431 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#2 [2025-01-10 06:04:01,431 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#3 [2025-01-10 06:04:01,431 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#4 [2025-01-10 06:04:01,431 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#5 [2025-01-10 06:04:01,431 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#6 [2025-01-10 06:04:01,431 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#7 [2025-01-10 06:04:01,431 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#8 [2025-01-10 06:04:01,431 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#9 [2025-01-10 06:04:01,431 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#10 [2025-01-10 06:04:01,431 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#11 [2025-01-10 06:04:01,431 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#12 [2025-01-10 06:04:01,431 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#13 [2025-01-10 06:04:01,432 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#14 [2025-01-10 06:04:01,432 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#15 [2025-01-10 06:04:01,432 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#16 [2025-01-10 06:04:01,432 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#17 [2025-01-10 06:04:01,432 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#18 [2025-01-10 06:04:01,432 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#19 [2025-01-10 06:04:01,432 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#20 [2025-01-10 06:04:01,432 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#21 [2025-01-10 06:04:01,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 06:04:01,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-01-10 06:04:01,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-01-10 06:04:01,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-01-10 06:04:01,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-01-10 06:04:01,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-01-10 06:04:01,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-01-10 06:04:01,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-01-10 06:04:01,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-01-10 06:04:01,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2025-01-10 06:04:01,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2025-01-10 06:04:01,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#10 [2025-01-10 06:04:01,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#11 [2025-01-10 06:04:01,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#12 [2025-01-10 06:04:01,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#13 [2025-01-10 06:04:01,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#14 [2025-01-10 06:04:01,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#15 [2025-01-10 06:04:01,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#16 [2025-01-10 06:04:01,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#17 [2025-01-10 06:04:01,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#18 [2025-01-10 06:04:01,433 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#19 [2025-01-10 06:04:01,433 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#20 [2025-01-10 06:04:01,433 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#21 [2025-01-10 06:04:01,433 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-01-10 06:04:01,433 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-01-10 06:04:01,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-01-10 06:04:01,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-01-10 06:04:01,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-01-10 06:04:01,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-01-10 06:04:01,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-01-10 06:04:01,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-01-10 06:04:01,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-01-10 06:04:01,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-01-10 06:04:01,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-01-10 06:04:01,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-01-10 06:04:01,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-01-10 06:04:01,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-01-10 06:04:01,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-01-10 06:04:01,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-01-10 06:04:01,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-01-10 06:04:01,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-01-10 06:04:01,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-01-10 06:04:01,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-01-10 06:04:01,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-01-10 06:04:01,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#19 [2025-01-10 06:04:01,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#20 [2025-01-10 06:04:01,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#21 [2025-01-10 06:04:01,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 06:04:01,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 06:04:01,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 06:04:01,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-10 06:04:01,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-10 06:04:01,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-10 06:04:01,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-10 06:04:01,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-01-10 06:04:01,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-01-10 06:04:01,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-01-10 06:04:01,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-01-10 06:04:01,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-01-10 06:04:01,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-01-10 06:04:01,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-01-10 06:04:01,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-01-10 06:04:01,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-01-10 06:04:01,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-01-10 06:04:01,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-01-10 06:04:01,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-01-10 06:04:01,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-01-10 06:04:01,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#20 [2025-01-10 06:04:01,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#21 [2025-01-10 06:04:01,438 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 06:04:01,438 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:04:01,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-10 06:04:01,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-10 06:04:01,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-10 06:04:01,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-10 06:04:01,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-01-10 06:04:01,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-01-10 06:04:01,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-01-10 06:04:01,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-01-10 06:04:01,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-01-10 06:04:01,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-01-10 06:04:01,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-01-10 06:04:01,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-01-10 06:04:01,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-01-10 06:04:01,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-01-10 06:04:01,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-01-10 06:04:01,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-01-10 06:04:01,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-01-10 06:04:01,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-01-10 06:04:01,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-01-10 06:04:01,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2025-01-10 06:04:01,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#20 [2025-01-10 06:04:01,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#21 [2025-01-10 06:04:01,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:04:01,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:04:01,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#0 [2025-01-10 06:04:01,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#1 [2025-01-10 06:04:01,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#2 [2025-01-10 06:04:01,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#3 [2025-01-10 06:04:01,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#4 [2025-01-10 06:04:01,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#5 [2025-01-10 06:04:01,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#6 [2025-01-10 06:04:01,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#7 [2025-01-10 06:04:01,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#8 [2025-01-10 06:04:01,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#9 [2025-01-10 06:04:01,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#10 [2025-01-10 06:04:01,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#11 [2025-01-10 06:04:01,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#12 [2025-01-10 06:04:01,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#13 [2025-01-10 06:04:01,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#14 [2025-01-10 06:04:01,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#15 [2025-01-10 06:04:01,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#16 [2025-01-10 06:04:01,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#17 [2025-01-10 06:04:01,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#18 [2025-01-10 06:04:01,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#19 [2025-01-10 06:04:01,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#20 [2025-01-10 06:04:01,440 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#21 [2025-01-10 06:04:01,440 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#0 [2025-01-10 06:04:01,440 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#1 [2025-01-10 06:04:01,440 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#2 [2025-01-10 06:04:01,440 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#3 [2025-01-10 06:04:01,440 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#4 [2025-01-10 06:04:01,440 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#5 [2025-01-10 06:04:01,440 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#6 [2025-01-10 06:04:01,440 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#7 [2025-01-10 06:04:01,440 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#8 [2025-01-10 06:04:01,440 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#9 [2025-01-10 06:04:01,440 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#10 [2025-01-10 06:04:01,440 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#11 [2025-01-10 06:04:01,440 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#12 [2025-01-10 06:04:01,440 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#13 [2025-01-10 06:04:01,443 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#14 [2025-01-10 06:04:01,443 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#15 [2025-01-10 06:04:01,443 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#16 [2025-01-10 06:04:01,443 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#17 [2025-01-10 06:04:01,443 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#18 [2025-01-10 06:04:01,443 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#19 [2025-01-10 06:04:01,443 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#20 [2025-01-10 06:04:01,443 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#21 [2025-01-10 06:04:01,443 INFO L130 BoogieDeclarations]: Found specification of procedure xmalloc [2025-01-10 06:04:01,444 INFO L138 BoogieDeclarations]: Found implementation of procedure xmalloc [2025-01-10 06:04:01,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-01-10 06:04:01,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-01-10 06:04:01,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-01-10 06:04:01,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-01-10 06:04:01,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-01-10 06:04:01,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-01-10 06:04:01,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-01-10 06:04:01,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-01-10 06:04:01,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2025-01-10 06:04:01,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2025-01-10 06:04:01,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#10 [2025-01-10 06:04:01,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#11 [2025-01-10 06:04:01,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#12 [2025-01-10 06:04:01,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#13 [2025-01-10 06:04:01,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#14 [2025-01-10 06:04:01,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#15 [2025-01-10 06:04:01,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#16 [2025-01-10 06:04:01,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#17 [2025-01-10 06:04:01,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#18 [2025-01-10 06:04:01,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#19 [2025-01-10 06:04:01,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#20 [2025-01-10 06:04:01,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#21 [2025-01-10 06:04:01,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-01-10 06:04:01,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-01-10 06:04:01,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-01-10 06:04:01,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-01-10 06:04:01,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-01-10 06:04:01,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-01-10 06:04:01,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-01-10 06:04:01,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-01-10 06:04:01,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-01-10 06:04:01,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-01-10 06:04:01,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-01-10 06:04:01,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-01-10 06:04:01,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-01-10 06:04:01,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-01-10 06:04:01,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-01-10 06:04:01,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-01-10 06:04:01,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-01-10 06:04:01,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#17 [2025-01-10 06:04:01,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#18 [2025-01-10 06:04:01,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#19 [2025-01-10 06:04:01,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#20 [2025-01-10 06:04:01,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#21 [2025-01-10 06:04:01,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-01-10 06:04:01,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-01-10 06:04:01,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-01-10 06:04:01,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2025-01-10 06:04:01,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2025-01-10 06:04:01,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#5 [2025-01-10 06:04:01,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#6 [2025-01-10 06:04:01,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#7 [2025-01-10 06:04:01,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#8 [2025-01-10 06:04:01,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#9 [2025-01-10 06:04:01,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#10 [2025-01-10 06:04:01,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#11 [2025-01-10 06:04:01,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#12 [2025-01-10 06:04:01,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#13 [2025-01-10 06:04:01,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#14 [2025-01-10 06:04:01,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#15 [2025-01-10 06:04:01,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#16 [2025-01-10 06:04:01,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#17 [2025-01-10 06:04:01,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#18 [2025-01-10 06:04:01,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#19 [2025-01-10 06:04:01,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#20 [2025-01-10 06:04:01,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#21 [2025-01-10 06:04:01,446 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-01-10 06:04:01,446 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-01-10 06:04:01,446 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-01-10 06:04:01,446 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2025-01-10 06:04:01,446 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2025-01-10 06:04:01,446 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#5 [2025-01-10 06:04:01,446 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#6 [2025-01-10 06:04:01,446 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#7 [2025-01-10 06:04:01,449 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#8 [2025-01-10 06:04:01,449 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#9 [2025-01-10 06:04:01,449 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#10 [2025-01-10 06:04:01,449 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#11 [2025-01-10 06:04:01,449 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#12 [2025-01-10 06:04:01,449 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#13 [2025-01-10 06:04:01,449 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#14 [2025-01-10 06:04:01,449 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#15 [2025-01-10 06:04:01,449 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#16 [2025-01-10 06:04:01,449 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#17 [2025-01-10 06:04:01,449 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#18 [2025-01-10 06:04:01,449 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#19 [2025-01-10 06:04:01,449 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#20 [2025-01-10 06:04:01,449 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#21 [2025-01-10 06:04:01,449 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-10 06:04:01,449 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-10 06:04:01,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 06:04:01,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-10 06:04:01,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-10 06:04:01,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-10 06:04:01,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-10 06:04:01,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-01-10 06:04:01,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-01-10 06:04:01,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-01-10 06:04:01,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-01-10 06:04:01,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-01-10 06:04:01,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-01-10 06:04:01,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-01-10 06:04:01,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-01-10 06:04:01,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-01-10 06:04:01,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-01-10 06:04:01,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-01-10 06:04:01,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-01-10 06:04:01,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-01-10 06:04:01,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-01-10 06:04:01,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-01-10 06:04:01,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2025-01-10 06:04:01,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#20 [2025-01-10 06:04:01,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#21 [2025-01-10 06:04:01,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-10 06:04:01,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-10 06:04:01,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-10 06:04:01,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-01-10 06:04:01,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-01-10 06:04:01,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-01-10 06:04:01,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-01-10 06:04:01,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-01-10 06:04:01,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-01-10 06:04:01,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-01-10 06:04:01,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-01-10 06:04:01,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-01-10 06:04:01,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-01-10 06:04:01,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-01-10 06:04:01,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-01-10 06:04:01,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-01-10 06:04:01,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-01-10 06:04:01,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-01-10 06:04:01,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2025-01-10 06:04:01,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2025-01-10 06:04:01,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#20 [2025-01-10 06:04:01,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#21 [2025-01-10 06:04:01,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 06:04:01,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 06:04:01,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 06:04:01,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-10 06:04:01,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-10 06:04:01,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-10 06:04:01,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-10 06:04:01,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-01-10 06:04:01,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-01-10 06:04:01,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-01-10 06:04:01,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-01-10 06:04:01,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-01-10 06:04:01,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-01-10 06:04:01,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-01-10 06:04:01,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-01-10 06:04:01,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-01-10 06:04:01,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-01-10 06:04:01,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-01-10 06:04:01,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-01-10 06:04:01,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-01-10 06:04:01,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#20 [2025-01-10 06:04:01,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#21 [2025-01-10 06:04:01,453 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg_and_die [2025-01-10 06:04:01,453 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg_and_die [2025-01-10 06:04:01,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:04:01,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 06:04:01,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 06:04:01,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-10 06:04:01,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-10 06:04:01,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-10 06:04:01,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-10 06:04:01,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-10 06:04:01,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-10 06:04:01,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-10 06:04:01,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-10 06:04:01,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-10 06:04:01,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-01-10 06:04:01,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-01-10 06:04:01,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-01-10 06:04:01,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-01-10 06:04:01,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-01-10 06:04:01,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-01-10 06:04:01,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-01-10 06:04:01,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-01-10 06:04:01,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#20 [2025-01-10 06:04:01,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#21 [2025-01-10 06:04:01,958 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:04:01,961 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:04:07,960 INFO L? ?]: Removed 852 outVars from TransFormulas that were not future-live. [2025-01-10 06:04:07,960 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:04:07,977 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:04:07,978 INFO L312 CfgBuilder]: Removed 47 assume(true) statements. [2025-01-10 06:04:07,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:04:07 BoogieIcfgContainer [2025-01-10 06:04:07,978 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:04:07,980 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:04:07,980 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:04:07,983 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:04:07,983 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:03:59" (1/3) ... [2025-01-10 06:04:07,984 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40ea3bcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:04:07, skipping insertion in model container [2025-01-10 06:04:07,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:04:01" (2/3) ... [2025-01-10 06:04:07,984 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40ea3bcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:04:07, skipping insertion in model container [2025-01-10 06:04:07,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:04:07" (3/3) ... [2025-01-10 06:04:07,985 INFO L128 eAbstractionObserver]: Analyzing ICFG readlink-1.i [2025-01-10 06:04:07,995 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:04:07,998 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG readlink-1.i that has 71 procedures, 782 locations, 1 initial locations, 74 loop locations, and 73 error locations. [2025-01-10 06:04:08,042 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:04:08,052 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;@19d35420, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:04:08,052 INFO L334 AbstractCegarLoop]: Starting to check reachability of 73 error locations. [2025-01-10 06:04:08,057 INFO L276 IsEmpty]: Start isEmpty. Operand has 546 states, 438 states have (on average 1.6529680365296804) internal successors, (724), 513 states have internal predecessors, (724), 23 states have call successors, (23), 11 states have call predecessors, (23), 11 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-10 06:04:08,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-10 06:04:08,061 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:08,061 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-10 06:04:08,061 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 70 more)] === [2025-01-10 06:04:08,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:08,065 INFO L85 PathProgramCache]: Analyzing trace with hash 26445572, now seen corresponding path program 1 times [2025-01-10 06:04:08,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:08,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446861860] [2025-01-10 06:04:08,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:08,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:08,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 06:04:08,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 06:04:08,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:08,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:08,843 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:04:08,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:08,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446861860] [2025-01-10 06:04:08,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446861860] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:04:08,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:04:08,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:04:08,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961530989] [2025-01-10 06:04:08,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:04:08,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:04:08,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:08,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:04:08,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:04:08,863 INFO L87 Difference]: Start difference. First operand has 546 states, 438 states have (on average 1.6529680365296804) internal successors, (724), 513 states have internal predecessors, (724), 23 states have call successors, (23), 11 states have call predecessors, (23), 11 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) 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:04:08,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:08,962 INFO L93 Difference]: Finished difference Result 983 states and 1417 transitions. [2025-01-10 06:04:08,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:04:08,967 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:04:08,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:08,983 INFO L225 Difference]: With dead ends: 983 [2025-01-10 06:04:08,987 INFO L226 Difference]: Without dead ends: 438 [2025-01-10 06:04:08,995 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:04:08,997 INFO L435 NwaCegarLoop]: 602 mSDtfsCounter, 1 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1199 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:04:09,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1199 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:04:09,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2025-01-10 06:04:09,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 438. [2025-01-10 06:04:09,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 366 states have (on average 1.5683060109289617) internal successors, (574), 416 states have internal predecessors, (574), 18 states have call successors, (18), 9 states have call predecessors, (18), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-10 06:04:09,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 604 transitions. [2025-01-10 06:04:09,051 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 604 transitions. Word has length 4 [2025-01-10 06:04:09,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:09,051 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 604 transitions. [2025-01-10 06:04:09,052 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:04:09,052 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 604 transitions. [2025-01-10 06:04:09,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-10 06:04:09,052 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:09,052 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-01-10 06:04:09,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:04:09,053 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 70 more)] === [2025-01-10 06:04:09,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:09,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1861883075, now seen corresponding path program 1 times [2025-01-10 06:04:09,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:09,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597031036] [2025-01-10 06:04:09,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:09,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:09,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:04:09,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:04:09,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:09,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:09,532 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:04:09,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:09,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597031036] [2025-01-10 06:04:09,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597031036] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:04:09,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471045877] [2025-01-10 06:04:09,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:09,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:09,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:04:09,535 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:04:09,537 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:04:10,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:04:10,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:04:10,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:10,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:10,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 1321 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 06:04:10,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:04:10,254 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:04:10,254 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:04:10,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1471045877] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:04:10,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:04:10,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-01-10 06:04:10,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710319917] [2025-01-10 06:04:10,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:04:10,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:04:10,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:10,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:04:10,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:04:10,256 INFO L87 Difference]: Start difference. First operand 438 states and 604 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:04:10,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:10,313 INFO L93 Difference]: Finished difference Result 438 states and 604 transitions. [2025-01-10 06:04:10,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:04:10,318 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:04:10,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:10,320 INFO L225 Difference]: With dead ends: 438 [2025-01-10 06:04:10,324 INFO L226 Difference]: Without dead ends: 437 [2025-01-10 06:04:10,325 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:04:10,326 INFO L435 NwaCegarLoop]: 595 mSDtfsCounter, 1 mSDsluCounter, 1188 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1783 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:10,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1783 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:04:10,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2025-01-10 06:04:10,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 437. [2025-01-10 06:04:10,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 366 states have (on average 1.5655737704918034) internal successors, (573), 415 states have internal predecessors, (573), 18 states have call successors, (18), 9 states have call predecessors, (18), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-10 06:04:10,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 603 transitions. [2025-01-10 06:04:10,367 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 603 transitions. Word has length 7 [2025-01-10 06:04:10,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:10,367 INFO L471 AbstractCegarLoop]: Abstraction has 437 states and 603 transitions. [2025-01-10 06:04:10,367 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:04:10,367 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 603 transitions. [2025-01-10 06:04:10,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 06:04:10,368 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:10,368 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-01-10 06:04:10,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-10 06:04:10,568 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:04:10,569 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 70 more)] === [2025-01-10 06:04:10,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:10,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1883801346, now seen corresponding path program 1 times [2025-01-10 06:04:10,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:10,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397617760] [2025-01-10 06:04:10,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:10,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:10,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:04:10,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:04:10,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:10,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:10,948 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:04:10,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:10,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397617760] [2025-01-10 06:04:10,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397617760] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:04:10,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:04:10,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:04:10,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404511466] [2025-01-10 06:04:10,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:04:10,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:04:10,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:10,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:04:10,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:04:10,949 INFO L87 Difference]: Start difference. First operand 437 states and 603 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:04:10,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:10,974 INFO L93 Difference]: Finished difference Result 437 states and 603 transitions. [2025-01-10 06:04:10,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:04:10,975 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:04:10,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:10,980 INFO L225 Difference]: With dead ends: 437 [2025-01-10 06:04:10,980 INFO L226 Difference]: Without dead ends: 436 [2025-01-10 06:04:10,980 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:04:10,981 INFO L435 NwaCegarLoop]: 596 mSDtfsCounter, 0 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1190 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:04:10,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1190 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:04:10,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2025-01-10 06:04:10,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 434. [2025-01-10 06:04:10,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 364 states have (on average 1.565934065934066) internal successors, (570), 412 states have internal predecessors, (570), 18 states have call successors, (18), 9 states have call predecessors, (18), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-10 06:04:10,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 600 transitions. [2025-01-10 06:04:10,993 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 600 transitions. Word has length 8 [2025-01-10 06:04:10,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:10,993 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 600 transitions. [2025-01-10 06:04:10,993 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:04:10,993 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 600 transitions. [2025-01-10 06:04:10,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-10 06:04:10,993 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:10,993 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:04:10,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:04:10,994 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 70 more)] === [2025-01-10 06:04:10,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:10,994 INFO L85 PathProgramCache]: Analyzing trace with hash 436766001, now seen corresponding path program 1 times [2025-01-10 06:04:10,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:10,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658171200] [2025-01-10 06:04:10,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:10,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:11,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:04:11,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:04:11,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:11,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:11,359 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:04:11,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:11,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658171200] [2025-01-10 06:04:11,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658171200] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:04:11,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559177061] [2025-01-10 06:04:11,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:11,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:11,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:04:11,361 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:04:11,363 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:04:11,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:04:11,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:04:11,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:11,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:11,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 1338 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 06:04:11,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:04:11,991 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:04:11,991 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:04:11,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [559177061] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:04:11,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:04:11,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-01-10 06:04:11,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331740817] [2025-01-10 06:04:11,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:04:11,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:04:11,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:11,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:04:11,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:04:11,993 INFO L87 Difference]: Start difference. First operand 434 states and 600 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:04:12,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:12,043 INFO L93 Difference]: Finished difference Result 434 states and 600 transitions. [2025-01-10 06:04:12,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:04:12,044 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:04:12,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:12,046 INFO L225 Difference]: With dead ends: 434 [2025-01-10 06:04:12,046 INFO L226 Difference]: Without dead ends: 432 [2025-01-10 06:04:12,046 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:04:12,047 INFO L435 NwaCegarLoop]: 588 mSDtfsCounter, 520 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:12,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [531 Valid, 649 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:04:12,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2025-01-10 06:04:12,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 432. [2025-01-10 06:04:12,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 364 states have (on average 1.5604395604395604) internal successors, (568), 410 states have internal predecessors, (568), 18 states have call successors, (18), 9 states have call predecessors, (18), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-10 06:04:12,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 598 transitions. [2025-01-10 06:04:12,062 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 598 transitions. Word has length 12 [2025-01-10 06:04:12,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:12,064 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 598 transitions. [2025-01-10 06:04:12,064 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:04:12,064 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 598 transitions. [2025-01-10 06:04:12,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-10 06:04:12,064 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:12,064 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:04:12,075 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:04:12,265 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:04:12,266 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 70 more)] === [2025-01-10 06:04:12,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:12,266 INFO L85 PathProgramCache]: Analyzing trace with hash 654845019, now seen corresponding path program 1 times [2025-01-10 06:04:12,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:12,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83408348] [2025-01-10 06:04:12,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:12,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:12,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:04:12,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:04:12,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:12,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:12,657 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:04:12,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:12,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83408348] [2025-01-10 06:04:12,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83408348] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:04:12,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460999263] [2025-01-10 06:04:12,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:12,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:12,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:04:12,660 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:04:12,662 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:04:13,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:04:13,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:04:13,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:13,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:13,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 1339 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 06:04:13,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:04:13,304 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:04:13,305 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:04:13,350 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:04:13,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460999263] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:04:13,350 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:04:13,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-10 06:04:13,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869126029] [2025-01-10 06:04:13,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:04:13,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:04:13,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:13,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:04:13,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:04:13,352 INFO L87 Difference]: Start difference. First operand 432 states and 598 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:04:13,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:13,406 INFO L93 Difference]: Finished difference Result 867 states and 1201 transitions. [2025-01-10 06:04:13,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:04:13,407 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:04:13,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:13,408 INFO L225 Difference]: With dead ends: 867 [2025-01-10 06:04:13,408 INFO L226 Difference]: Without dead ends: 441 [2025-01-10 06:04:13,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 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:04:13,409 INFO L435 NwaCegarLoop]: 594 mSDtfsCounter, 4 mSDsluCounter, 1776 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2370 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:13,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2370 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:04:13,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2025-01-10 06:04:13,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 441. [2025-01-10 06:04:13,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 373 states have (on average 1.5469168900804289) internal successors, (577), 419 states have internal predecessors, (577), 18 states have call successors, (18), 9 states have call predecessors, (18), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-10 06:04:13,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 607 transitions. [2025-01-10 06:04:13,420 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 607 transitions. Word has length 13 [2025-01-10 06:04:13,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:13,420 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 607 transitions. [2025-01-10 06:04:13,421 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:04:13,421 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 607 transitions. [2025-01-10 06:04:13,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-10 06:04:13,421 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:13,421 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:04:13,431 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:04:13,625 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:04:13,625 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 70 more)] === [2025-01-10 06:04:13,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:13,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1038425828, now seen corresponding path program 2 times [2025-01-10 06:04:13,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:13,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109846229] [2025-01-10 06:04:13,626 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:04:13,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:13,795 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-01-10 06:04:13,821 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 22 statements. [2025-01-10 06:04:13,821 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:04:13,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:14,037 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:04:14,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:14,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109846229] [2025-01-10 06:04:14,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109846229] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:04:14,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:04:14,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:04:14,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143652661] [2025-01-10 06:04:14,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:04:14,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:04:14,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:14,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:04:14,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:04:14,038 INFO L87 Difference]: Start difference. First operand 441 states and 607 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:04:14,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:14,126 INFO L93 Difference]: Finished difference Result 441 states and 607 transitions. [2025-01-10 06:04:14,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:04:14,127 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:04:14,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:14,129 INFO L225 Difference]: With dead ends: 441 [2025-01-10 06:04:14,129 INFO L226 Difference]: Without dead ends: 439 [2025-01-10 06:04:14,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:04:14,130 INFO L435 NwaCegarLoop]: 583 mSDtfsCounter, 519 mSDsluCounter, 1215 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 530 SdHoareTripleChecker+Valid, 1798 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:14,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [530 Valid, 1798 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:04:14,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2025-01-10 06:04:14,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 439. [2025-01-10 06:04:14,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 373 states have (on average 1.5415549597855227) internal successors, (575), 417 states have internal predecessors, (575), 18 states have call successors, (18), 9 states have call predecessors, (18), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-10 06:04:14,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 605 transitions. [2025-01-10 06:04:14,140 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 605 transitions. Word has length 22 [2025-01-10 06:04:14,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:14,140 INFO L471 AbstractCegarLoop]: Abstraction has 439 states and 605 transitions. [2025-01-10 06:04:14,140 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:04:14,140 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 605 transitions. [2025-01-10 06:04:14,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-10 06:04:14,141 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:14,141 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:04:14,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:04:14,141 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 70 more)] === [2025-01-10 06:04:14,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:14,141 INFO L85 PathProgramCache]: Analyzing trace with hash -767329896, now seen corresponding path program 1 times [2025-01-10 06:04:14,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:14,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186739182] [2025-01-10 06:04:14,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:14,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:14,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 06:04:14,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 06:04:14,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:14,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:14,476 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:04:14,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:14,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186739182] [2025-01-10 06:04:14,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186739182] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:04:14,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:04:14,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:04:14,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253906167] [2025-01-10 06:04:14,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:04:14,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:04:14,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:14,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:04:14,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:04:14,477 INFO L87 Difference]: Start difference. First operand 439 states and 605 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:04:14,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:14,522 INFO L93 Difference]: Finished difference Result 861 states and 1194 transitions. [2025-01-10 06:04:14,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:04:14,522 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2025-01-10 06:04:14,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:14,524 INFO L225 Difference]: With dead ends: 861 [2025-01-10 06:04:14,524 INFO L226 Difference]: Without dead ends: 442 [2025-01-10 06:04:14,525 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:04:14,525 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 2 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1179 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:04:14,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1179 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:04:14,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2025-01-10 06:04:14,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 442. [2025-01-10 06:04:14,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 376 states have (on average 1.5372340425531914) internal successors, (578), 420 states have internal predecessors, (578), 18 states have call successors, (18), 9 states have call predecessors, (18), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-10 06:04:14,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 608 transitions. [2025-01-10 06:04:14,536 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 608 transitions. Word has length 27 [2025-01-10 06:04:14,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:14,537 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 608 transitions. [2025-01-10 06:04:14,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:04:14,537 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 608 transitions. [2025-01-10 06:04:14,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-10 06:04:14,537 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:14,537 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:04:14,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 06:04:14,538 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 70 more)] === [2025-01-10 06:04:14,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:14,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1983064519, now seen corresponding path program 1 times [2025-01-10 06:04:14,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:14,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495183468] [2025-01-10 06:04:14,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:14,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:14,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 06:04:14,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 06:04:14,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:14,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:14,844 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:04:14,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:14,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495183468] [2025-01-10 06:04:14,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495183468] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:04:14,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:04:14,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:04:14,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694530456] [2025-01-10 06:04:14,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:04:14,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:04:14,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:14,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:04:14,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:04:14,846 INFO L87 Difference]: Start difference. First operand 442 states and 608 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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:04:14,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:14,920 INFO L93 Difference]: Finished difference Result 747 states and 1053 transitions. [2025-01-10 06:04:14,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:04:14,920 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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 28 [2025-01-10 06:04:14,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:14,923 INFO L225 Difference]: With dead ends: 747 [2025-01-10 06:04:14,923 INFO L226 Difference]: Without dead ends: 745 [2025-01-10 06:04:14,923 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:04:14,924 INFO L435 NwaCegarLoop]: 587 mSDtfsCounter, 419 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 1166 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:14,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 1166 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:04:14,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2025-01-10 06:04:14,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 446. [2025-01-10 06:04:14,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 380 states have (on average 1.5342105263157895) internal successors, (583), 424 states have internal predecessors, (583), 18 states have call successors, (18), 9 states have call predecessors, (18), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-10 06:04:14,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 613 transitions. [2025-01-10 06:04:14,939 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 613 transitions. Word has length 28 [2025-01-10 06:04:14,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:14,940 INFO L471 AbstractCegarLoop]: Abstraction has 446 states and 613 transitions. [2025-01-10 06:04:14,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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:04:14,940 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 613 transitions. [2025-01-10 06:04:14,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-10 06:04:14,940 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:14,940 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:04:14,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 06:04:14,941 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 70 more)] === [2025-01-10 06:04:14,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:14,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1713816474, now seen corresponding path program 1 times [2025-01-10 06:04:14,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:14,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226817058] [2025-01-10 06:04:14,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:14,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:15,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 06:04:15,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 06:04:15,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:15,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:15,252 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-10 06:04:15,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:15,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226817058] [2025-01-10 06:04:15,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226817058] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:04:15,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:04:15,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:04:15,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681183817] [2025-01-10 06:04:15,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:04:15,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:04:15,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:15,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:04:15,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:04:15,254 INFO L87 Difference]: Start difference. First operand 446 states and 613 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:04:15,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:15,308 INFO L93 Difference]: Finished difference Result 459 states and 628 transitions. [2025-01-10 06:04:15,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:04:15,309 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2025-01-10 06:04:15,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:15,310 INFO L225 Difference]: With dead ends: 459 [2025-01-10 06:04:15,311 INFO L226 Difference]: Without dead ends: 457 [2025-01-10 06:04:15,311 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:04:15,311 INFO L435 NwaCegarLoop]: 590 mSDtfsCounter, 3 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1176 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.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:15,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1176 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:04:15,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2025-01-10 06:04:15,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 455. [2025-01-10 06:04:15,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 389 states have (on average 1.532133676092545) internal successors, (596), 433 states have internal predecessors, (596), 18 states have call successors, (18), 9 states have call predecessors, (18), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-10 06:04:15,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 626 transitions. [2025-01-10 06:04:15,324 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 626 transitions. Word has length 30 [2025-01-10 06:04:15,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:15,324 INFO L471 AbstractCegarLoop]: Abstraction has 455 states and 626 transitions. [2025-01-10 06:04:15,324 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:04:15,324 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 626 transitions. [2025-01-10 06:04:15,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-10 06:04:15,325 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:15,325 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:04:15,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 06:04:15,325 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 70 more)] === [2025-01-10 06:04:15,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:15,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1713816666, now seen corresponding path program 1 times [2025-01-10 06:04:15,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:15,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286833193] [2025-01-10 06:04:15,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:15,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:15,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 06:04:15,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 06:04:15,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:15,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:15,680 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:04:15,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:15,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286833193] [2025-01-10 06:04:15,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286833193] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:04:15,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637779293] [2025-01-10 06:04:15,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:15,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:15,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:04:15,683 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:04:15,687 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:04:16,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 06:04:16,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 06:04:16,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:16,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:16,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 1528 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 06:04:16,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:04:16,522 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:04:16,524 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:04:16,670 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:04:16,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637779293] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:04:16,671 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:04:16,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-01-10 06:04:16,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144158552] [2025-01-10 06:04:16,671 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:04:16,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 06:04:16,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:16,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 06:04:16,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-01-10 06:04:16,672 INFO L87 Difference]: Start difference. First operand 455 states and 626 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:04:16,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:16,882 INFO L93 Difference]: Finished difference Result 912 states and 1260 transitions. [2025-01-10 06:04:16,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 06:04:16,883 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:04:16,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:16,885 INFO L225 Difference]: With dead ends: 912 [2025-01-10 06:04:16,885 INFO L226 Difference]: Without dead ends: 472 [2025-01-10 06:04:16,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-01-10 06:04:16,889 INFO L435 NwaCegarLoop]: 586 mSDtfsCounter, 5 mSDsluCounter, 3504 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 4090 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:16,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 4090 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 06:04:16,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2025-01-10 06:04:16,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 472. [2025-01-10 06:04:16,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 407 states have (on average 1.5036855036855037) internal successors, (612), 450 states have internal predecessors, (612), 18 states have call successors, (18), 9 states have call predecessors, (18), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-10 06:04:16,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 642 transitions. [2025-01-10 06:04:16,905 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 642 transitions. Word has length 30 [2025-01-10 06:04:16,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:16,906 INFO L471 AbstractCegarLoop]: Abstraction has 472 states and 642 transitions. [2025-01-10 06:04:16,906 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:04:16,906 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 642 transitions. [2025-01-10 06:04:16,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-10 06:04:16,908 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:16,908 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:04:16,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-10 06:04:17,112 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,SelfDestructingSolverStorable9 [2025-01-10 06:04:17,112 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 70 more)] === [2025-01-10 06:04:17,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:17,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1580466762, now seen corresponding path program 1 times [2025-01-10 06:04:17,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:17,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632510149] [2025-01-10 06:04:17,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:17,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:17,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-10 06:04:17,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-10 06:04:17,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:17,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:17,426 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:04:17,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:17,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632510149] [2025-01-10 06:04:17,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632510149] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:04:17,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:04:17,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:04:17,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735612321] [2025-01-10 06:04:17,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:04:17,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:04:17,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:17,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:04:17,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:04:17,428 INFO L87 Difference]: Start difference. First operand 472 states and 642 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:04:17,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:17,454 INFO L93 Difference]: Finished difference Result 472 states and 642 transitions. [2025-01-10 06:04:17,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:04:17,455 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:04:17,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:17,458 INFO L225 Difference]: With dead ends: 472 [2025-01-10 06:04:17,458 INFO L226 Difference]: Without dead ends: 471 [2025-01-10 06:04:17,458 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:04:17,458 INFO L435 NwaCegarLoop]: 590 mSDtfsCounter, 0 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1177 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:04:17,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1177 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:04:17,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2025-01-10 06:04:17,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 467. [2025-01-10 06:04:17,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 403 states have (on average 1.5037220843672456) internal successors, (606), 445 states have internal predecessors, (606), 18 states have call successors, (18), 9 states have call predecessors, (18), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-10 06:04:17,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 636 transitions. [2025-01-10 06:04:17,473 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 636 transitions. Word has length 49 [2025-01-10 06:04:17,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:17,474 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 636 transitions. [2025-01-10 06:04:17,474 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:04:17,474 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 636 transitions. [2025-01-10 06:04:17,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-10 06:04:17,476 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:17,476 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, 1] [2025-01-10 06:04:17,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 06:04:17,476 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 70 more)] === [2025-01-10 06:04:17,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:17,477 INFO L85 PathProgramCache]: Analyzing trace with hash -2108522686, now seen corresponding path program 1 times [2025-01-10 06:04:17,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:17,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921969170] [2025-01-10 06:04:17,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:17,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:17,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-10 06:04:17,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-10 06:04:17,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:17,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:17,877 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:04:17,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:17,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921969170] [2025-01-10 06:04:17,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921969170] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:04:17,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [949691135] [2025-01-10 06:04:17,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:17,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:17,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:04:17,880 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:04:17,888 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:04:18,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-10 06:04:18,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-10 06:04:18,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:18,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:18,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 1640 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 06:04:18,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:04:18,874 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:04:18,874 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:04:18,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [949691135] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:04:18,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:04:18,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-01-10 06:04:18,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180078347] [2025-01-10 06:04:18,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:04:18,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:04:18,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:18,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:04:18,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:04:18,876 INFO L87 Difference]: Start difference. First operand 467 states and 636 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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:04:19,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:19,112 INFO L93 Difference]: Finished difference Result 770 states and 1079 transitions. [2025-01-10 06:04:19,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:04:19,113 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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 50 [2025-01-10 06:04:19,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:19,118 INFO L225 Difference]: With dead ends: 770 [2025-01-10 06:04:19,118 INFO L226 Difference]: Without dead ends: 769 [2025-01-10 06:04:19,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 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:04:19,121 INFO L435 NwaCegarLoop]: 1018 mSDtfsCounter, 837 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 851 SdHoareTripleChecker+Valid, 1602 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:19,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [851 Valid, 1602 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 06:04:19,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2025-01-10 06:04:19,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 466. [2025-01-10 06:04:19,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 403 states have (on average 1.501240694789082) internal successors, (605), 444 states have internal predecessors, (605), 18 states have call successors, (18), 9 states have call predecessors, (18), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-10 06:04:19,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 635 transitions. [2025-01-10 06:04:19,145 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 635 transitions. Word has length 50 [2025-01-10 06:04:19,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:19,145 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 635 transitions. [2025-01-10 06:04:19,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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:04:19,146 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 635 transitions. [2025-01-10 06:04:19,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-10 06:04:19,149 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:19,149 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:04:19,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-10 06:04:19,350 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,SelfDestructingSolverStorable11 [2025-01-10 06:04:19,351 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 70 more)] === [2025-01-10 06:04:19,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:19,351 INFO L85 PathProgramCache]: Analyzing trace with hash -939692912, now seen corresponding path program 1 times [2025-01-10 06:04:19,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:19,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101398881] [2025-01-10 06:04:19,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:19,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:19,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-10 06:04:19,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-10 06:04:19,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:19,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:19,817 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:04:19,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:19,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101398881] [2025-01-10 06:04:19,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101398881] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:04:19,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507716180] [2025-01-10 06:04:19,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:19,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:19,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:04:19,819 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:04:19,825 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:04:20,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-10 06:04:20,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-10 06:04:20,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:20,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:20,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 1641 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 06:04:20,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:04:20,599 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:04:20,599 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:04:20,644 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:04:20,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [507716180] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:04:20,644 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:04:20,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-01-10 06:04:20,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204788773] [2025-01-10 06:04:20,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:04:20,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:04:20,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:20,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:04:20,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:04:20,646 INFO L87 Difference]: Start difference. First operand 466 states and 635 transitions. Second operand has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 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:04:20,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:20,835 INFO L93 Difference]: Finished difference Result 1675 states and 2405 transitions. [2025-01-10 06:04:20,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:04:20,836 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 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 51 [2025-01-10 06:04:20,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:20,842 INFO L225 Difference]: With dead ends: 1675 [2025-01-10 06:04:20,842 INFO L226 Difference]: Without dead ends: 1674 [2025-01-10 06:04:20,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 98 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:04:20,843 INFO L435 NwaCegarLoop]: 584 mSDtfsCounter, 2508 mSDsluCounter, 2405 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2536 SdHoareTripleChecker+Valid, 2989 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:20,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2536 Valid, 2989 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:04:20,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1674 states. [2025-01-10 06:04:20,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1674 to 478. [2025-01-10 06:04:20,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 415 states have (on average 1.4939759036144578) internal successors, (620), 456 states have internal predecessors, (620), 18 states have call successors, (18), 9 states have call predecessors, (18), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-10 06:04:20,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 650 transitions. [2025-01-10 06:04:20,864 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 650 transitions. Word has length 51 [2025-01-10 06:04:20,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:20,864 INFO L471 AbstractCegarLoop]: Abstraction has 478 states and 650 transitions. [2025-01-10 06:04:20,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 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:04:20,865 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 650 transitions. [2025-01-10 06:04:20,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-10 06:04:20,866 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:20,866 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:04:20,877 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:04:21,066 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,SelfDestructingSolverStorable12 [2025-01-10 06:04:21,066 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 70 more)] === [2025-01-10 06:04:21,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:21,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1057950468, now seen corresponding path program 1 times [2025-01-10 06:04:21,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:21,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497021817] [2025-01-10 06:04:21,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:21,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:21,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-10 06:04:21,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-10 06:04:21,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:21,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:21,411 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:04:21,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:21,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497021817] [2025-01-10 06:04:21,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497021817] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:04:21,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816738011] [2025-01-10 06:04:21,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:21,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:21,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:04:21,414 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:04:21,415 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:04:22,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-10 06:04:22,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-10 06:04:22,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:22,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:22,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 1701 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 06:04:22,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:04:22,328 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:04:22,329 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:04:22,374 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:04:22,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [816738011] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:04:22,374 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:04:22,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-10 06:04:22,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896618408] [2025-01-10 06:04:22,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:04:22,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:04:22,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:22,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:04:22,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:04:22,376 INFO L87 Difference]: Start difference. First operand 478 states and 650 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:04:22,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:22,440 INFO L93 Difference]: Finished difference Result 931 states and 1277 transitions. [2025-01-10 06:04:22,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:04:22,441 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:04:22,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:22,443 INFO L225 Difference]: With dead ends: 931 [2025-01-10 06:04:22,443 INFO L226 Difference]: Without dead ends: 496 [2025-01-10 06:04:22,444 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:04:22,444 INFO L435 NwaCegarLoop]: 589 mSDtfsCounter, 4 mSDsluCounter, 1172 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1761 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:04:22,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1761 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:04:22,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2025-01-10 06:04:22,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 496. [2025-01-10 06:04:22,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 433 states have (on average 1.4734411085450347) internal successors, (638), 474 states have internal predecessors, (638), 18 states have call successors, (18), 9 states have call predecessors, (18), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-10 06:04:22,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 668 transitions. [2025-01-10 06:04:22,462 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 668 transitions. Word has length 55 [2025-01-10 06:04:22,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:22,462 INFO L471 AbstractCegarLoop]: Abstraction has 496 states and 668 transitions. [2025-01-10 06:04:22,462 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:04:22,463 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 668 transitions. [2025-01-10 06:04:22,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-10 06:04:22,463 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:22,464 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, 1, 1, 1, 1, 1] [2025-01-10 06:04:22,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-10 06:04:22,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:22,665 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 70 more)] === [2025-01-10 06:04:22,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:22,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1171396862, now seen corresponding path program 1 times [2025-01-10 06:04:22,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:22,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052024278] [2025-01-10 06:04:22,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:22,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:22,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-10 06:04:22,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-10 06:04:22,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:22,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:23,293 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:04:23,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:23,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052024278] [2025-01-10 06:04:23,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052024278] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:04:23,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:04:23,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:04:23,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118459295] [2025-01-10 06:04:23,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:04:23,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:04:23,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:23,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:04:23,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:04:23,295 INFO L87 Difference]: Start difference. First operand 496 states and 668 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 06:04:26,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-10 06:04:27,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:27,072 INFO L93 Difference]: Finished difference Result 892 states and 1223 transitions. [2025-01-10 06:04:27,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:04:27,073 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 60 [2025-01-10 06:04:27,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:27,075 INFO L225 Difference]: With dead ends: 892 [2025-01-10 06:04:27,075 INFO L226 Difference]: Without dead ends: 497 [2025-01-10 06:04:27,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:04:27,078 INFO L435 NwaCegarLoop]: 553 mSDtfsCounter, 1410 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1410 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:27,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1410 Valid, 840 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-01-10 06:04:27,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2025-01-10 06:04:27,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 496. [2025-01-10 06:04:27,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 433 states have (on average 1.4688221709006928) internal successors, (636), 474 states have internal predecessors, (636), 18 states have call successors, (18), 9 states have call predecessors, (18), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-10 06:04:27,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 666 transitions. [2025-01-10 06:04:27,096 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 666 transitions. Word has length 60 [2025-01-10 06:04:27,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:27,096 INFO L471 AbstractCegarLoop]: Abstraction has 496 states and 666 transitions. [2025-01-10 06:04:27,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 06:04:27,097 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 666 transitions. [2025-01-10 06:04:27,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-10 06:04:27,097 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:27,097 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, 1, 1, 1, 1, 1] [2025-01-10 06:04:27,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 06:04:27,097 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 70 more)] === [2025-01-10 06:04:27,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:27,098 INFO L85 PathProgramCache]: Analyzing trace with hash 362050236, now seen corresponding path program 1 times [2025-01-10 06:04:27,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:27,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792914424] [2025-01-10 06:04:27,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:27,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:27,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-10 06:04:27,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-10 06:04:27,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:27,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:27,452 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:04:27,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:27,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792914424] [2025-01-10 06:04:27,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792914424] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:04:27,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:04:27,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:04:27,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755575945] [2025-01-10 06:04:27,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:04:27,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:04:27,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:27,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:04:27,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:04:27,453 INFO L87 Difference]: Start difference. First operand 496 states and 666 transitions. Second operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 06:04:27,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:27,652 INFO L93 Difference]: Finished difference Result 985 states and 1357 transitions. [2025-01-10 06:04:27,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:04:27,653 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 60 [2025-01-10 06:04:27,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:27,656 INFO L225 Difference]: With dead ends: 985 [2025-01-10 06:04:27,657 INFO L226 Difference]: Without dead ends: 593 [2025-01-10 06:04:27,658 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:04:27,658 INFO L435 NwaCegarLoop]: 602 mSDtfsCounter, 120 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 1121 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:27,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 1121 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 06:04:27,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2025-01-10 06:04:27,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 539. [2025-01-10 06:04:27,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 475 states have (on average 1.4589473684210525) internal successors, (693), 516 states have internal predecessors, (693), 19 states have call successors, (19), 9 states have call predecessors, (19), 8 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-10 06:04:27,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 725 transitions. [2025-01-10 06:04:27,678 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 725 transitions. Word has length 60 [2025-01-10 06:04:27,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:27,679 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 725 transitions. [2025-01-10 06:04:27,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 06:04:27,679 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 725 transitions. [2025-01-10 06:04:27,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-10 06:04:27,680 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:27,680 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, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:04:27,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 06:04:27,680 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 70 more)] === [2025-01-10 06:04:27,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:27,681 INFO L85 PathProgramCache]: Analyzing trace with hash 37956482, now seen corresponding path program 1 times [2025-01-10 06:04:27,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:27,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434102805] [2025-01-10 06:04:27,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:27,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:27,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-10 06:04:27,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-10 06:04:27,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:27,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:27,971 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:04:27,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:27,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434102805] [2025-01-10 06:04:27,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434102805] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:04:27,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:04:27,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:04:27,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661050699] [2025-01-10 06:04:27,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:04:27,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:04:27,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:27,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:04:27,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:04:27,975 INFO L87 Difference]: Start difference. First operand 539 states and 725 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 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:04:28,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:28,017 INFO L93 Difference]: Finished difference Result 541 states and 725 transitions. [2025-01-10 06:04:28,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:04:28,017 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 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 62 [2025-01-10 06:04:28,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:28,019 INFO L225 Difference]: With dead ends: 541 [2025-01-10 06:04:28,019 INFO L226 Difference]: Without dead ends: 539 [2025-01-10 06:04:28,019 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:04:28,020 INFO L435 NwaCegarLoop]: 588 mSDtfsCounter, 1 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1170 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:28,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1170 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:04:28,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-01-10 06:04:28,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 539. [2025-01-10 06:04:28,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 475 states have (on average 1.454736842105263) internal successors, (691), 516 states have internal predecessors, (691), 19 states have call successors, (19), 9 states have call predecessors, (19), 8 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-10 06:04:28,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 723 transitions. [2025-01-10 06:04:28,039 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 723 transitions. Word has length 62 [2025-01-10 06:04:28,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:28,040 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 723 transitions. [2025-01-10 06:04:28,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 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:04:28,040 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 723 transitions. [2025-01-10 06:04:28,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-10 06:04:28,040 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:28,040 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:04:28,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 06:04:28,041 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 70 more)] === [2025-01-10 06:04:28,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:28,041 INFO L85 PathProgramCache]: Analyzing trace with hash -7184417, now seen corresponding path program 2 times [2025-01-10 06:04:28,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:28,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852487365] [2025-01-10 06:04:28,041 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:04:28,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:28,234 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 63 statements into 2 equivalence classes. [2025-01-10 06:04:28,299 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 63 statements. [2025-01-10 06:04:28,299 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:04:28,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:28,546 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2025-01-10 06:04:28,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:28,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852487365] [2025-01-10 06:04:28,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852487365] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:04:28,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:04:28,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 06:04:28,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633597097] [2025-01-10 06:04:28,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:04:28,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:04:28,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:28,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:04:28,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:04:28,548 INFO L87 Difference]: Start difference. First operand 539 states and 723 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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:04:28,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:28,753 INFO L93 Difference]: Finished difference Result 1006 states and 1368 transitions. [2025-01-10 06:04:28,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:04:28,754 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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 63 [2025-01-10 06:04:28,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:28,756 INFO L225 Difference]: With dead ends: 1006 [2025-01-10 06:04:28,757 INFO L226 Difference]: Without dead ends: 539 [2025-01-10 06:04:28,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:04:28,758 INFO L435 NwaCegarLoop]: 575 mSDtfsCounter, 518 mSDsluCounter, 1762 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 2337 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:28,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 2337 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 06:04:28,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-01-10 06:04:28,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 539. [2025-01-10 06:04:28,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 475 states have (on average 1.4526315789473685) internal successors, (690), 516 states have internal predecessors, (690), 19 states have call successors, (19), 9 states have call predecessors, (19), 8 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-10 06:04:28,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 722 transitions. [2025-01-10 06:04:28,775 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 722 transitions. Word has length 63 [2025-01-10 06:04:28,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:28,775 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 722 transitions. [2025-01-10 06:04:28,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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:04:28,776 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 722 transitions. [2025-01-10 06:04:28,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-10 06:04:28,779 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:28,779 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:04:28,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 06:04:28,779 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 70 more)] === [2025-01-10 06:04:28,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:28,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1615466796, now seen corresponding path program 2 times [2025-01-10 06:04:28,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:28,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136474944] [2025-01-10 06:04:28,780 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:04:28,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:28,938 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-01-10 06:04:28,982 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 73 of 73 statements. [2025-01-10 06:04:28,984 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:04:28,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:29,161 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2025-01-10 06:04:29,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:29,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136474944] [2025-01-10 06:04:29,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136474944] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:04:29,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146530270] [2025-01-10 06:04:29,161 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:04:29,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:29,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:04:29,163 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:04:29,168 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:04:29,803 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-01-10 06:04:44,153 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 73 of 73 statements. [2025-01-10 06:04:44,154 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:04:44,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:44,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 1839 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 06:04:44,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:04:44,288 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 58 proven. 22 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-01-10 06:04:44,292 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:04:44,446 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 58 proven. 22 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-01-10 06:04:44,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2146530270] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:04:44,447 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:04:44,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-01-10 06:04:44,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767026229] [2025-01-10 06:04:44,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:04:44,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 06:04:44,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:44,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 06:04:44,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-01-10 06:04:44,449 INFO L87 Difference]: Start difference. First operand 539 states and 722 transitions. Second operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 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:04:45,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:45,051 INFO L93 Difference]: Finished difference Result 1061 states and 1437 transitions. [2025-01-10 06:04:45,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-10 06:04:45,052 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 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 73 [2025-01-10 06:04:45,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:45,054 INFO L225 Difference]: With dead ends: 1061 [2025-01-10 06:04:45,055 INFO L226 Difference]: Without dead ends: 574 [2025-01-10 06:04:45,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=330, Invalid=792, Unknown=0, NotChecked=0, Total=1122 [2025-01-10 06:04:45,056 INFO L435 NwaCegarLoop]: 582 mSDtfsCounter, 9 mSDsluCounter, 2316 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2898 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:45,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 2898 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 06:04:45,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2025-01-10 06:04:45,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2025-01-10 06:04:45,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 511 states have (on average 1.4187866927592956) internal successors, (725), 551 states have internal predecessors, (725), 19 states have call successors, (19), 9 states have call predecessors, (19), 8 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-10 06:04:45,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 757 transitions. [2025-01-10 06:04:45,076 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 757 transitions. Word has length 73 [2025-01-10 06:04:45,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:45,078 INFO L471 AbstractCegarLoop]: Abstraction has 574 states and 757 transitions. [2025-01-10 06:04:45,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 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:04:45,078 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 757 transitions. [2025-01-10 06:04:45,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-10 06:04:45,079 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:45,079 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:04:45,112 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-10 06:04:45,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:45,280 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 70 more)] === [2025-01-10 06:04:45,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:45,281 INFO L85 PathProgramCache]: Analyzing trace with hash -888988525, now seen corresponding path program 1 times [2025-01-10 06:04:45,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:45,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929039488] [2025-01-10 06:04:45,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:45,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:45,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-10 06:04:45,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-10 06:04:45,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:45,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:45,892 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-01-10 06:04:45,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:45,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929039488] [2025-01-10 06:04:45,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929039488] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:04:45,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625765852] [2025-01-10 06:04:45,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:45,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:45,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:04:45,898 INFO L229 MonitoredProcess]: Starting monitored process 10 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:04:45,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-10 06:04:46,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-10 06:04:46,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-10 06:04:46,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:46,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:46,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 1952 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 06:04:46,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:04:46,934 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-01-10 06:04:46,935 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:04:47,129 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-01-10 06:04:47,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1625765852] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:04:47,129 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:04:47,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-01-10 06:04:47,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077820993] [2025-01-10 06:04:47,130 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:04:47,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 06:04:47,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:47,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 06:04:47,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-10 06:04:47,132 INFO L87 Difference]: Start difference. First operand 574 states and 757 transitions. Second operand has 13 states, 12 states have (on average 5.583333333333333) internal successors, (67), 13 states have internal predecessors, (67), 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:04:47,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:47,852 INFO L93 Difference]: Finished difference Result 4019 states and 5723 transitions. [2025-01-10 06:04:47,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 06:04:47,852 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.583333333333333) internal successors, (67), 13 states have internal predecessors, (67), 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 97 [2025-01-10 06:04:47,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:47,867 INFO L225 Difference]: With dead ends: 4019 [2025-01-10 06:04:47,867 INFO L226 Difference]: Without dead ends: 4018 [2025-01-10 06:04:47,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 187 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:04:47,870 INFO L435 NwaCegarLoop]: 581 mSDtfsCounter, 6212 mSDsluCounter, 6346 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6282 SdHoareTripleChecker+Valid, 6927 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:47,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6282 Valid, 6927 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-10 06:04:47,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4018 states. [2025-01-10 06:04:47,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4018 to 598. [2025-01-10 06:04:47,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 535 states have (on average 1.411214953271028) internal successors, (755), 575 states have internal predecessors, (755), 19 states have call successors, (19), 9 states have call predecessors, (19), 8 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-10 06:04:47,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 787 transitions. [2025-01-10 06:04:47,925 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 787 transitions. Word has length 97 [2025-01-10 06:04:47,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:47,925 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 787 transitions. [2025-01-10 06:04:47,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.583333333333333) internal successors, (67), 13 states have internal predecessors, (67), 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:04:47,926 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 787 transitions. [2025-01-10 06:04:47,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-10 06:04:47,928 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:47,928 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:04:47,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-10 06:04:48,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:48,132 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 70 more)] === [2025-01-10 06:04:48,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:48,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1023364440, now seen corresponding path program 1 times [2025-01-10 06:04:48,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:48,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758093246] [2025-01-10 06:04:48,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:48,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:48,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-10 06:04:48,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-10 06:04:48,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:48,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:48,554 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:04:48,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:48,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758093246] [2025-01-10 06:04:48,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758093246] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:04:48,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:04:48,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:04:48,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611296891] [2025-01-10 06:04:48,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:04:48,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:04:48,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:48,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:04:48,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:04:48,556 INFO L87 Difference]: Start difference. First operand 598 states and 787 transitions. Second operand has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 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:04:48,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:48,765 INFO L93 Difference]: Finished difference Result 982 states and 1343 transitions. [2025-01-10 06:04:48,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:04:48,766 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 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 102 [2025-01-10 06:04:48,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:48,769 INFO L225 Difference]: With dead ends: 982 [2025-01-10 06:04:48,769 INFO L226 Difference]: Without dead ends: 651 [2025-01-10 06:04:48,770 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:04:48,771 INFO L435 NwaCegarLoop]: 650 mSDtfsCounter, 75 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 1177 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:48,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 1177 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 06:04:48,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2025-01-10 06:04:48,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 601. [2025-01-10 06:04:48,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 540 states have (on average 1.4055555555555554) internal successors, (759), 578 states have internal predecessors, (759), 19 states have call successors, (19), 9 states have call predecessors, (19), 8 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-10 06:04:48,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 791 transitions. [2025-01-10 06:04:48,806 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 791 transitions. Word has length 102 [2025-01-10 06:04:48,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:48,807 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 791 transitions. [2025-01-10 06:04:48,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 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:04:48,807 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 791 transitions. [2025-01-10 06:04:48,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-10 06:04:48,808 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:48,808 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:04:48,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-10 06:04:48,809 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 70 more)] === [2025-01-10 06:04:48,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:48,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1022729963, now seen corresponding path program 1 times [2025-01-10 06:04:48,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:48,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314357855] [2025-01-10 06:04:48,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:48,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:49,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-10 06:04:49,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-10 06:04:49,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:49,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:49,361 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:04:49,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:49,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314357855] [2025-01-10 06:04:49,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314357855] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:04:49,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:04:49,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:04:49,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502877929] [2025-01-10 06:04:49,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:04:49,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:04:49,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:49,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:04:49,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:04:49,365 INFO L87 Difference]: Start difference. First operand 601 states and 791 transitions. Second operand has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 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:04:49,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:49,529 INFO L93 Difference]: Finished difference Result 655 states and 869 transitions. [2025-01-10 06:04:49,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:04:49,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 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 102 [2025-01-10 06:04:49,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:49,532 INFO L225 Difference]: With dead ends: 655 [2025-01-10 06:04:49,532 INFO L226 Difference]: Without dead ends: 652 [2025-01-10 06:04:49,532 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:04:49,536 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 191 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 983 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:49,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 983 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:04:49,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2025-01-10 06:04:49,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 598. [2025-01-10 06:04:49,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 540 states have (on average 1.4) internal successors, (756), 575 states have internal predecessors, (756), 19 states have call successors, (19), 9 states have call predecessors, (19), 8 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-10 06:04:49,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 788 transitions. [2025-01-10 06:04:49,559 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 788 transitions. Word has length 102 [2025-01-10 06:04:49,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:49,560 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 788 transitions. [2025-01-10 06:04:49,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 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:04:49,560 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 788 transitions. [2025-01-10 06:04:49,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-10 06:04:49,561 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:49,561 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:04:49,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-10 06:04:49,562 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 70 more)] === [2025-01-10 06:04:49,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:49,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1659525422, now seen corresponding path program 1 times [2025-01-10 06:04:49,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:49,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124783301] [2025-01-10 06:04:49,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:49,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:49,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-10 06:04:49,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-10 06:04:49,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:49,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:49,939 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:04:49,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:49,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124783301] [2025-01-10 06:04:49,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124783301] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:04:49,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:04:49,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:04:49,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669493289] [2025-01-10 06:04:49,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:04:49,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:04:49,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:49,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:04:49,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:04:49,940 INFO L87 Difference]: Start difference. First operand 598 states and 788 transitions. Second operand has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 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:04:50,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:50,130 INFO L93 Difference]: Finished difference Result 984 states and 1345 transitions. [2025-01-10 06:04:50,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:04:50,130 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 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:04:50,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:50,132 INFO L225 Difference]: With dead ends: 984 [2025-01-10 06:04:50,133 INFO L226 Difference]: Without dead ends: 649 [2025-01-10 06:04:50,134 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:04:50,134 INFO L435 NwaCegarLoop]: 561 mSDtfsCounter, 157 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 1040 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:50,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 1040 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 06:04:50,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2025-01-10 06:04:50,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 583. [2025-01-10 06:04:50,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 529 states have (on average 1.391304347826087) internal successors, (736), 560 states have internal predecessors, (736), 19 states have call successors, (19), 9 states have call predecessors, (19), 8 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-10 06:04:50,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 768 transitions. [2025-01-10 06:04:50,154 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 768 transitions. Word has length 103 [2025-01-10 06:04:50,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:50,154 INFO L471 AbstractCegarLoop]: Abstraction has 583 states and 768 transitions. [2025-01-10 06:04:50,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 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:04:50,154 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 768 transitions. [2025-01-10 06:04:50,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-10 06:04:50,157 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:50,157 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:04:50,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-10 06:04:50,157 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 70 more)] === [2025-01-10 06:04:50,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:50,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1639856573, now seen corresponding path program 1 times [2025-01-10 06:04:50,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:50,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226412282] [2025-01-10 06:04:50,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:50,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:50,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-10 06:04:50,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-10 06:04:50,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:50,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:50,579 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:04:50,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:50,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226412282] [2025-01-10 06:04:50,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226412282] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:04:50,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:04:50,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:04:50,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628890976] [2025-01-10 06:04:50,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:04:50,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:04:50,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:50,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:04:50,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:04:50,582 INFO L87 Difference]: Start difference. First operand 583 states and 768 transitions. Second operand has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 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:04:50,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:50,805 INFO L93 Difference]: Finished difference Result 637 states and 846 transitions. [2025-01-10 06:04:50,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:04:50,806 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 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:04:50,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:50,809 INFO L225 Difference]: With dead ends: 637 [2025-01-10 06:04:50,809 INFO L226 Difference]: Without dead ends: 636 [2025-01-10 06:04:50,811 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:04:50,811 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 189 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:50,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 1016 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 06:04:50,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2025-01-10 06:04:50,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 582. [2025-01-10 06:04:50,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 529 states have (on average 1.389413988657845) internal successors, (735), 559 states have internal predecessors, (735), 19 states have call successors, (19), 9 states have call predecessors, (19), 8 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-10 06:04:50,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 767 transitions. [2025-01-10 06:04:50,840 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 767 transitions. Word has length 103 [2025-01-10 06:04:50,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:50,841 INFO L471 AbstractCegarLoop]: Abstraction has 582 states and 767 transitions. [2025-01-10 06:04:50,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 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:04:50,841 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 767 transitions. [2025-01-10 06:04:50,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-10 06:04:50,845 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:50,846 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:04:50,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-10 06:04:50,846 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 70 more)] === [2025-01-10 06:04:50,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:50,846 INFO L85 PathProgramCache]: Analyzing trace with hash -464399775, now seen corresponding path program 1 times [2025-01-10 06:04:50,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:50,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007127194] [2025-01-10 06:04:50,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:50,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:51,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-10 06:04:51,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-10 06:04:51,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:51,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:51,389 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-01-10 06:04:51,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:51,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007127194] [2025-01-10 06:04:51,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007127194] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:04:51,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784990049] [2025-01-10 06:04:51,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:51,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:51,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:04:51,397 INFO L229 MonitoredProcess]: Starting monitored process 11 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:04:51,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-10 06:04:52,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-10 06:04:52,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-10 06:04:52,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:52,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:52,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 2035 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 06:04:52,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:04:52,662 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-01-10 06:04:52,662 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:04:52,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [784990049] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:04:52,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:04:52,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-01-10 06:04:52,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379287952] [2025-01-10 06:04:52,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:04:52,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:04:52,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:52,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:04:52,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:04:52,664 INFO L87 Difference]: Start difference. First operand 582 states and 767 transitions. Second operand has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 06:04:53,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:53,102 INFO L93 Difference]: Finished difference Result 1089 states and 1485 transitions. [2025-01-10 06:04:53,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:04:53,103 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 105 [2025-01-10 06:04:53,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:53,107 INFO L225 Difference]: With dead ends: 1089 [2025-01-10 06:04:53,107 INFO L226 Difference]: Without dead ends: 699 [2025-01-10 06:04:53,108 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:04:53,108 INFO L435 NwaCegarLoop]: 654 mSDtfsCounter, 357 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 1343 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:53,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 1343 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-10 06:04:53,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2025-01-10 06:04:53,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 581. [2025-01-10 06:04:53,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 530 states have (on average 1.381132075471698) internal successors, (732), 558 states have internal predecessors, (732), 19 states have call successors, (19), 9 states have call predecessors, (19), 8 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-10 06:04:53,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 764 transitions. [2025-01-10 06:04:53,209 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 764 transitions. Word has length 105 [2025-01-10 06:04:53,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:53,214 INFO L471 AbstractCegarLoop]: Abstraction has 581 states and 764 transitions. [2025-01-10 06:04:53,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 06:04:53,218 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 764 transitions. [2025-01-10 06:04:53,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-10 06:04:53,220 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:53,220 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:04:53,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-10 06:04:53,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-01-10 06:04:53,424 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 70 more)] === [2025-01-10 06:04:53,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:53,425 INFO L85 PathProgramCache]: Analyzing trace with hash -843083294, now seen corresponding path program 1 times [2025-01-10 06:04:53,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:53,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211925380] [2025-01-10 06:04:53,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:53,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:53,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-10 06:04:53,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-10 06:04:53,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:53,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:53,840 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2025-01-10 06:04:53,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:53,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211925380] [2025-01-10 06:04:53,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211925380] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:04:53,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:04:53,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:04:53,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875236783] [2025-01-10 06:04:53,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:04:53,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:04:53,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:53,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:04:53,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:04:53,842 INFO L87 Difference]: Start difference. First operand 581 states and 764 transitions. Second operand has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 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:04:53,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:53,884 INFO L93 Difference]: Finished difference Result 581 states and 764 transitions. [2025-01-10 06:04:53,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:04:53,884 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 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 108 [2025-01-10 06:04:53,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:53,887 INFO L225 Difference]: With dead ends: 581 [2025-01-10 06:04:53,887 INFO L226 Difference]: Without dead ends: 580 [2025-01-10 06:04:53,887 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:04:53,888 INFO L435 NwaCegarLoop]: 575 mSDtfsCounter, 1 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1144 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:53,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1144 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:04:53,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2025-01-10 06:04:53,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 580. [2025-01-10 06:04:53,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 530 states have (on average 1.379245283018868) internal successors, (731), 557 states have internal predecessors, (731), 19 states have call successors, (19), 9 states have call predecessors, (19), 8 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-10 06:04:53,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 763 transitions. [2025-01-10 06:04:53,909 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 763 transitions. Word has length 108 [2025-01-10 06:04:53,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:53,909 INFO L471 AbstractCegarLoop]: Abstraction has 580 states and 763 transitions. [2025-01-10 06:04:53,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 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:04:53,909 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 763 transitions. [2025-01-10 06:04:53,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-10 06:04:53,910 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:53,910 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:04:53,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-10 06:04:53,911 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 70 more)] === [2025-01-10 06:04:53,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:53,911 INFO L85 PathProgramCache]: Analyzing trace with hash -365777372, now seen corresponding path program 1 times [2025-01-10 06:04:53,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:53,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249847528] [2025-01-10 06:04:53,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:53,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:54,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-10 06:04:54,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-10 06:04:54,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:54,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:54,782 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2025-01-10 06:04:54,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:54,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249847528] [2025-01-10 06:04:54,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249847528] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:04:54,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:04:54,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:04:54,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466099942] [2025-01-10 06:04:54,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:04:54,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:04:54,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:54,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:04:54,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:04:54,784 INFO L87 Difference]: Start difference. First operand 580 states and 763 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 06:04:57,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-10 06:04:57,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:57,702 INFO L93 Difference]: Finished difference Result 998 states and 1346 transitions. [2025-01-10 06:04:57,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:04:57,702 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 109 [2025-01-10 06:04:57,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:57,704 INFO L225 Difference]: With dead ends: 998 [2025-01-10 06:04:57,704 INFO L226 Difference]: Without dead ends: 580 [2025-01-10 06:04:57,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:04:57,706 INFO L435 NwaCegarLoop]: 539 mSDtfsCounter, 534 mSDsluCounter, 663 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 1202 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:57,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 1202 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-01-10 06:04:57,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2025-01-10 06:04:57,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 580. [2025-01-10 06:04:57,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 530 states have (on average 1.3773584905660377) internal successors, (730), 557 states have internal predecessors, (730), 19 states have call successors, (19), 9 states have call predecessors, (19), 8 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-10 06:04:57,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 762 transitions. [2025-01-10 06:04:57,725 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 762 transitions. Word has length 109 [2025-01-10 06:04:57,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:57,725 INFO L471 AbstractCegarLoop]: Abstraction has 580 states and 762 transitions. [2025-01-10 06:04:57,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 06:04:57,725 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 762 transitions. [2025-01-10 06:04:57,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-10 06:04:57,726 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:57,726 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:04:57,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-10 06:04:57,727 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 70 more)] === [2025-01-10 06:04:57,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:57,727 INFO L85 PathProgramCache]: Analyzing trace with hash 56924454, now seen corresponding path program 1 times [2025-01-10 06:04:57,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:57,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658189306] [2025-01-10 06:04:57,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:57,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:57,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-10 06:04:58,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-10 06:04:58,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:58,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:58,947 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2025-01-10 06:04:58,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:58,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658189306] [2025-01-10 06:04:58,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658189306] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:04:58,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:04:58,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 06:04:58,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572488169] [2025-01-10 06:04:58,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:04:58,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:04:58,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:58,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:04:58,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:04:58,949 INFO L87 Difference]: Start difference. First operand 580 states and 762 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 06:05:02,968 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:05:06,978 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:05:07,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:05:07,427 INFO L93 Difference]: Finished difference Result 997 states and 1343 transitions. [2025-01-10 06:05:07,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:05:07,427 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 109 [2025-01-10 06:05:07,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:05:07,430 INFO L225 Difference]: With dead ends: 997 [2025-01-10 06:05:07,430 INFO L226 Difference]: Without dead ends: 580 [2025-01-10 06:05:07,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:05:07,432 INFO L435 NwaCegarLoop]: 537 mSDtfsCounter, 533 mSDsluCounter, 1159 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 10 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 539 SdHoareTripleChecker+Valid, 1696 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2025-01-10 06:05:07,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [539 Valid, 1696 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 173 Invalid, 2 Unknown, 0 Unchecked, 8.4s Time] [2025-01-10 06:05:07,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2025-01-10 06:05:07,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 580. [2025-01-10 06:05:07,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 530 states have (on average 1.3754716981132076) internal successors, (729), 557 states have internal predecessors, (729), 19 states have call successors, (19), 9 states have call predecessors, (19), 8 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-10 06:05:07,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 761 transitions. [2025-01-10 06:05:07,461 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 761 transitions. Word has length 109 [2025-01-10 06:05:07,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:05:07,462 INFO L471 AbstractCegarLoop]: Abstraction has 580 states and 761 transitions. [2025-01-10 06:05:07,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 06:05:07,462 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 761 transitions. [2025-01-10 06:05:07,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-10 06:05:07,463 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:05:07,464 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:05:07,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-10 06:05:07,465 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 70 more)] === [2025-01-10 06:05:07,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:05:07,465 INFO L85 PathProgramCache]: Analyzing trace with hash -760723996, now seen corresponding path program 1 times [2025-01-10 06:05:07,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:05:07,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551596467] [2025-01-10 06:05:07,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:05:07,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:05:07,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-10 06:05:07,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-10 06:05:07,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:05:07,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:05:08,199 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2025-01-10 06:05:08,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:05:08,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551596467] [2025-01-10 06:05:08,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551596467] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:05:08,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:05:08,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:05:08,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937952246] [2025-01-10 06:05:08,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:05:08,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:05:08,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:05:08,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:05:08,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:05:08,201 INFO L87 Difference]: Start difference. First operand 580 states and 761 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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:05:08,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:05:08,248 INFO L93 Difference]: Finished difference Result 1005 states and 1351 transitions. [2025-01-10 06:05:08,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:05:08,249 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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 109 [2025-01-10 06:05:08,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:05:08,251 INFO L225 Difference]: With dead ends: 1005 [2025-01-10 06:05:08,251 INFO L226 Difference]: Without dead ends: 581 [2025-01-10 06:05:08,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:05:08,252 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 0 mSDsluCounter, 1142 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1714 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:05:08,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1714 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:05:08,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2025-01-10 06:05:08,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 581. [2025-01-10 06:05:08,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 531 states have (on average 1.374764595103578) internal successors, (730), 558 states have internal predecessors, (730), 19 states have call successors, (19), 9 states have call predecessors, (19), 8 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-10 06:05:08,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 762 transitions. [2025-01-10 06:05:08,275 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 762 transitions. Word has length 109 [2025-01-10 06:05:08,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:05:08,275 INFO L471 AbstractCegarLoop]: Abstraction has 581 states and 762 transitions. [2025-01-10 06:05:08,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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:05:08,276 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 762 transitions. [2025-01-10 06:05:08,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-10 06:05:08,276 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:05:08,277 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:05:08,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-10 06:05:08,277 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 70 more)] === [2025-01-10 06:05:08,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:05:08,277 INFO L85 PathProgramCache]: Analyzing trace with hash -903478758, now seen corresponding path program 1 times [2025-01-10 06:05:08,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:05:08,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642121517] [2025-01-10 06:05:08,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:05:08,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:05:08,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-10 06:05:08,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-10 06:05:08,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:05:08,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:05:08,949 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2025-01-10 06:05:08,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:05:08,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642121517] [2025-01-10 06:05:08,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642121517] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:05:08,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693839675] [2025-01-10 06:05:08,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:05:08,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:05:08,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:05:08,957 INFO L229 MonitoredProcess]: Starting monitored process 12 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:05:08,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-10 06:05:10,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-10 06:05:12,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-10 06:05:12,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:05:12,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:05:12,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 2053 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 06:05:12,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:05:12,583 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2025-01-10 06:05:12,583 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:05:12,704 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2025-01-10 06:05:12,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1693839675] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:05:12,704 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:05:12,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-01-10 06:05:12,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938256340] [2025-01-10 06:05:12,705 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:05:12,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 06:05:12,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:05:12,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 06:05:12,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-01-10 06:05:12,706 INFO L87 Difference]: Start difference. First operand 581 states and 762 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-10 06:05:12,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:05:12,897 INFO L93 Difference]: Finished difference Result 1010 states and 1358 transitions. [2025-01-10 06:05:12,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 06:05:12,898 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 110 [2025-01-10 06:05:12,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:05:12,901 INFO L225 Difference]: With dead ends: 1010 [2025-01-10 06:05:12,901 INFO L226 Difference]: Without dead ends: 584 [2025-01-10 06:05:12,902 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:05:12,902 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 0 mSDsluCounter, 3424 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3996 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:05:12,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3996 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:05:12,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2025-01-10 06:05:12,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 584. [2025-01-10 06:05:12,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 534 states have (on average 1.3726591760299625) internal successors, (733), 561 states have internal predecessors, (733), 19 states have call successors, (19), 9 states have call predecessors, (19), 8 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-10 06:05:12,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 765 transitions. [2025-01-10 06:05:12,929 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 765 transitions. Word has length 110 [2025-01-10 06:05:12,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:05:12,929 INFO L471 AbstractCegarLoop]: Abstraction has 584 states and 765 transitions. [2025-01-10 06:05:12,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-10 06:05:12,929 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 765 transitions. [2025-01-10 06:05:12,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-10 06:05:12,930 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:05:12,930 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:05:12,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-01-10 06:05:13,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:05:13,132 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 70 more)] === [2025-01-10 06:05:13,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:05:13,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1067285846, now seen corresponding path program 1 times [2025-01-10 06:05:13,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:05:13,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449221223] [2025-01-10 06:05:13,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:05:13,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:05:13,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-10 06:05:13,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-10 06:05:13,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:05:13,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:05:13,650 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-01-10 06:05:13,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:05:13,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449221223] [2025-01-10 06:05:13,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449221223] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:05:13,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711598282] [2025-01-10 06:05:13,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:05:13,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:05:13,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:05:13,653 INFO L229 MonitoredProcess]: Starting monitored process 13 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:05:13,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-10 06:05:14,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-10 06:05:15,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-10 06:05:15,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:05:15,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:05:15,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 2116 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 06:05:15,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:05:15,218 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-01-10 06:05:15,218 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:05:15,345 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-01-10 06:05:15,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [711598282] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:05:15,346 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:05:15,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-01-10 06:05:15,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287061528] [2025-01-10 06:05:15,346 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:05:15,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:05:15,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:05:15,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:05:15,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:05:15,347 INFO L87 Difference]: Start difference. First operand 584 states and 765 transitions. Second operand has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 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:05:15,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:05:15,427 INFO L93 Difference]: Finished difference Result 687 states and 876 transitions. [2025-01-10 06:05:15,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:05:15,427 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 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 110 [2025-01-10 06:05:15,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:05:15,429 INFO L225 Difference]: With dead ends: 687 [2025-01-10 06:05:15,430 INFO L226 Difference]: Without dead ends: 686 [2025-01-10 06:05:15,430 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 216 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:05:15,430 INFO L435 NwaCegarLoop]: 569 mSDtfsCounter, 0 mSDsluCounter, 2264 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2833 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:05:15,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2833 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:05:15,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2025-01-10 06:05:15,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 686. [2025-01-10 06:05:15,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 636 states have (on average 1.3223270440251573) internal successors, (841), 663 states have internal predecessors, (841), 19 states have call successors, (19), 9 states have call predecessors, (19), 8 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-10 06:05:15,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 873 transitions. [2025-01-10 06:05:15,458 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 873 transitions. Word has length 110 [2025-01-10 06:05:15,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:05:15,459 INFO L471 AbstractCegarLoop]: Abstraction has 686 states and 873 transitions. [2025-01-10 06:05:15,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 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:05:15,459 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 873 transitions. [2025-01-10 06:05:15,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-10 06:05:15,461 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:05:15,461 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:05:15,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-01-10 06:05:15,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:05:15,662 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 70 more)] === [2025-01-10 06:05:15,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:05:15,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1571773596, now seen corresponding path program 2 times [2025-01-10 06:05:15,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:05:15,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997634839] [2025-01-10 06:05:15,664 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:05:15,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:05:15,957 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 113 statements into 2 equivalence classes. [2025-01-10 06:05:16,211 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 113 of 113 statements. [2025-01-10 06:05:16,212 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:05:16,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:05:16,885 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2025-01-10 06:05:16,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:05:16,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997634839] [2025-01-10 06:05:16,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997634839] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:05:16,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988718471] [2025-01-10 06:05:16,885 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:05:16,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:05:16,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:05:16,889 INFO L229 MonitoredProcess]: Starting monitored process 14 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:05:16,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-01-10 06:05:18,104 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 113 statements into 2 equivalence classes.