./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/head-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/busybox-1.22.0/head-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 215d23787da0121fe1d31fb918e95ec539d610f21ad7af0cf3de67b0df205419 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 14:39:44,061 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 14:39:44,107 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-04 14:39:44,111 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 14:39:44,111 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 14:39:44,127 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 14:39:44,128 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 14:39:44,128 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 14:39:44,129 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 14:39:44,129 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 14:39:44,129 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 14:39:44,130 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 14:39:44,130 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 14:39:44,130 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 14:39:44,130 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 14:39:44,131 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 14:39:44,131 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 14:39:44,131 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 14:39:44,131 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 14:39:44,131 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 14:39:44,131 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 14:39:44,131 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 14:39:44,131 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 14:39:44,131 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 14:39:44,131 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 14:39:44,131 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 14:39:44,131 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 14:39:44,132 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 14:39:44,132 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 14:39:44,132 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 14:39:44,132 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 14:39:44,132 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 14:39:44,132 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 14:39:44,132 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 14:39:44,132 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 14:39:44,132 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 14:39:44,133 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 14:39:44,133 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 14:39:44,133 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 14:39:44,133 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 14:39:44,133 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 14:39:44,133 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 14:39:44,133 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 215d23787da0121fe1d31fb918e95ec539d610f21ad7af0cf3de67b0df205419 [2025-03-04 14:39:44,367 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 14:39:44,376 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 14:39:44,378 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 14:39:44,379 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 14:39:44,379 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 14:39:44,380 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/head-2.i [2025-03-04 14:39:45,528 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89746be0b/dd29c66dda3c4a2e83ead5357bf60cd0/FLAGb8101dc2c [2025-03-04 14:39:45,932 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 14:39:45,935 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/head-2.i [2025-03-04 14:39:45,959 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89746be0b/dd29c66dda3c4a2e83ead5357bf60cd0/FLAGb8101dc2c [2025-03-04 14:39:45,975 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89746be0b/dd29c66dda3c4a2e83ead5357bf60cd0 [2025-03-04 14:39:45,977 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 14:39:45,979 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 14:39:45,980 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 14:39:45,980 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 14:39:45,984 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 14:39:45,984 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:39:45" (1/1) ... [2025-03-04 14:39:45,985 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5912579c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:39:45, skipping insertion in model container [2025-03-04 14:39:45,985 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:39:45" (1/1) ... [2025-03-04 14:39:46,041 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 14:39:46,710 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 14:39:46,728 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 14:39:46,838 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 14:39:46,975 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-03-04 14:39:46,981 INFO L204 MainTranslator]: Completed translation [2025-03-04 14:39:46,982 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:39:46 WrapperNode [2025-03-04 14:39:46,982 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 14:39:46,983 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 14:39:46,983 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 14:39:46,983 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 14:39:46,987 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:39:46" (1/1) ... [2025-03-04 14:39:47,023 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:39:46" (1/1) ... [2025-03-04 14:39:47,074 INFO L138 Inliner]: procedures = 581, calls = 697, calls flagged for inlining = 30, calls inlined = 28, statements flattened = 1389 [2025-03-04 14:39:47,075 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 14:39:47,075 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 14:39:47,075 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 14:39:47,076 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 14:39:47,085 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:39:46" (1/1) ... [2025-03-04 14:39:47,085 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:39:46" (1/1) ... [2025-03-04 14:39:47,099 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:39:46" (1/1) ... [2025-03-04 14:39:47,159 INFO L175 MemorySlicer]: Split 566 memory accesses to 19 slices as follows [2, 9, 3, 2, 3, 2, 3, 9, 32, 20, 15, 24, 10, 7, 355, 18, 4, 47, 1]. 63 percent of accesses are in the largest equivalence class. The 379 initializations are split as follows [2, 0, 0, 0, 3, 2, 0, 1, 2, 4, 0, 0, 7, 0, 355, 0, 1, 2, 0]. The 120 writes are split as follows [0, 6, 3, 1, 0, 0, 0, 4, 21, 15, 1, 21, 0, 7, 0, 4, 1, 35, 1]. [2025-03-04 14:39:47,159 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:39:46" (1/1) ... [2025-03-04 14:39:47,159 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:39:46" (1/1) ... [2025-03-04 14:39:47,212 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:39:46" (1/1) ... [2025-03-04 14:39:47,216 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:39:46" (1/1) ... [2025-03-04 14:39:47,229 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:39:46" (1/1) ... [2025-03-04 14:39:47,236 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:39:46" (1/1) ... [2025-03-04 14:39:47,251 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 14:39:47,253 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 14:39:47,253 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 14:39:47,253 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 14:39:47,254 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:39:46" (1/1) ... [2025-03-04 14:39:47,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 14:39:47,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:39:47,300 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 14:39:47,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 14:39:47,319 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#0 [2025-03-04 14:39:47,319 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#1 [2025-03-04 14:39:47,319 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#2 [2025-03-04 14:39:47,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#3 [2025-03-04 14:39:47,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#4 [2025-03-04 14:39:47,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#5 [2025-03-04 14:39:47,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#6 [2025-03-04 14:39:47,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#7 [2025-03-04 14:39:47,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#8 [2025-03-04 14:39:47,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#9 [2025-03-04 14:39:47,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#10 [2025-03-04 14:39:47,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#11 [2025-03-04 14:39:47,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#12 [2025-03-04 14:39:47,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#13 [2025-03-04 14:39:47,321 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#14 [2025-03-04 14:39:47,321 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#15 [2025-03-04 14:39:47,321 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#16 [2025-03-04 14:39:47,321 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#17 [2025-03-04 14:39:47,321 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#18 [2025-03-04 14:39:47,321 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#0 [2025-03-04 14:39:47,321 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#1 [2025-03-04 14:39:47,321 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#2 [2025-03-04 14:39:47,321 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#3 [2025-03-04 14:39:47,321 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#4 [2025-03-04 14:39:47,321 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#5 [2025-03-04 14:39:47,321 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#6 [2025-03-04 14:39:47,321 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#7 [2025-03-04 14:39:47,322 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#8 [2025-03-04 14:39:47,322 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#9 [2025-03-04 14:39:47,322 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#10 [2025-03-04 14:39:47,322 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#11 [2025-03-04 14:39:47,322 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#12 [2025-03-04 14:39:47,322 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#13 [2025-03-04 14:39:47,322 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#14 [2025-03-04 14:39:47,322 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#15 [2025-03-04 14:39:47,322 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#16 [2025-03-04 14:39:47,322 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#17 [2025-03-04 14:39:47,323 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#18 [2025-03-04 14:39:47,323 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_getc [2025-03-04 14:39:47,323 INFO L138 BoogieDeclarations]: Found implementation of procedure _IO_getc [2025-03-04 14:39:47,323 INFO L130 BoogieDeclarations]: Found specification of procedure xrealloc [2025-03-04 14:39:47,323 INFO L138 BoogieDeclarations]: Found implementation of procedure xrealloc [2025-03-04 14:39:47,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 14:39:47,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-03-04 14:39:47,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-03-04 14:39:47,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-03-04 14:39:47,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-03-04 14:39:47,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-03-04 14:39:47,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-03-04 14:39:47,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-03-04 14:39:47,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-03-04 14:39:47,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2025-03-04 14:39:47,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2025-03-04 14:39:47,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#10 [2025-03-04 14:39:47,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#11 [2025-03-04 14:39:47,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#12 [2025-03-04 14:39:47,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#13 [2025-03-04 14:39:47,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#14 [2025-03-04 14:39:47,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#15 [2025-03-04 14:39:47,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#16 [2025-03-04 14:39:47,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#17 [2025-03-04 14:39:47,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#18 [2025-03-04 14:39:47,323 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-03-04 14:39:47,323 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-03-04 14:39:47,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-04 14:39:47,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-04 14:39:47,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-04 14:39:47,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-04 14:39:47,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-04 14:39:47,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-04 14:39:47,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-04 14:39:47,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-04 14:39:47,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-04 14:39:47,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-03-04 14:39:47,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-03-04 14:39:47,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-03-04 14:39:47,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-03-04 14:39:47,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-03-04 14:39:47,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-03-04 14:39:47,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-03-04 14:39:47,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-03-04 14:39:47,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-03-04 14:39:47,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-03-04 14:39:47,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 14:39:47,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 14:39:47,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 14:39:47,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 14:39:47,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 14:39:47,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 14:39:47,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 14:39:47,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-04 14:39:47,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-04 14:39:47,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-04 14:39:47,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-04 14:39:47,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-04 14:39:47,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-04 14:39:47,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-04 14:39:47,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-04 14:39:47,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-04 14:39:47,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-04 14:39:47,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-03-04 14:39:47,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-03-04 14:39:47,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 14:39:47,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 14:39:47,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 14:39:47,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 14:39:47,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 14:39:47,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 14:39:47,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-04 14:39:47,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-04 14:39:47,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-04 14:39:47,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-04 14:39:47,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-04 14:39:47,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-04 14:39:47,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-04 14:39:47,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-04 14:39:47,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-04 14:39:47,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-04 14:39:47,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-04 14:39:47,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-03-04 14:39:47,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-03-04 14:39:47,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-03-04 14:39:47,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-03-04 14:39:47,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 14:39:47,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 14:39:47,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#0 [2025-03-04 14:39:47,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#1 [2025-03-04 14:39:47,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#2 [2025-03-04 14:39:47,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#3 [2025-03-04 14:39:47,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#4 [2025-03-04 14:39:47,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#5 [2025-03-04 14:39:47,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#6 [2025-03-04 14:39:47,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#7 [2025-03-04 14:39:47,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#8 [2025-03-04 14:39:47,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#9 [2025-03-04 14:39:47,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#10 [2025-03-04 14:39:47,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#11 [2025-03-04 14:39:47,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#12 [2025-03-04 14:39:47,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#13 [2025-03-04 14:39:47,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#14 [2025-03-04 14:39:47,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#15 [2025-03-04 14:39:47,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#16 [2025-03-04 14:39:47,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#17 [2025-03-04 14:39:47,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#18 [2025-03-04 14:39:47,329 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#0 [2025-03-04 14:39:47,329 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#1 [2025-03-04 14:39:47,329 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#2 [2025-03-04 14:39:47,329 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#3 [2025-03-04 14:39:47,329 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#4 [2025-03-04 14:39:47,329 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#5 [2025-03-04 14:39:47,329 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#6 [2025-03-04 14:39:47,329 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#7 [2025-03-04 14:39:47,329 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#8 [2025-03-04 14:39:47,329 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#9 [2025-03-04 14:39:47,329 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#10 [2025-03-04 14:39:47,329 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#11 [2025-03-04 14:39:47,329 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#12 [2025-03-04 14:39:47,329 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#13 [2025-03-04 14:39:47,329 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#14 [2025-03-04 14:39:47,329 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#15 [2025-03-04 14:39:47,329 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#16 [2025-03-04 14:39:47,329 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#17 [2025-03-04 14:39:47,329 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#18 [2025-03-04 14:39:47,330 INFO L130 BoogieDeclarations]: Found specification of procedure xmalloc [2025-03-04 14:39:47,330 INFO L138 BoogieDeclarations]: Found implementation of procedure xmalloc [2025-03-04 14:39:47,330 INFO L130 BoogieDeclarations]: Found specification of procedure getopt [2025-03-04 14:39:47,330 INFO L138 BoogieDeclarations]: Found implementation of procedure getopt [2025-03-04 14:39:47,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-03-04 14:39:47,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-03-04 14:39:47,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-03-04 14:39:47,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-03-04 14:39:47,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-03-04 14:39:47,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-03-04 14:39:47,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-03-04 14:39:47,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-03-04 14:39:47,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2025-03-04 14:39:47,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2025-03-04 14:39:47,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#10 [2025-03-04 14:39:47,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#11 [2025-03-04 14:39:47,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#12 [2025-03-04 14:39:47,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#13 [2025-03-04 14:39:47,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#14 [2025-03-04 14:39:47,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#15 [2025-03-04 14:39:47,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#16 [2025-03-04 14:39:47,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#17 [2025-03-04 14:39:47,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#18 [2025-03-04 14:39:47,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-04 14:39:47,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-04 14:39:47,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-04 14:39:47,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-04 14:39:47,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-04 14:39:47,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-04 14:39:47,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-04 14:39:47,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-04 14:39:47,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-03-04 14:39:47,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-03-04 14:39:47,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-03-04 14:39:47,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-03-04 14:39:47,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-03-04 14:39:47,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-03-04 14:39:47,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-03-04 14:39:47,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-03-04 14:39:47,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-03-04 14:39:47,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#17 [2025-03-04 14:39:47,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#18 [2025-03-04 14:39:47,333 INFO L130 BoogieDeclarations]: Found specification of procedure bb_simple_perror_msg [2025-03-04 14:39:47,333 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_simple_perror_msg [2025-03-04 14:39:47,334 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 14:39:47,334 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 14:39:47,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 14:39:47,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 14:39:47,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 14:39:47,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 14:39:47,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 14:39:47,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-04 14:39:47,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-04 14:39:47,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-04 14:39:47,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-04 14:39:47,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-04 14:39:47,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-04 14:39:47,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-04 14:39:47,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-04 14:39:47,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-04 14:39:47,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-04 14:39:47,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-04 14:39:47,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-03-04 14:39:47,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-03-04 14:39:47,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-03-04 14:39:47,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-03-04 14:39:47,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 14:39:47,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 14:39:47,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 14:39:47,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 14:39:47,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 14:39:47,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 14:39:47,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 14:39:47,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-04 14:39:47,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-04 14:39:47,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-04 14:39:47,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-04 14:39:47,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-04 14:39:47,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-04 14:39:47,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-04 14:39:47,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-04 14:39:47,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-04 14:39:47,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-04 14:39:47,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-03-04 14:39:47,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-03-04 14:39:47,334 INFO L130 BoogieDeclarations]: Found specification of procedure xmalloc_fgets [2025-03-04 14:39:47,334 INFO L138 BoogieDeclarations]: Found implementation of procedure xmalloc_fgets [2025-03-04 14:39:47,334 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg_and_die [2025-03-04 14:39:47,334 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg_and_die [2025-03-04 14:39:47,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 14:39:47,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 14:39:47,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 14:39:47,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 14:39:47,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 14:39:47,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 14:39:47,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 14:39:47,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-04 14:39:47,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-04 14:39:47,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-04 14:39:47,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-04 14:39:47,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-04 14:39:47,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-04 14:39:47,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-04 14:39:47,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-04 14:39:47,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-04 14:39:47,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-04 14:39:47,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-04 14:39:47,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-04 14:39:47,736 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 14:39:47,739 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 14:39:47,891 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2863: havoc #t~nondet150; [2025-03-04 14:39:48,282 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2773: call ULTIMATE.dealloc(~#i~0#1.base, ~#i~0#1.offset);havoc ~#i~0#1.base, ~#i~0#1.offset; [2025-03-04 14:39:52,978 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2420: havoc fclose_if_not_stdin_#t~bitwise80#1; [2025-03-04 14:39:52,978 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2492: call ULTIMATE.dealloc(__main_~#negative_N~0#1.base, __main_~#negative_N~0#1.offset);havoc __main_~#negative_N~0#1.base, __main_~#negative_N~0#1.offset; [2025-03-04 14:39:53,134 INFO L? ?]: Removed 574 outVars from TransFormulas that were not future-live. [2025-03-04 14:39:53,135 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 14:39:53,166 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 14:39:53,169 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 14:39:53,170 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:39:53 BoogieIcfgContainer [2025-03-04 14:39:53,170 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 14:39:53,172 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 14:39:53,172 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 14:39:53,176 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 14:39:53,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:39:45" (1/3) ... [2025-03-04 14:39:53,179 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cb16f9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:39:53, skipping insertion in model container [2025-03-04 14:39:53,179 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:39:46" (2/3) ... [2025-03-04 14:39:53,180 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cb16f9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:39:53, skipping insertion in model container [2025-03-04 14:39:53,180 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:39:53" (3/3) ... [2025-03-04 14:39:53,180 INFO L128 eAbstractionObserver]: Analyzing ICFG head-2.i [2025-03-04 14:39:53,192 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 14:39:53,198 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG head-2.i that has 48 procedures, 517 locations, 1 initial locations, 41 loop locations, and 46 error locations. [2025-03-04 14:39:53,250 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 14:39:53,261 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;@3b58c29e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 14:39:53,261 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2025-03-04 14:39:53,265 INFO L276 IsEmpty]: Start isEmpty. Operand has 376 states, 289 states have (on average 1.5847750865051904) internal successors, (458), 338 states have internal predecessors, (458), 29 states have call successors, (29), 12 states have call predecessors, (29), 12 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-04 14:39:53,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 14:39:53,270 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:39:53,271 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 14:39:53,271 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-04 14:39:53,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:39:53,276 INFO L85 PathProgramCache]: Analyzing trace with hash 25057151, now seen corresponding path program 1 times [2025-03-04 14:39:53,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:39:53,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880857538] [2025-03-04 14:39:53,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:39:53,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:39:53,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 14:39:54,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 14:39:54,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:39:54,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:39:54,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:39:54,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:39:54,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880857538] [2025-03-04 14:39:54,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880857538] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:39:54,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:39:54,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:39:54,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50082588] [2025-03-04 14:39:54,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:39:54,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:39:54,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:39:54,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:39:54,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:39:54,443 INFO L87 Difference]: Start difference. First operand has 376 states, 289 states have (on average 1.5847750865051904) internal successors, (458), 338 states have internal predecessors, (458), 29 states have call successors, (29), 12 states have call predecessors, (29), 12 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:39:54,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:39:54,571 INFO L93 Difference]: Finished difference Result 640 states and 909 transitions. [2025-03-04 14:39:54,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:39:54,573 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-04 14:39:54,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:39:54,580 INFO L225 Difference]: With dead ends: 640 [2025-03-04 14:39:54,580 INFO L226 Difference]: Without dead ends: 268 [2025-03-04 14:39:54,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:39:54,589 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 1 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:39:54,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 694 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:39:54,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2025-03-04 14:39:54,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2025-03-04 14:39:54,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 215 states have (on average 1.4651162790697674) internal successors, (315), 241 states have internal predecessors, (315), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 14:39:54,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 355 transitions. [2025-03-04 14:39:54,649 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 355 transitions. Word has length 4 [2025-03-04 14:39:54,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:39:54,649 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 355 transitions. [2025-03-04 14:39:54,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:39:54,649 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 355 transitions. [2025-03-04 14:39:54,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 14:39:54,649 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:39:54,650 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-04 14:39:54,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 14:39:54,650 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-04 14:39:54,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:39:54,651 INFO L85 PathProgramCache]: Analyzing trace with hash -845981173, now seen corresponding path program 1 times [2025-03-04 14:39:54,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:39:54,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098093407] [2025-03-04 14:39:54,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:39:54,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:39:55,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 14:39:55,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 14:39:55,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:39:55,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:39:55,410 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:39:55,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:39:55,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098093407] [2025-03-04 14:39:55,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098093407] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:39:55,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1241239883] [2025-03-04 14:39:55,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:39:55,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:39:55,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:39:55,413 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:39:55,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 14:39:56,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 14:39:56,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 14:39:56,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:39:56,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:39:56,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 1664 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:39:56,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:39:56,485 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:39:56,485 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:39:56,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1241239883] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:39:56,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:39:56,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-04 14:39:56,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116468400] [2025-03-04 14:39:56,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:39:56,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:39:56,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:39:56,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:39:56,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:39:56,486 INFO L87 Difference]: Start difference. First operand 268 states and 355 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:39:56,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:39:56,562 INFO L93 Difference]: Finished difference Result 268 states and 355 transitions. [2025-03-04 14:39:56,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:39:56,565 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-04 14:39:56,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:39:56,566 INFO L225 Difference]: With dead ends: 268 [2025-03-04 14:39:56,566 INFO L226 Difference]: Without dead ends: 267 [2025-03-04 14:39:56,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:39:56,567 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 1 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:39:56,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 689 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:39:56,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-03-04 14:39:56,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2025-03-04 14:39:56,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 215 states have (on average 1.4604651162790698) internal successors, (314), 240 states have internal predecessors, (314), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 14:39:56,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 354 transitions. [2025-03-04 14:39:56,585 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 354 transitions. Word has length 7 [2025-03-04 14:39:56,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:39:56,585 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 354 transitions. [2025-03-04 14:39:56,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:39:56,586 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 354 transitions. [2025-03-04 14:39:56,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 14:39:56,586 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:39:56,586 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-03-04 14:39:56,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 14:39:56,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:39:56,787 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-04 14:39:56,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:39:56,789 INFO L85 PathProgramCache]: Analyzing trace with hash -455611839, now seen corresponding path program 1 times [2025-03-04 14:39:56,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:39:56,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663949977] [2025-03-04 14:39:56,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:39:56,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:39:57,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 14:39:57,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 14:39:57,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:39:57,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:39:57,363 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 14:39:57,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:39:57,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663949977] [2025-03-04 14:39:57,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663949977] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:39:57,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:39:57,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:39:57,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360957033] [2025-03-04 14:39:57,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:39:57,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:39:57,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:39:57,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:39:57,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:39:57,364 INFO L87 Difference]: Start difference. First operand 267 states and 354 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:39:57,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:39:57,400 INFO L93 Difference]: Finished difference Result 267 states and 354 transitions. [2025-03-04 14:39:57,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:39:57,400 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-04 14:39:57,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:39:57,401 INFO L225 Difference]: With dead ends: 267 [2025-03-04 14:39:57,401 INFO L226 Difference]: Without dead ends: 266 [2025-03-04 14:39:57,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:39:57,402 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 0 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:39:57,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 690 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:39:57,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-03-04 14:39:57,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 264. [2025-03-04 14:39:57,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 213 states have (on average 1.460093896713615) internal successors, (311), 237 states have internal predecessors, (311), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 14:39:57,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 351 transitions. [2025-03-04 14:39:57,411 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 351 transitions. Word has length 8 [2025-03-04 14:39:57,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:39:57,411 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 351 transitions. [2025-03-04 14:39:57,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:39:57,411 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 351 transitions. [2025-03-04 14:39:57,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 14:39:57,412 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:39:57,412 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:39:57,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 14:39:57,412 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-04 14:39:57,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:39:57,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1074561400, now seen corresponding path program 1 times [2025-03-04 14:39:57,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:39:57,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109381189] [2025-03-04 14:39:57,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:39:57,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:39:57,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 14:39:57,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 14:39:57,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:39:57,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:39:58,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:39:58,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:39:58,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109381189] [2025-03-04 14:39:58,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109381189] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:39:58,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896942148] [2025-03-04 14:39:58,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:39:58,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:39:58,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:39:58,086 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:39:58,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 14:39:58,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 14:39:58,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 14:39:58,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:39:58,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:39:58,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 1681 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 14:39:58,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:39:59,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 14:39:59,011 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:39:59,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [896942148] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:39:59,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:39:59,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-04 14:39:59,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615881896] [2025-03-04 14:39:59,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:39:59,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:39:59,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:39:59,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:39:59,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:39:59,013 INFO L87 Difference]: Start difference. First operand 264 states and 351 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:39:59,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:39:59,072 INFO L93 Difference]: Finished difference Result 264 states and 351 transitions. [2025-03-04 14:39:59,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:39:59,073 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2025-03-04 14:39:59,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:39:59,075 INFO L225 Difference]: With dead ends: 264 [2025-03-04 14:39:59,075 INFO L226 Difference]: Without dead ends: 262 [2025-03-04 14:39:59,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:39:59,075 INFO L435 NwaCegarLoop]: 339 mSDtfsCounter, 204 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:39:59,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 468 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:39:59,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2025-03-04 14:39:59,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 262. [2025-03-04 14:39:59,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 213 states have (on average 1.4507042253521127) internal successors, (309), 235 states have internal predecessors, (309), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 14:39:59,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 349 transitions. [2025-03-04 14:39:59,093 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 349 transitions. Word has length 12 [2025-03-04 14:39:59,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:39:59,095 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 349 transitions. [2025-03-04 14:39:59,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:39:59,096 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 349 transitions. [2025-03-04 14:39:59,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 14:39:59,096 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:39:59,096 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:39:59,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 14:39:59,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-04 14:39:59,297 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-04 14:39:59,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:39:59,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1048335710, now seen corresponding path program 1 times [2025-03-04 14:39:59,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:39:59,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475266361] [2025-03-04 14:39:59,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:39:59,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:39:59,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 14:39:59,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 14:39:59,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:39:59,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:39:59,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:39:59,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:39:59,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475266361] [2025-03-04 14:39:59,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475266361] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:39:59,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900281630] [2025-03-04 14:39:59,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:39:59,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:39:59,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:39:59,897 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:39:59,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 14:40:00,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 14:40:00,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 14:40:00,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:00,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:00,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 1682 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:40:00,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:40:00,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:40:00,803 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:40:00,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:40:00,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1900281630] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:40:00,895 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:40:00,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 14:40:00,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867454746] [2025-03-04 14:40:00,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:40:00,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 14:40:00,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:40:00,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 14:40:00,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:40:00,897 INFO L87 Difference]: Start difference. First operand 262 states and 349 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:40:00,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:00,990 INFO L93 Difference]: Finished difference Result 527 states and 703 transitions. [2025-03-04 14:40:00,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:40:00,990 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 13 [2025-03-04 14:40:00,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:00,992 INFO L225 Difference]: With dead ends: 527 [2025-03-04 14:40:00,992 INFO L226 Difference]: Without dead ends: 271 [2025-03-04 14:40:00,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:40:00,994 INFO L435 NwaCegarLoop]: 344 mSDtfsCounter, 4 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:40:00,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 686 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:40:00,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2025-03-04 14:40:01,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2025-03-04 14:40:01,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 222 states have (on average 1.4324324324324325) internal successors, (318), 244 states have internal predecessors, (318), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 14:40:01,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 358 transitions. [2025-03-04 14:40:01,007 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 358 transitions. Word has length 13 [2025-03-04 14:40:01,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:01,008 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 358 transitions. [2025-03-04 14:40:01,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:40:01,008 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 358 transitions. [2025-03-04 14:40:01,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 14:40:01,008 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:01,008 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:40:01,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 14:40:01,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:40:01,213 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-04 14:40:01,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:01,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1775692590, now seen corresponding path program 2 times [2025-03-04 14:40:01,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:40:01,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262166315] [2025-03-04 14:40:01,214 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 14:40:01,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:40:01,678 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 14:40:01,716 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 22 statements. [2025-03-04 14:40:01,717 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 14:40:01,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:02,031 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 14:40:02,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:40:02,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262166315] [2025-03-04 14:40:02,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262166315] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:40:02,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:40:02,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 14:40:02,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76772927] [2025-03-04 14:40:02,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:40:02,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 14:40:02,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:40:02,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 14:40:02,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:40:02,032 INFO L87 Difference]: Start difference. First operand 271 states and 358 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:40:02,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:02,180 INFO L93 Difference]: Finished difference Result 271 states and 358 transitions. [2025-03-04 14:40:02,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 14:40:02,181 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2025-03-04 14:40:02,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:02,182 INFO L225 Difference]: With dead ends: 271 [2025-03-04 14:40:02,182 INFO L226 Difference]: Without dead ends: 269 [2025-03-04 14:40:02,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:40:02,183 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 203 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 1128 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:40:02,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 1128 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:40:02,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2025-03-04 14:40:02,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2025-03-04 14:40:02,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 222 states have (on average 1.4234234234234233) internal successors, (316), 242 states have internal predecessors, (316), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 14:40:02,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 356 transitions. [2025-03-04 14:40:02,196 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 356 transitions. Word has length 22 [2025-03-04 14:40:02,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:02,197 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 356 transitions. [2025-03-04 14:40:02,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:40:02,197 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 356 transitions. [2025-03-04 14:40:02,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-04 14:40:02,197 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:02,197 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:40:02,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 14:40:02,198 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-04 14:40:02,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:02,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1932283089, now seen corresponding path program 1 times [2025-03-04 14:40:02,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:40:02,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539901009] [2025-03-04 14:40:02,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:02,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:40:02,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 14:40:02,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 14:40:02,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:02,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:02,782 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 14:40:02,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:40:02,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539901009] [2025-03-04 14:40:02,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539901009] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:40:02,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:40:02,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:40:02,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560708368] [2025-03-04 14:40:02,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:40:02,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:40:02,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:40:02,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:40:02,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:40:02,784 INFO L87 Difference]: Start difference. First operand 269 states and 356 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:40:02,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:02,844 INFO L93 Difference]: Finished difference Result 521 states and 696 transitions. [2025-03-04 14:40:02,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:40:02,845 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2025-03-04 14:40:02,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:02,846 INFO L225 Difference]: With dead ends: 521 [2025-03-04 14:40:02,846 INFO L226 Difference]: Without dead ends: 272 [2025-03-04 14:40:02,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:40:02,847 INFO L435 NwaCegarLoop]: 342 mSDtfsCounter, 2 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:40:02,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 679 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:40:02,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2025-03-04 14:40:02,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2025-03-04 14:40:02,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 225 states have (on average 1.4177777777777778) internal successors, (319), 245 states have internal predecessors, (319), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 14:40:02,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 359 transitions. [2025-03-04 14:40:02,857 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 359 transitions. Word has length 27 [2025-03-04 14:40:02,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:02,858 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 359 transitions. [2025-03-04 14:40:02,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:40:02,858 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 359 transitions. [2025-03-04 14:40:02,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 14:40:02,858 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:02,858 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:40:02,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 14:40:02,859 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-04 14:40:02,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:02,859 INFO L85 PathProgramCache]: Analyzing trace with hash 806657291, now seen corresponding path program 1 times [2025-03-04 14:40:02,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:40:02,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656150145] [2025-03-04 14:40:02,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:02,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:40:03,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 14:40:03,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 14:40:03,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:03,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:03,422 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-04 14:40:03,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:40:03,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656150145] [2025-03-04 14:40:03,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656150145] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:40:03,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:40:03,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:40:03,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895241925] [2025-03-04 14:40:03,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:40:03,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:40:03,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:40:03,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:40:03,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:40:03,425 INFO L87 Difference]: Start difference. First operand 272 states and 359 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:40:03,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:03,503 INFO L93 Difference]: Finished difference Result 285 states and 374 transitions. [2025-03-04 14:40:03,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:40:03,504 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2025-03-04 14:40:03,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:03,506 INFO L225 Difference]: With dead ends: 285 [2025-03-04 14:40:03,507 INFO L226 Difference]: Without dead ends: 283 [2025-03-04 14:40:03,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:40:03,509 INFO L435 NwaCegarLoop]: 340 mSDtfsCounter, 3 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:40:03,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 676 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:40:03,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2025-03-04 14:40:03,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 281. [2025-03-04 14:40:03,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 234 states have (on average 1.4188034188034189) internal successors, (332), 254 states have internal predecessors, (332), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 14:40:03,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 372 transitions. [2025-03-04 14:40:03,521 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 372 transitions. Word has length 30 [2025-03-04 14:40:03,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:03,521 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 372 transitions. [2025-03-04 14:40:03,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:40:03,522 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 372 transitions. [2025-03-04 14:40:03,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 14:40:03,522 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:03,523 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:40:03,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 14:40:03,523 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-04 14:40:03,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:03,523 INFO L85 PathProgramCache]: Analyzing trace with hash 806657451, now seen corresponding path program 1 times [2025-03-04 14:40:03,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:40:03,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220705593] [2025-03-04 14:40:03,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:03,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:40:03,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 14:40:03,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 14:40:03,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:03,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:04,120 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 14:40:04,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:40:04,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220705593] [2025-03-04 14:40:04,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220705593] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:40:04,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594361648] [2025-03-04 14:40:04,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:04,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:40:04,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:40:04,123 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:40:04,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 14:40:05,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 14:40:05,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 14:40:05,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:05,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:05,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 1871 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 14:40:05,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:40:05,342 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 14:40:05,342 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:40:05,565 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 14:40:05,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [594361648] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:40:05,565 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:40:05,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-03-04 14:40:05,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849378886] [2025-03-04 14:40:05,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:40:05,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 14:40:05,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:40:05,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 14:40:05,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-04 14:40:05,566 INFO L87 Difference]: Start difference. First operand 281 states and 372 transitions. Second operand has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 14:40:05,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:05,875 INFO L93 Difference]: Finished difference Result 564 states and 752 transitions. [2025-03-04 14:40:05,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 14:40:05,876 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2025-03-04 14:40:05,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:05,877 INFO L225 Difference]: With dead ends: 564 [2025-03-04 14:40:05,877 INFO L226 Difference]: Without dead ends: 298 [2025-03-04 14:40:05,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-04 14:40:05,878 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 5 mSDsluCounter, 2004 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2340 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 14:40:05,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2340 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 14:40:05,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2025-03-04 14:40:05,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2025-03-04 14:40:05,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 252 states have (on average 1.380952380952381) internal successors, (348), 271 states have internal predecessors, (348), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 14:40:05,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 388 transitions. [2025-03-04 14:40:05,887 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 388 transitions. Word has length 30 [2025-03-04 14:40:05,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:05,888 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 388 transitions. [2025-03-04 14:40:05,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 14:40:05,888 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 388 transitions. [2025-03-04 14:40:05,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-04 14:40:05,892 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:05,892 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:40:05,903 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 14:40:06,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:40:06,093 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-04 14:40:06,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:06,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1218863855, now seen corresponding path program 1 times [2025-03-04 14:40:06,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:40:06,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98928327] [2025-03-04 14:40:06,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:06,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:40:06,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 14:40:06,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 14:40:06,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:06,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:06,625 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-03-04 14:40:06,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:40:06,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98928327] [2025-03-04 14:40:06,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98928327] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:40:06,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:40:06,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:40:06,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837198517] [2025-03-04 14:40:06,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:40:06,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:40:06,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:40:06,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:40:06,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:40:06,627 INFO L87 Difference]: Start difference. First operand 298 states and 388 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:40:06,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:06,664 INFO L93 Difference]: Finished difference Result 298 states and 388 transitions. [2025-03-04 14:40:06,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:40:06,664 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2025-03-04 14:40:06,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:06,666 INFO L225 Difference]: With dead ends: 298 [2025-03-04 14:40:06,666 INFO L226 Difference]: Without dead ends: 297 [2025-03-04 14:40:06,667 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:40:06,667 INFO L435 NwaCegarLoop]: 340 mSDtfsCounter, 0 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:40:06,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 677 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:40:06,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2025-03-04 14:40:06,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 293. [2025-03-04 14:40:06,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 248 states have (on average 1.3790322580645162) internal successors, (342), 266 states have internal predecessors, (342), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 14:40:06,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 382 transitions. [2025-03-04 14:40:06,683 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 382 transitions. Word has length 49 [2025-03-04 14:40:06,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:06,683 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 382 transitions. [2025-03-04 14:40:06,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:40:06,683 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 382 transitions. [2025-03-04 14:40:06,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-04 14:40:06,684 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:06,684 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:40:06,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 14:40:06,684 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-04 14:40:06,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:06,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1100047167, now seen corresponding path program 1 times [2025-03-04 14:40:06,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:40:06,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137118294] [2025-03-04 14:40:06,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:06,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:40:07,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 14:40:07,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 14:40:07,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:07,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:07,335 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:40:07,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:40:07,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137118294] [2025-03-04 14:40:07,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137118294] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:40:07,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:40:07,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 14:40:07,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128555586] [2025-03-04 14:40:07,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:40:07,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 14:40:07,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:40:07,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 14:40:07,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:40:07,336 INFO L87 Difference]: Start difference. First operand 293 states and 382 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:40:08,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:08,632 INFO L93 Difference]: Finished difference Result 798 states and 1074 transitions. [2025-03-04 14:40:08,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 14:40:08,632 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 55 [2025-03-04 14:40:08,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:08,636 INFO L225 Difference]: With dead ends: 798 [2025-03-04 14:40:08,636 INFO L226 Difference]: Without dead ends: 564 [2025-03-04 14:40:08,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:40:08,637 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 543 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-04 14:40:08,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [558 Valid, 937 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-04 14:40:08,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2025-03-04 14:40:08,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 389. [2025-03-04 14:40:08,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 337 states have (on average 1.4124629080118694) internal successors, (476), 357 states have internal predecessors, (476), 26 states have call successors, (26), 12 states have call predecessors, (26), 13 states have return successors, (23), 20 states have call predecessors, (23), 20 states have call successors, (23) [2025-03-04 14:40:08,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 525 transitions. [2025-03-04 14:40:08,653 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 525 transitions. Word has length 55 [2025-03-04 14:40:08,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:08,653 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 525 transitions. [2025-03-04 14:40:08,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:40:08,653 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 525 transitions. [2025-03-04 14:40:08,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-04 14:40:08,655 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:08,655 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:40:08,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 14:40:08,655 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-04 14:40:08,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:08,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1387465666, now seen corresponding path program 1 times [2025-03-04 14:40:08,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:40:08,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609728265] [2025-03-04 14:40:08,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:08,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:40:09,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 14:40:09,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 14:40:09,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:09,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:09,415 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:40:09,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:40:09,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609728265] [2025-03-04 14:40:09,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609728265] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:40:09,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:40:09,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 14:40:09,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172564224] [2025-03-04 14:40:09,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:40:09,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 14:40:09,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:40:09,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 14:40:09,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:40:09,418 INFO L87 Difference]: Start difference. First operand 389 states and 525 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:40:09,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:09,711 INFO L93 Difference]: Finished difference Result 506 states and 699 transitions. [2025-03-04 14:40:09,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 14:40:09,712 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 55 [2025-03-04 14:40:09,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:09,714 INFO L225 Difference]: With dead ends: 506 [2025-03-04 14:40:09,714 INFO L226 Difference]: Without dead ends: 505 [2025-03-04 14:40:09,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-04 14:40:09,715 INFO L435 NwaCegarLoop]: 330 mSDtfsCounter, 132 mSDsluCounter, 937 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 1267 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 14:40:09,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 1267 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 14:40:09,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2025-03-04 14:40:09,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 488. [2025-03-04 14:40:09,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 430 states have (on average 1.4348837209302325) internal successors, (617), 452 states have internal predecessors, (617), 28 states have call successors, (28), 14 states have call predecessors, (28), 17 states have return successors, (34), 22 states have call predecessors, (34), 22 states have call successors, (34) [2025-03-04 14:40:09,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 679 transitions. [2025-03-04 14:40:09,729 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 679 transitions. Word has length 55 [2025-03-04 14:40:09,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:09,729 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 679 transitions. [2025-03-04 14:40:09,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:40:09,730 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 679 transitions. [2025-03-04 14:40:09,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-04 14:40:09,730 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:09,730 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:40:09,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 14:40:09,730 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-04 14:40:09,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:09,731 INFO L85 PathProgramCache]: Analyzing trace with hash -2019997949, now seen corresponding path program 1 times [2025-03-04 14:40:09,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:40:09,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755149684] [2025-03-04 14:40:09,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:09,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:40:10,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 14:40:10,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 14:40:10,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:10,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:10,611 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:40:10,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:40:10,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755149684] [2025-03-04 14:40:10,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755149684] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:40:10,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:40:10,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 14:40:10,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432842238] [2025-03-04 14:40:10,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:40:10,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 14:40:10,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:40:10,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 14:40:10,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:40:10,613 INFO L87 Difference]: Start difference. First operand 488 states and 679 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 14:40:10,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:10,880 INFO L93 Difference]: Finished difference Result 922 states and 1298 transitions. [2025-03-04 14:40:10,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:40:10,880 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 55 [2025-03-04 14:40:10,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:10,883 INFO L225 Difference]: With dead ends: 922 [2025-03-04 14:40:10,883 INFO L226 Difference]: Without dead ends: 488 [2025-03-04 14:40:10,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:40:10,884 INFO L435 NwaCegarLoop]: 331 mSDtfsCounter, 205 mSDsluCounter, 1099 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 1430 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 14:40:10,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 1430 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 14:40:10,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2025-03-04 14:40:10,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 488. [2025-03-04 14:40:10,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 430 states have (on average 1.4325581395348836) internal successors, (616), 452 states have internal predecessors, (616), 28 states have call successors, (28), 14 states have call predecessors, (28), 17 states have return successors, (34), 22 states have call predecessors, (34), 22 states have call successors, (34) [2025-03-04 14:40:10,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 678 transitions. [2025-03-04 14:40:10,898 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 678 transitions. Word has length 55 [2025-03-04 14:40:10,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:10,898 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 678 transitions. [2025-03-04 14:40:10,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 14:40:10,898 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 678 transitions. [2025-03-04 14:40:10,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-04 14:40:10,898 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:10,898 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:40:10,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 14:40:10,899 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-04 14:40:10,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:10,899 INFO L85 PathProgramCache]: Analyzing trace with hash -461468441, now seen corresponding path program 1 times [2025-03-04 14:40:10,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:40:10,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347018351] [2025-03-04 14:40:10,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:10,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:40:11,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 14:40:11,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 14:40:11,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:11,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:11,505 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-04 14:40:11,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:40:11,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347018351] [2025-03-04 14:40:11,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347018351] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:40:11,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583508142] [2025-03-04 14:40:11,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:11,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:40:11,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:40:11,508 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:40:11,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 14:40:12,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 14:40:12,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 14:40:12,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:12,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:12,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 2044 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:40:12,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:40:12,740 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-04 14:40:12,740 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:40:12,796 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-04 14:40:12,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1583508142] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:40:12,796 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:40:12,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 14:40:12,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605318981] [2025-03-04 14:40:12,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:40:12,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 14:40:12,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:40:12,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 14:40:12,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:40:12,797 INFO L87 Difference]: Start difference. First operand 488 states and 678 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:40:12,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:12,889 INFO L93 Difference]: Finished difference Result 951 states and 1334 transitions. [2025-03-04 14:40:12,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:40:12,889 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2025-03-04 14:40:12,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:12,892 INFO L225 Difference]: With dead ends: 951 [2025-03-04 14:40:12,892 INFO L226 Difference]: Without dead ends: 506 [2025-03-04 14:40:12,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:40:12,894 INFO L435 NwaCegarLoop]: 340 mSDtfsCounter, 4 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1014 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:40:12,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1014 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:40:12,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2025-03-04 14:40:12,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 506. [2025-03-04 14:40:12,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 448 states have (on average 1.4151785714285714) internal successors, (634), 470 states have internal predecessors, (634), 28 states have call successors, (28), 14 states have call predecessors, (28), 17 states have return successors, (34), 22 states have call predecessors, (34), 22 states have call successors, (34) [2025-03-04 14:40:12,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 696 transitions. [2025-03-04 14:40:12,913 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 696 transitions. Word has length 55 [2025-03-04 14:40:12,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:12,913 INFO L471 AbstractCegarLoop]: Abstraction has 506 states and 696 transitions. [2025-03-04 14:40:12,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:40:12,913 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 696 transitions. [2025-03-04 14:40:12,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-04 14:40:12,914 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:12,914 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:40:12,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 14:40:13,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-04 14:40:13,114 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-04 14:40:13,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:13,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1939462581, now seen corresponding path program 1 times [2025-03-04 14:40:13,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:40:13,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566713492] [2025-03-04 14:40:13,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:13,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:40:13,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-04 14:40:13,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-04 14:40:13,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:13,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:13,879 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:40:13,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:40:13,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566713492] [2025-03-04 14:40:13,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566713492] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:40:13,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869918264] [2025-03-04 14:40:13,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:13,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:40:13,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:40:13,883 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:40:13,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 14:40:14,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-04 14:40:14,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-04 14:40:14,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:14,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:14,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 2131 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 14:40:14,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:40:15,065 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:40:15,066 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:40:15,305 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:40:15,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [869918264] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:40:15,305 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:40:15,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-04 14:40:15,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453584415] [2025-03-04 14:40:15,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:40:15,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 14:40:15,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:40:15,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 14:40:15,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-04 14:40:15,306 INFO L87 Difference]: Start difference. First operand 506 states and 696 transitions. Second operand has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 states have internal predecessors, (64), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 14:40:15,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:15,438 INFO L93 Difference]: Finished difference Result 996 states and 1385 transitions. [2025-03-04 14:40:15,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 14:40:15,439 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 states have internal predecessors, (64), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 71 [2025-03-04 14:40:15,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:15,441 INFO L225 Difference]: With dead ends: 996 [2025-03-04 14:40:15,441 INFO L226 Difference]: Without dead ends: 542 [2025-03-04 14:40:15,442 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-04 14:40:15,442 INFO L435 NwaCegarLoop]: 340 mSDtfsCounter, 4 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1014 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:40:15,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1014 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:40:15,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2025-03-04 14:40:15,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 542. [2025-03-04 14:40:15,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 484 states have (on average 1.384297520661157) internal successors, (670), 506 states have internal predecessors, (670), 28 states have call successors, (28), 14 states have call predecessors, (28), 17 states have return successors, (34), 22 states have call predecessors, (34), 22 states have call successors, (34) [2025-03-04 14:40:15,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 732 transitions. [2025-03-04 14:40:15,457 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 732 transitions. Word has length 71 [2025-03-04 14:40:15,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:15,457 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 732 transitions. [2025-03-04 14:40:15,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 states have internal predecessors, (64), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 14:40:15,457 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 732 transitions. [2025-03-04 14:40:15,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-04 14:40:15,458 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:15,458 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:40:15,470 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 14:40:15,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 14:40:15,659 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-04 14:40:15,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:15,659 INFO L85 PathProgramCache]: Analyzing trace with hash 2081074635, now seen corresponding path program 2 times [2025-03-04 14:40:15,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:40:15,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049672527] [2025-03-04 14:40:15,659 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 14:40:15,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:40:16,058 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 89 statements into 2 equivalence classes. [2025-03-04 14:40:16,128 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 89 statements. [2025-03-04 14:40:16,128 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 14:40:16,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:16,744 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-04 14:40:16,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:40:16,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049672527] [2025-03-04 14:40:16,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049672527] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:40:16,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:40:16,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 14:40:16,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191137449] [2025-03-04 14:40:16,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:40:16,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 14:40:16,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:40:16,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 14:40:16,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 14:40:16,746 INFO L87 Difference]: Start difference. First operand 542 states and 732 transitions. Second operand has 8 states, 6 states have (on average 5.166666666666667) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 14:40:18,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:18,713 INFO L93 Difference]: Finished difference Result 807 states and 1102 transitions. [2025-03-04 14:40:18,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 14:40:18,713 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 5.166666666666667) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 89 [2025-03-04 14:40:18,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:18,717 INFO L225 Difference]: With dead ends: 807 [2025-03-04 14:40:18,717 INFO L226 Difference]: Without dead ends: 806 [2025-03-04 14:40:18,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-03-04 14:40:18,717 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 735 mSDsluCounter, 1092 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 750 SdHoareTripleChecker+Valid, 1325 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-04 14:40:18,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [750 Valid, 1325 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 688 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-04 14:40:18,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2025-03-04 14:40:18,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 729. [2025-03-04 14:40:18,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 650 states have (on average 1.4) internal successors, (910), 673 states have internal predecessors, (910), 43 states have call successors, (43), 20 states have call predecessors, (43), 23 states have return successors, (50), 37 states have call predecessors, (50), 37 states have call successors, (50) [2025-03-04 14:40:18,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 1003 transitions. [2025-03-04 14:40:18,761 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 1003 transitions. Word has length 89 [2025-03-04 14:40:18,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:18,762 INFO L471 AbstractCegarLoop]: Abstraction has 729 states and 1003 transitions. [2025-03-04 14:40:18,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 5.166666666666667) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 14:40:18,762 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 1003 transitions. [2025-03-04 14:40:18,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-04 14:40:18,762 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:18,763 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:40:18,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 14:40:18,763 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-04 14:40:18,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:18,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1654005474, now seen corresponding path program 1 times [2025-03-04 14:40:18,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:40:18,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859572063] [2025-03-04 14:40:18,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:18,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:40:19,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-04 14:40:19,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-04 14:40:19,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:19,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:20,340 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2025-03-04 14:40:20,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:40:20,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859572063] [2025-03-04 14:40:20,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859572063] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:40:20,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170330808] [2025-03-04 14:40:20,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:20,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:40:20,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:40:20,343 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:40:20,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 14:40:21,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-04 14:40:21,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-04 14:40:21,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:21,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:21,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 2277 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 14:40:21,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:40:22,759 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2025-03-04 14:40:22,760 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:40:23,730 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2025-03-04 14:40:23,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1170330808] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:40:23,731 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:40:23,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2025-03-04 14:40:23,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291520653] [2025-03-04 14:40:23,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:40:23,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 14:40:23,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:40:23,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 14:40:23,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=504, Unknown=0, NotChecked=0, Total=600 [2025-03-04 14:40:23,733 INFO L87 Difference]: Start difference. First operand 729 states and 1003 transitions. Second operand has 25 states, 25 states have (on average 2.84) internal successors, (71), 22 states have internal predecessors, (71), 5 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 14:40:30,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:30,187 INFO L93 Difference]: Finished difference Result 1354 states and 1861 transitions. [2025-03-04 14:40:30,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 14:40:30,190 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.84) internal successors, (71), 22 states have internal predecessors, (71), 5 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Word has length 90 [2025-03-04 14:40:30,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:30,193 INFO L225 Difference]: With dead ends: 1354 [2025-03-04 14:40:30,193 INFO L226 Difference]: Without dead ends: 737 [2025-03-04 14:40:30,194 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 166 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=283, Invalid=1123, Unknown=0, NotChecked=0, Total=1406 [2025-03-04 14:40:30,195 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 1765 mSDsluCounter, 2840 mSDsCounter, 0 mSdLazyCounter, 1716 mSolverCounterSat, 265 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1783 SdHoareTripleChecker+Valid, 3067 SdHoareTripleChecker+Invalid, 1981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 1716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2025-03-04 14:40:30,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1783 Valid, 3067 Invalid, 1981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 1716 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2025-03-04 14:40:30,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2025-03-04 14:40:30,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 707. [2025-03-04 14:40:30,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 625 states have (on average 1.3552) internal successors, (847), 650 states have internal predecessors, (847), 47 states have call successors, (47), 23 states have call predecessors, (47), 24 states have return successors, (41), 35 states have call predecessors, (41), 35 states have call successors, (41) [2025-03-04 14:40:30,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 935 transitions. [2025-03-04 14:40:30,220 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 935 transitions. Word has length 90 [2025-03-04 14:40:30,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:30,221 INFO L471 AbstractCegarLoop]: Abstraction has 707 states and 935 transitions. [2025-03-04 14:40:30,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.84) internal successors, (71), 22 states have internal predecessors, (71), 5 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 14:40:30,221 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 935 transitions. [2025-03-04 14:40:30,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-04 14:40:30,222 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:30,222 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:40:30,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 14:40:30,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:40:30,423 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-04 14:40:30,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:30,423 INFO L85 PathProgramCache]: Analyzing trace with hash 505998365, now seen corresponding path program 1 times [2025-03-04 14:40:30,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:40:30,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393062029] [2025-03-04 14:40:30,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:30,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:40:30,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-04 14:40:30,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 14:40:30,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:30,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:31,232 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2025-03-04 14:40:31,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:40:31,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393062029] [2025-03-04 14:40:31,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393062029] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:40:31,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:40:31,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:40:31,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613594092] [2025-03-04 14:40:31,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:40:31,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:40:31,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:40:31,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:40:31,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:40:31,233 INFO L87 Difference]: Start difference. First operand 707 states and 935 transitions. Second operand has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:40:31,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:31,551 INFO L93 Difference]: Finished difference Result 1010 states and 1344 transitions. [2025-03-04 14:40:31,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:40:31,551 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 101 [2025-03-04 14:40:31,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:31,555 INFO L225 Difference]: With dead ends: 1010 [2025-03-04 14:40:31,555 INFO L226 Difference]: Without dead ends: 1008 [2025-03-04 14:40:31,555 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:40:31,555 INFO L435 NwaCegarLoop]: 327 mSDtfsCounter, 870 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 870 SdHoareTripleChecker+Valid, 887 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 14:40:31,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [870 Valid, 887 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 14:40:31,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2025-03-04 14:40:31,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 827. [2025-03-04 14:40:31,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 827 states, 737 states have (on average 1.3772048846675713) internal successors, (1015), 764 states have internal predecessors, (1015), 50 states have call successors, (50), 26 states have call predecessors, (50), 29 states have return successors, (49), 38 states have call predecessors, (49), 38 states have call successors, (49) [2025-03-04 14:40:31,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1114 transitions. [2025-03-04 14:40:31,579 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1114 transitions. Word has length 101 [2025-03-04 14:40:31,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:31,580 INFO L471 AbstractCegarLoop]: Abstraction has 827 states and 1114 transitions. [2025-03-04 14:40:31,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:40:31,580 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1114 transitions. [2025-03-04 14:40:31,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-04 14:40:31,581 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:31,581 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:40:31,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 14:40:31,581 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-04 14:40:31,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:31,582 INFO L85 PathProgramCache]: Analyzing trace with hash 773977699, now seen corresponding path program 1 times [2025-03-04 14:40:31,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:40:31,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314296722] [2025-03-04 14:40:31,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:31,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:40:32,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-04 14:40:32,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 14:40:32,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:32,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:32,442 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-04 14:40:32,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:40:32,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314296722] [2025-03-04 14:40:32,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314296722] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:40:32,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:40:32,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 14:40:32,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206736732] [2025-03-04 14:40:32,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:40:32,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 14:40:32,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:40:32,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 14:40:32,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:40:32,443 INFO L87 Difference]: Start difference. First operand 827 states and 1114 transitions. Second operand has 5 states, 4 states have (on average 10.75) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:40:36,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 14:40:40,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 14:40:40,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:40,809 INFO L93 Difference]: Finished difference Result 949 states and 1312 transitions. [2025-03-04 14:40:40,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 14:40:40,810 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.75) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 101 [2025-03-04 14:40:40,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:40,813 INFO L225 Difference]: With dead ends: 949 [2025-03-04 14:40:40,813 INFO L226 Difference]: Without dead ends: 947 [2025-03-04 14:40:40,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:40:40,814 INFO L435 NwaCegarLoop]: 330 mSDtfsCounter, 30 mSDsluCounter, 964 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1294 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2025-03-04 14:40:40,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1294 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 2 Unknown, 0 Unchecked, 8.3s Time] [2025-03-04 14:40:40,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2025-03-04 14:40:40,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 851. [2025-03-04 14:40:40,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 851 states, 761 states have (on average 1.3731931668856767) internal successors, (1045), 788 states have internal predecessors, (1045), 50 states have call successors, (50), 26 states have call predecessors, (50), 29 states have return successors, (49), 38 states have call predecessors, (49), 38 states have call successors, (49) [2025-03-04 14:40:40,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1144 transitions. [2025-03-04 14:40:40,862 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1144 transitions. Word has length 101 [2025-03-04 14:40:40,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:40,862 INFO L471 AbstractCegarLoop]: Abstraction has 851 states and 1144 transitions. [2025-03-04 14:40:40,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.75) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:40:40,863 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1144 transitions. [2025-03-04 14:40:40,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-04 14:40:40,863 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:40,863 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:40:40,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 14:40:40,864 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-04 14:40:40,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:40,864 INFO L85 PathProgramCache]: Analyzing trace with hash 774007490, now seen corresponding path program 1 times [2025-03-04 14:40:40,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:40:40,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316224018] [2025-03-04 14:40:40,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:40,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:40:41,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-04 14:40:41,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 14:40:41,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:41,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:41,599 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-04 14:40:41,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:40:41,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316224018] [2025-03-04 14:40:41,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316224018] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:40:41,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:40:41,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 14:40:41,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953740401] [2025-03-04 14:40:41,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:40:41,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 14:40:41,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:40:41,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 14:40:41,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:40:41,601 INFO L87 Difference]: Start difference. First operand 851 states and 1144 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:40:41,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:41,727 INFO L93 Difference]: Finished difference Result 1526 states and 2086 transitions. [2025-03-04 14:40:41,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 14:40:41,727 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 101 [2025-03-04 14:40:41,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:41,730 INFO L225 Difference]: With dead ends: 1526 [2025-03-04 14:40:41,730 INFO L226 Difference]: Without dead ends: 827 [2025-03-04 14:40:41,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:40:41,732 INFO L435 NwaCegarLoop]: 338 mSDtfsCounter, 0 mSDsluCounter, 1001 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1339 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:40:41,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1339 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:40:41,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2025-03-04 14:40:41,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 823. [2025-03-04 14:40:41,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 823 states, 730 states have (on average 1.358904109589041) internal successors, (992), 757 states have internal predecessors, (992), 50 states have call successors, (50), 26 states have call predecessors, (50), 32 states have return successors, (54), 41 states have call predecessors, (54), 38 states have call successors, (54) [2025-03-04 14:40:41,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1096 transitions. [2025-03-04 14:40:41,755 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1096 transitions. Word has length 101 [2025-03-04 14:40:41,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:41,756 INFO L471 AbstractCegarLoop]: Abstraction has 823 states and 1096 transitions. [2025-03-04 14:40:41,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:40:41,756 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1096 transitions. [2025-03-04 14:40:41,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-04 14:40:41,757 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:41,757 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:40:41,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 14:40:41,757 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting bb_verror_msgErr19ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-04 14:40:41,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:41,757 INFO L85 PathProgramCache]: Analyzing trace with hash 2034921990, now seen corresponding path program 1 times [2025-03-04 14:40:41,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:40:41,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803519798] [2025-03-04 14:40:41,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:41,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:40:42,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-04 14:40:42,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-04 14:40:42,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:42,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:42,661 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-04 14:40:42,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:40:42,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803519798] [2025-03-04 14:40:42,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803519798] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:40:42,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:40:42,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 14:40:42,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171241359] [2025-03-04 14:40:42,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:40:42,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 14:40:42,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:40:42,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 14:40:42,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:40:42,663 INFO L87 Difference]: Start difference. First operand 823 states and 1096 transitions. Second operand has 5 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:40:42,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:42,805 INFO L93 Difference]: Finished difference Result 834 states and 1106 transitions. [2025-03-04 14:40:42,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 14:40:42,805 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 102 [2025-03-04 14:40:42,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:42,808 INFO L225 Difference]: With dead ends: 834 [2025-03-04 14:40:42,808 INFO L226 Difference]: Without dead ends: 831 [2025-03-04 14:40:42,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:40:42,810 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 13 mSDsluCounter, 1003 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1339 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:40:42,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1339 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:40:42,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2025-03-04 14:40:42,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 828. [2025-03-04 14:40:42,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 828 states, 734 states have (on average 1.3583106267029972) internal successors, (997), 761 states have internal predecessors, (997), 50 states have call successors, (50), 27 states have call predecessors, (50), 33 states have return successors, (54), 41 states have call predecessors, (54), 38 states have call successors, (54) [2025-03-04 14:40:42,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1101 transitions. [2025-03-04 14:40:42,851 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1101 transitions. Word has length 102 [2025-03-04 14:40:42,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:42,851 INFO L471 AbstractCegarLoop]: Abstraction has 828 states and 1101 transitions. [2025-03-04 14:40:42,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:40:42,851 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1101 transitions. [2025-03-04 14:40:42,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-04 14:40:42,853 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:42,853 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:40:42,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 14:40:42,854 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting bb_verror_msgErr19ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-04 14:40:42,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:42,854 INFO L85 PathProgramCache]: Analyzing trace with hash 2034922951, now seen corresponding path program 1 times [2025-03-04 14:40:42,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:40:42,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802254587] [2025-03-04 14:40:42,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:42,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:40:43,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-04 14:40:43,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-04 14:40:43,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:43,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:43,606 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-04 14:40:43,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:40:43,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802254587] [2025-03-04 14:40:43,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802254587] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:40:43,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:40:43,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 14:40:43,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578965009] [2025-03-04 14:40:43,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:40:43,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:40:43,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:40:43,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:40:43,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:40:43,607 INFO L87 Difference]: Start difference. First operand 828 states and 1101 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 14:40:43,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:43,744 INFO L93 Difference]: Finished difference Result 1544 states and 2124 transitions. [2025-03-04 14:40:43,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:40:43,744 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 102 [2025-03-04 14:40:43,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:43,749 INFO L225 Difference]: With dead ends: 1544 [2025-03-04 14:40:43,749 INFO L226 Difference]: Without dead ends: 1241 [2025-03-04 14:40:43,750 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:40:43,752 INFO L435 NwaCegarLoop]: 377 mSDtfsCounter, 174 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 1070 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:40:43,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 1070 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:40:43,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2025-03-04 14:40:43,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 1064. [2025-03-04 14:40:43,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1064 states, 965 states have (on average 1.3937823834196892) internal successors, (1345), 989 states have internal predecessors, (1345), 55 states have call successors, (55), 27 states have call predecessors, (55), 33 states have return successors, (75), 49 states have call predecessors, (75), 43 states have call successors, (75) [2025-03-04 14:40:43,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 1475 transitions. [2025-03-04 14:40:43,779 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 1475 transitions. Word has length 102 [2025-03-04 14:40:43,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:43,780 INFO L471 AbstractCegarLoop]: Abstraction has 1064 states and 1475 transitions. [2025-03-04 14:40:43,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 14:40:43,780 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1475 transitions. [2025-03-04 14:40:43,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 14:40:43,780 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:43,781 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:40:43,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 14:40:43,781 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-04 14:40:43,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:43,781 INFO L85 PathProgramCache]: Analyzing trace with hash 909644510, now seen corresponding path program 1 times [2025-03-04 14:40:43,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:40:43,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304298916] [2025-03-04 14:40:43,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:43,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:40:44,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 14:40:44,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 14:40:44,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:44,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:44,739 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-04 14:40:44,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:40:44,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304298916] [2025-03-04 14:40:44,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304298916] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:40:44,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:40:44,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 14:40:44,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099158923] [2025-03-04 14:40:44,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:40:44,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 14:40:44,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:40:44,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 14:40:44,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:40:44,740 INFO L87 Difference]: Start difference. First operand 1064 states and 1475 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:40:48,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 14:40:52,820 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 14:40:53,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:53,384 INFO L93 Difference]: Finished difference Result 1539 states and 2126 transitions. [2025-03-04 14:40:53,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 14:40:53,385 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 103 [2025-03-04 14:40:53,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:53,389 INFO L225 Difference]: With dead ends: 1539 [2025-03-04 14:40:53,389 INFO L226 Difference]: Without dead ends: 1253 [2025-03-04 14:40:53,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:40:53,391 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 448 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 11 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 1088 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2025-03-04 14:40:53,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 1088 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 154 Invalid, 2 Unknown, 0 Unchecked, 8.6s Time] [2025-03-04 14:40:53,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states. [2025-03-04 14:40:53,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 1092. [2025-03-04 14:40:53,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1092 states, 991 states have (on average 1.3915237134207872) internal successors, (1379), 1015 states have internal predecessors, (1379), 57 states have call successors, (57), 27 states have call predecessors, (57), 33 states have return successors, (77), 51 states have call predecessors, (77), 45 states have call successors, (77) [2025-03-04 14:40:53,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1092 states to 1092 states and 1513 transitions. [2025-03-04 14:40:53,424 INFO L78 Accepts]: Start accepts. Automaton has 1092 states and 1513 transitions. Word has length 103 [2025-03-04 14:40:53,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:53,424 INFO L471 AbstractCegarLoop]: Abstraction has 1092 states and 1513 transitions. [2025-03-04 14:40:53,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:40:53,424 INFO L276 IsEmpty]: Start isEmpty. Operand 1092 states and 1513 transitions. [2025-03-04 14:40:53,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 14:40:53,425 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:53,425 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:40:53,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 14:40:53,426 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [getoptErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, getoptErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-04 14:40:53,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:53,427 INFO L85 PathProgramCache]: Analyzing trace with hash 616241503, now seen corresponding path program 1 times [2025-03-04 14:40:53,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:40:53,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477386155] [2025-03-04 14:40:53,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:53,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:40:53,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 14:40:53,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 14:40:53,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:53,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:56,019 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-04 14:40:56,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:40:56,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477386155] [2025-03-04 14:40:56,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477386155] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:40:56,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:40:56,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 14:40:56,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319973999] [2025-03-04 14:40:56,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:40:56,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 14:40:56,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:40:56,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 14:40:56,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-04 14:40:56,020 INFO L87 Difference]: Start difference. First operand 1092 states and 1513 transitions. Second operand has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 14:41:00,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 14:41:04,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 14:41:08,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []