./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/uniq-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/busybox-1.22.0/uniq-1.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 08565b92f9e1ab6a47cc07eab48e4ddba14d2beb0d6a637f829640714554b58e --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 05:56:10,710 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 05:56:10,768 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-09 05:56:10,773 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 05:56:10,774 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 05:56:10,789 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 05:56:10,790 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 05:56:10,790 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 05:56:10,790 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 05:56:10,790 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 05:56:10,791 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 05:56:10,791 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 05:56:10,791 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 05:56:10,792 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 05:56:10,792 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 05:56:10,792 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 05:56:10,792 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 05:56:10,792 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 05:56:10,792 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 05:56:10,793 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 05:56:10,793 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 05:56:10,793 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 05:56:10,793 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 05:56:10,793 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 05:56:10,793 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 05:56:10,793 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 05:56:10,793 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 05:56:10,793 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 05:56:10,793 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 05:56:10,793 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 05:56:10,794 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 05:56:10,794 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 05:56:10,794 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 05:56:10,794 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 05:56:10,794 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 05:56:10,794 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 05:56:10,794 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 05:56:10,794 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 05:56:10,794 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 05:56:10,794 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 05:56:10,794 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 05:56:10,794 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 05:56:10,794 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 -> 08565b92f9e1ab6a47cc07eab48e4ddba14d2beb0d6a637f829640714554b58e [2025-03-09 05:56:11,024 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 05:56:11,030 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 05:56:11,032 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 05:56:11,033 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 05:56:11,033 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 05:56:11,034 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/uniq-1.i [2025-03-09 05:56:12,167 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89c4ba704/ec509441fe6b46c1a08cb16e39224ff3/FLAG132ebed17 [2025-03-09 05:56:12,488 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 05:56:12,489 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/uniq-1.i [2025-03-09 05:56:12,513 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89c4ba704/ec509441fe6b46c1a08cb16e39224ff3/FLAG132ebed17 [2025-03-09 05:56:12,726 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89c4ba704/ec509441fe6b46c1a08cb16e39224ff3 [2025-03-09 05:56:12,729 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 05:56:12,730 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 05:56:12,731 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 05:56:12,731 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 05:56:12,734 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 05:56:12,734 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 05:56:12" (1/1) ... [2025-03-09 05:56:12,735 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39718001 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:56:12, skipping insertion in model container [2025-03-09 05:56:12,735 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 05:56:12" (1/1) ... [2025-03-09 05:56:12,790 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 05:56:13,534 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 05:56:13,561 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 05:56:13,677 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 05:56:13,795 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-03-09 05:56:13,801 INFO L204 MainTranslator]: Completed translation [2025-03-09 05:56:13,801 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:56:13 WrapperNode [2025-03-09 05:56:13,801 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 05:56:13,802 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 05:56:13,802 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 05:56:13,802 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 05:56:13,807 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:56:13" (1/1) ... [2025-03-09 05:56:13,847 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:56:13" (1/1) ... [2025-03-09 05:56:13,909 INFO L138 Inliner]: procedures = 600, calls = 768, calls flagged for inlining = 31, calls inlined = 30, statements flattened = 2127 [2025-03-09 05:56:13,909 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 05:56:13,910 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 05:56:13,910 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 05:56:13,910 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 05:56:13,917 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:56:13" (1/1) ... [2025-03-09 05:56:13,918 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:56:13" (1/1) ... [2025-03-09 05:56:13,934 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:56:13" (1/1) ... [2025-03-09 05:56:14,021 INFO L175 MemorySlicer]: Split 633 memory accesses to 21 slices as follows [2, 7, 3, 17, 3, 3, 29, 11, 6, 13, 2, 17, 33, 17, 17, 355, 44, 15, 30, 6, 3]. 56 percent of accesses are in the largest equivalence class. The 368 initializations are split as follows [2, 0, 3, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 4, 355, 0, 0, 2, 0, 0]. The 108 writes are split as follows [0, 7, 0, 15, 0, 0, 0, 4, 3, 6, 1, 3, 13, 17, 4, 0, 12, 1, 20, 2, 0]. [2025-03-09 05:56:14,021 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:56:13" (1/1) ... [2025-03-09 05:56:14,021 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:56:13" (1/1) ... [2025-03-09 05:56:14,075 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:56:13" (1/1) ... [2025-03-09 05:56:14,079 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:56:13" (1/1) ... [2025-03-09 05:56:14,102 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:56:13" (1/1) ... [2025-03-09 05:56:14,113 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:56:13" (1/1) ... [2025-03-09 05:56:14,143 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 05:56:14,143 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 05:56:14,143 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 05:56:14,143 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 05:56:14,144 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:56:13" (1/1) ... [2025-03-09 05:56:14,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 05:56:14,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:56:14,167 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 05:56:14,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 05:56:14,184 INFO L130 BoogieDeclarations]: Found specification of procedure xopen [2025-03-09 05:56:14,184 INFO L138 BoogieDeclarations]: Found implementation of procedure xopen [2025-03-09 05:56:14,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#0 [2025-03-09 05:56:14,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#1 [2025-03-09 05:56:14,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#2 [2025-03-09 05:56:14,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#3 [2025-03-09 05:56:14,185 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#4 [2025-03-09 05:56:14,185 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#5 [2025-03-09 05:56:14,185 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#6 [2025-03-09 05:56:14,185 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#7 [2025-03-09 05:56:14,185 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#8 [2025-03-09 05:56:14,185 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#9 [2025-03-09 05:56:14,185 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#10 [2025-03-09 05:56:14,185 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#11 [2025-03-09 05:56:14,185 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#12 [2025-03-09 05:56:14,185 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#13 [2025-03-09 05:56:14,185 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#14 [2025-03-09 05:56:14,185 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#15 [2025-03-09 05:56:14,185 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#16 [2025-03-09 05:56:14,185 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#17 [2025-03-09 05:56:14,185 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#18 [2025-03-09 05:56:14,186 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#19 [2025-03-09 05:56:14,186 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#20 [2025-03-09 05:56:14,186 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#0 [2025-03-09 05:56:14,186 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#1 [2025-03-09 05:56:14,186 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#2 [2025-03-09 05:56:14,186 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#3 [2025-03-09 05:56:14,186 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#4 [2025-03-09 05:56:14,186 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#5 [2025-03-09 05:56:14,186 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#6 [2025-03-09 05:56:14,186 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#7 [2025-03-09 05:56:14,186 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#8 [2025-03-09 05:56:14,186 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#9 [2025-03-09 05:56:14,186 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#10 [2025-03-09 05:56:14,186 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#11 [2025-03-09 05:56:14,187 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#12 [2025-03-09 05:56:14,187 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#13 [2025-03-09 05:56:14,187 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#14 [2025-03-09 05:56:14,187 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#15 [2025-03-09 05:56:14,187 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#16 [2025-03-09 05:56:14,187 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#17 [2025-03-09 05:56:14,187 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#18 [2025-03-09 05:56:14,187 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#19 [2025-03-09 05:56:14,187 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#20 [2025-03-09 05:56:14,187 INFO L130 BoogieDeclarations]: Found specification of procedure xrealloc [2025-03-09 05:56:14,187 INFO L138 BoogieDeclarations]: Found implementation of procedure xrealloc [2025-03-09 05:56:14,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 05:56:14,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-03-09 05:56:14,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-03-09 05:56:14,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-03-09 05:56:14,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-03-09 05:56:14,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-03-09 05:56:14,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-03-09 05:56:14,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-03-09 05:56:14,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-03-09 05:56:14,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2025-03-09 05:56:14,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2025-03-09 05:56:14,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#10 [2025-03-09 05:56:14,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#11 [2025-03-09 05:56:14,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#12 [2025-03-09 05:56:14,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#13 [2025-03-09 05:56:14,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#14 [2025-03-09 05:56:14,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#15 [2025-03-09 05:56:14,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#16 [2025-03-09 05:56:14,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#17 [2025-03-09 05:56:14,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#18 [2025-03-09 05:56:14,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#19 [2025-03-09 05:56:14,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#20 [2025-03-09 05:56:14,189 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-03-09 05:56:14,189 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-03-09 05:56:14,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-09 05:56:14,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-09 05:56:14,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-09 05:56:14,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-09 05:56:14,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-09 05:56:14,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-09 05:56:14,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-09 05:56:14,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-09 05:56:14,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-09 05:56:14,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-03-09 05:56:14,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-03-09 05:56:14,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-03-09 05:56:14,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-03-09 05:56:14,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-03-09 05:56:14,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-03-09 05:56:14,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-03-09 05:56:14,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-03-09 05:56:14,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-03-09 05:56:14,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-03-09 05:56:14,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#19 [2025-03-09 05:56:14,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#20 [2025-03-09 05:56:14,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 05:56:14,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 05:56:14,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 05:56:14,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-09 05:56:14,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-09 05:56:14,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-09 05:56:14,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-09 05:56:14,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-09 05:56:14,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-09 05:56:14,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-09 05:56:14,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-09 05:56:14,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-09 05:56:14,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-09 05:56:14,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-09 05:56:14,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-09 05:56:14,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-09 05:56:14,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-09 05:56:14,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-03-09 05:56:14,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-03-09 05:56:14,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-03-09 05:56:14,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#20 [2025-03-09 05:56:14,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 05:56:14,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 05:56:14,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-09 05:56:14,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-09 05:56:14,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-09 05:56:14,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-09 05:56:14,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-09 05:56:14,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-09 05:56:14,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-09 05:56:14,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-09 05:56:14,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-09 05:56:14,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-09 05:56:14,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-09 05:56:14,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-09 05:56:14,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-09 05:56:14,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-09 05:56:14,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-09 05:56:14,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-03-09 05:56:14,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-03-09 05:56:14,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-03-09 05:56:14,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-03-09 05:56:14,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2025-03-09 05:56:14,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#20 [2025-03-09 05:56:14,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 05:56:14,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 05:56:14,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#0 [2025-03-09 05:56:14,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#1 [2025-03-09 05:56:14,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#2 [2025-03-09 05:56:14,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#3 [2025-03-09 05:56:14,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#4 [2025-03-09 05:56:14,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#5 [2025-03-09 05:56:14,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#6 [2025-03-09 05:56:14,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#7 [2025-03-09 05:56:14,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#8 [2025-03-09 05:56:14,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#9 [2025-03-09 05:56:14,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#10 [2025-03-09 05:56:14,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#11 [2025-03-09 05:56:14,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#12 [2025-03-09 05:56:14,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#13 [2025-03-09 05:56:14,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#14 [2025-03-09 05:56:14,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#15 [2025-03-09 05:56:14,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#16 [2025-03-09 05:56:14,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#17 [2025-03-09 05:56:14,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#18 [2025-03-09 05:56:14,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#19 [2025-03-09 05:56:14,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#20 [2025-03-09 05:56:14,193 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#0 [2025-03-09 05:56:14,193 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#1 [2025-03-09 05:56:14,193 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#2 [2025-03-09 05:56:14,193 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#3 [2025-03-09 05:56:14,193 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#4 [2025-03-09 05:56:14,193 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#5 [2025-03-09 05:56:14,193 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#6 [2025-03-09 05:56:14,193 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#7 [2025-03-09 05:56:14,193 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#8 [2025-03-09 05:56:14,193 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#9 [2025-03-09 05:56:14,193 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#10 [2025-03-09 05:56:14,193 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#11 [2025-03-09 05:56:14,193 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#12 [2025-03-09 05:56:14,193 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#13 [2025-03-09 05:56:14,193 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#14 [2025-03-09 05:56:14,193 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#15 [2025-03-09 05:56:14,193 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#16 [2025-03-09 05:56:14,193 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#17 [2025-03-09 05:56:14,193 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#18 [2025-03-09 05:56:14,193 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#19 [2025-03-09 05:56:14,193 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#20 [2025-03-09 05:56:14,194 INFO L130 BoogieDeclarations]: Found specification of procedure xmalloc [2025-03-09 05:56:14,194 INFO L138 BoogieDeclarations]: Found implementation of procedure xmalloc [2025-03-09 05:56:14,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-03-09 05:56:14,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-03-09 05:56:14,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-03-09 05:56:14,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-03-09 05:56:14,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-03-09 05:56:14,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-03-09 05:56:14,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-03-09 05:56:14,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-03-09 05:56:14,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2025-03-09 05:56:14,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2025-03-09 05:56:14,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#10 [2025-03-09 05:56:14,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#11 [2025-03-09 05:56:14,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#12 [2025-03-09 05:56:14,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#13 [2025-03-09 05:56:14,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#14 [2025-03-09 05:56:14,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#15 [2025-03-09 05:56:14,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#16 [2025-03-09 05:56:14,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#17 [2025-03-09 05:56:14,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#18 [2025-03-09 05:56:14,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#19 [2025-03-09 05:56:14,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#20 [2025-03-09 05:56:14,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-09 05:56:14,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-09 05:56:14,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-09 05:56:14,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-09 05:56:14,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-09 05:56:14,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-09 05:56:14,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-09 05:56:14,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-09 05:56:14,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-03-09 05:56:14,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-03-09 05:56:14,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-03-09 05:56:14,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-03-09 05:56:14,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-03-09 05:56:14,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-03-09 05:56:14,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-03-09 05:56:14,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-03-09 05:56:14,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-03-09 05:56:14,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#17 [2025-03-09 05:56:14,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#18 [2025-03-09 05:56:14,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#19 [2025-03-09 05:56:14,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#20 [2025-03-09 05:56:14,197 INFO L130 BoogieDeclarations]: Found specification of procedure bb_perror_msg_and_die [2025-03-09 05:56:14,197 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_perror_msg_and_die [2025-03-09 05:56:14,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-09 05:56:14,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-09 05:56:14,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-09 05:56:14,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2025-03-09 05:56:14,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2025-03-09 05:56:14,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#5 [2025-03-09 05:56:14,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#6 [2025-03-09 05:56:14,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#7 [2025-03-09 05:56:14,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#8 [2025-03-09 05:56:14,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#9 [2025-03-09 05:56:14,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#10 [2025-03-09 05:56:14,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#11 [2025-03-09 05:56:14,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#12 [2025-03-09 05:56:14,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#13 [2025-03-09 05:56:14,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#14 [2025-03-09 05:56:14,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#15 [2025-03-09 05:56:14,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#16 [2025-03-09 05:56:14,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#17 [2025-03-09 05:56:14,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#18 [2025-03-09 05:56:14,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#19 [2025-03-09 05:56:14,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#20 [2025-03-09 05:56:14,197 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-09 05:56:14,197 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-09 05:56:14,197 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-09 05:56:14,197 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2025-03-09 05:56:14,197 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2025-03-09 05:56:14,197 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#5 [2025-03-09 05:56:14,197 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#6 [2025-03-09 05:56:14,197 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#7 [2025-03-09 05:56:14,197 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#8 [2025-03-09 05:56:14,197 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#9 [2025-03-09 05:56:14,197 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#10 [2025-03-09 05:56:14,197 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#11 [2025-03-09 05:56:14,197 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#12 [2025-03-09 05:56:14,197 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#13 [2025-03-09 05:56:14,197 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#14 [2025-03-09 05:56:14,197 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#15 [2025-03-09 05:56:14,197 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#16 [2025-03-09 05:56:14,198 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#17 [2025-03-09 05:56:14,198 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#18 [2025-03-09 05:56:14,198 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#19 [2025-03-09 05:56:14,198 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#20 [2025-03-09 05:56:14,198 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-09 05:56:14,198 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-09 05:56:14,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 05:56:14,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-09 05:56:14,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-09 05:56:14,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-09 05:56:14,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-09 05:56:14,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-09 05:56:14,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-09 05:56:14,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-09 05:56:14,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-09 05:56:14,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-09 05:56:14,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-09 05:56:14,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-09 05:56:14,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-09 05:56:14,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-09 05:56:14,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-09 05:56:14,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-09 05:56:14,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-03-09 05:56:14,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-03-09 05:56:14,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-03-09 05:56:14,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-03-09 05:56:14,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2025-03-09 05:56:14,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#20 [2025-03-09 05:56:14,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-09 05:56:14,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-09 05:56:14,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-09 05:56:14,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-09 05:56:14,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-09 05:56:14,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-09 05:56:14,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-09 05:56:14,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-09 05:56:14,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-09 05:56:14,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-09 05:56:14,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-09 05:56:14,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-03-09 05:56:14,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-03-09 05:56:14,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-03-09 05:56:14,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-03-09 05:56:14,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-03-09 05:56:14,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-03-09 05:56:14,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-03-09 05:56:14,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2025-03-09 05:56:14,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2025-03-09 05:56:14,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#20 [2025-03-09 05:56:14,200 INFO L130 BoogieDeclarations]: Found specification of procedure bb_show_usage [2025-03-09 05:56:14,200 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_show_usage [2025-03-09 05:56:14,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 05:56:14,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 05:56:14,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 05:56:14,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-09 05:56:14,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-09 05:56:14,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-09 05:56:14,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-09 05:56:14,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-09 05:56:14,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-09 05:56:14,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-09 05:56:14,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-09 05:56:14,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-09 05:56:14,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-09 05:56:14,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-09 05:56:14,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-09 05:56:14,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-09 05:56:14,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-09 05:56:14,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-03-09 05:56:14,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-03-09 05:56:14,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-03-09 05:56:14,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#20 [2025-03-09 05:56:14,201 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg_and_die [2025-03-09 05:56:14,201 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg_and_die [2025-03-09 05:56:14,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 05:56:14,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 05:56:14,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 05:56:14,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-09 05:56:14,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-09 05:56:14,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-09 05:56:14,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-09 05:56:14,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-09 05:56:14,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-09 05:56:14,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-09 05:56:14,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-09 05:56:14,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-09 05:56:14,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-09 05:56:14,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-09 05:56:14,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-09 05:56:14,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-09 05:56:14,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-09 05:56:14,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-09 05:56:14,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-09 05:56:14,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-09 05:56:14,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#20 [2025-03-09 05:56:14,708 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 05:56:14,710 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 05:56:18,981 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2548: call ULTIMATE.dealloc(getopt32_~#complementary~0#1.base, getopt32_~#complementary~0#1.offset);havoc getopt32_~#complementary~0#1.base, getopt32_~#complementary~0#1.offset; [2025-03-09 05:56:18,981 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3147: call ULTIMATE.dealloc(xmalloc_fgetline_~#i~2#1.base, xmalloc_fgetline_~#i~2#1.offset);havoc xmalloc_fgetline_~#i~2#1.base, xmalloc_fgetline_~#i~2#1.offset; [2025-03-09 05:56:18,981 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2995: call ULTIMATE.dealloc(__main_~#skip_fields~0#1.base, __main_~#skip_fields~0#1.offset);havoc __main_~#skip_fields~0#1.base, __main_~#skip_fields~0#1.offset;call ULTIMATE.dealloc(__main_~#skip_chars~0#1.base, __main_~#skip_chars~0#1.offset);havoc __main_~#skip_chars~0#1.base, __main_~#skip_chars~0#1.offset;call ULTIMATE.dealloc(__main_~#max_chars~0#1.base, __main_~#max_chars~0#1.offset);havoc __main_~#max_chars~0#1.base, __main_~#max_chars~0#1.offset; [2025-03-09 05:56:18,981 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3264: havoc _IO_getc_#t~nondet261#1; [2025-03-09 05:56:18,981 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3338: havoc getopt_long_#t~ret297#1; [2025-03-09 05:56:19,227 INFO L? ?]: Removed 885 outVars from TransFormulas that were not future-live. [2025-03-09 05:56:19,227 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 05:56:19,271 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 05:56:19,272 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 05:56:19,272 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 05:56:19 BoogieIcfgContainer [2025-03-09 05:56:19,272 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 05:56:19,274 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 05:56:19,274 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 05:56:19,277 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 05:56:19,277 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 05:56:12" (1/3) ... [2025-03-09 05:56:19,278 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c7654f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 05:56:19, skipping insertion in model container [2025-03-09 05:56:19,278 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:56:13" (2/3) ... [2025-03-09 05:56:19,278 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c7654f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 05:56:19, skipping insertion in model container [2025-03-09 05:56:19,278 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 05:56:19" (3/3) ... [2025-03-09 05:56:19,279 INFO L128 eAbstractionObserver]: Analyzing ICFG uniq-1.i [2025-03-09 05:56:19,291 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 05:56:19,298 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uniq-1.i that has 72 procedures, 846 locations, 1 initial locations, 77 loop locations, and 78 error locations. [2025-03-09 05:56:19,353 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 05:56:19,363 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;@5c68bcce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 05:56:19,363 INFO L334 AbstractCegarLoop]: Starting to check reachability of 78 error locations. [2025-03-09 05:56:19,367 INFO L276 IsEmpty]: Start isEmpty. Operand has 622 states, 496 states have (on average 1.653225806451613) internal successors, (820), 581 states have internal predecessors, (820), 32 states have call successors, (32), 15 states have call predecessors, (32), 15 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-09 05:56:19,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-09 05:56:19,370 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:56:19,371 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-09 05:56:19,371 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-03-09 05:56:19,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:56:19,374 INFO L85 PathProgramCache]: Analyzing trace with hash 41711295, now seen corresponding path program 1 times [2025-03-09 05:56:19,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:56:19,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446667097] [2025-03-09 05:56:19,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:56:19,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:56:19,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 05:56:19,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 05:56:19,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:56:19,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:56:20,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 05:56:20,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:56:20,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446667097] [2025-03-09 05:56:20,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446667097] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:56:20,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:56:20,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:56:20,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826322168] [2025-03-09 05:56:20,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:56:20,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:56:20,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:56:20,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:56:20,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:56:20,117 INFO L87 Difference]: Start difference. First operand has 622 states, 496 states have (on average 1.653225806451613) internal successors, (820), 581 states have internal predecessors, (820), 32 states have call successors, (32), 15 states have call predecessors, (32), 15 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 05:56:20,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:56:20,289 INFO L93 Difference]: Finished difference Result 1118 states and 1638 transitions. [2025-03-09 05:56:20,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:56:20,291 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-09 05:56:20,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:56:20,300 INFO L225 Difference]: With dead ends: 1118 [2025-03-09 05:56:20,300 INFO L226 Difference]: Without dead ends: 497 [2025-03-09 05:56:20,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:56:20,309 INFO L435 NwaCegarLoop]: 665 mSDtfsCounter, 1 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1326 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:56:20,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1326 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:56:20,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2025-03-09 05:56:20,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 497. [2025-03-09 05:56:20,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 416 states have (on average 1.5504807692307692) internal successors, (645), 468 states have internal predecessors, (645), 27 states have call successors, (27), 13 states have call predecessors, (27), 10 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-09 05:56:20,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 689 transitions. [2025-03-09 05:56:20,379 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 689 transitions. Word has length 4 [2025-03-09 05:56:20,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:56:20,380 INFO L471 AbstractCegarLoop]: Abstraction has 497 states and 689 transitions. [2025-03-09 05:56:20,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 05:56:20,380 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 689 transitions. [2025-03-09 05:56:20,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-09 05:56:20,380 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:56:20,380 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-09 05:56:20,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 05:56:20,381 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-03-09 05:56:20,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:56:20,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1376920904, now seen corresponding path program 1 times [2025-03-09 05:56:20,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:56:20,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417305960] [2025-03-09 05:56:20,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:56:20,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:56:20,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 05:56:20,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 05:56:20,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:56:20,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:56:20,838 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 05:56:20,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:56:20,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417305960] [2025-03-09 05:56:20,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417305960] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:56:20,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454436439] [2025-03-09 05:56:20,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:56:20,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:56:20,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:56:20,841 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:56:20,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 05:56:21,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 05:56:21,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 05:56:21,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:56:21,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:56:21,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 1285 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:56:21,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:56:21,489 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 05:56:21,489 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:56:21,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454436439] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:56:21,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 05:56:21,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-09 05:56:21,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491545903] [2025-03-09 05:56:21,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:56:21,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 05:56:21,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:56:21,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 05:56:21,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:56:21,492 INFO L87 Difference]: Start difference. First operand 497 states and 689 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 05:56:21,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:56:21,583 INFO L93 Difference]: Finished difference Result 497 states and 689 transitions. [2025-03-09 05:56:21,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 05:56:21,585 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-09 05:56:21,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:56:21,587 INFO L225 Difference]: With dead ends: 497 [2025-03-09 05:56:21,587 INFO L226 Difference]: Without dead ends: 496 [2025-03-09 05:56:21,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:56:21,588 INFO L435 NwaCegarLoop]: 658 mSDtfsCounter, 1 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1315 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:56:21,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1315 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:56:21,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2025-03-09 05:56:21,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 496. [2025-03-09 05:56:21,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 416 states have (on average 1.5480769230769231) internal successors, (644), 467 states have internal predecessors, (644), 27 states have call successors, (27), 13 states have call predecessors, (27), 10 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-09 05:56:21,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 688 transitions. [2025-03-09 05:56:21,619 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 688 transitions. Word has length 7 [2025-03-09 05:56:21,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:56:21,619 INFO L471 AbstractCegarLoop]: Abstraction has 496 states and 688 transitions. [2025-03-09 05:56:21,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 05:56:21,620 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 688 transitions. [2025-03-09 05:56:21,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 05:56:21,620 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:56:21,620 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-03-09 05:56:21,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 05:56:21,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:56:21,822 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-03-09 05:56:21,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:56:21,823 INFO L85 PathProgramCache]: Analyzing trace with hash -265123647, now seen corresponding path program 1 times [2025-03-09 05:56:21,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:56:21,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930306725] [2025-03-09 05:56:21,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:56:21,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:56:21,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 05:56:22,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 05:56:22,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:56:22,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:56:22,143 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 05:56:22,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:56:22,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930306725] [2025-03-09 05:56:22,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930306725] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:56:22,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:56:22,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:56:22,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247638135] [2025-03-09 05:56:22,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:56:22,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:56:22,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:56:22,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:56:22,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:56:22,144 INFO L87 Difference]: Start difference. First operand 496 states and 688 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 05:56:22,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:56:22,208 INFO L93 Difference]: Finished difference Result 496 states and 688 transitions. [2025-03-09 05:56:22,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:56:22,208 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-09 05:56:22,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:56:22,214 INFO L225 Difference]: With dead ends: 496 [2025-03-09 05:56:22,214 INFO L226 Difference]: Without dead ends: 495 [2025-03-09 05:56:22,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:56:22,215 INFO L435 NwaCegarLoop]: 659 mSDtfsCounter, 0 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1316 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:56:22,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1316 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:56:22,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2025-03-09 05:56:22,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 493. [2025-03-09 05:56:22,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 414 states have (on average 1.5483091787439613) internal successors, (641), 464 states have internal predecessors, (641), 27 states have call successors, (27), 13 states have call predecessors, (27), 10 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-09 05:56:22,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 685 transitions. [2025-03-09 05:56:22,230 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 685 transitions. Word has length 8 [2025-03-09 05:56:22,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:56:22,230 INFO L471 AbstractCegarLoop]: Abstraction has 493 states and 685 transitions. [2025-03-09 05:56:22,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 05:56:22,230 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 685 transitions. [2025-03-09 05:56:22,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-09 05:56:22,230 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:56:22,230 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:56:22,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 05:56:22,231 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-03-09 05:56:22,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:56:22,231 INFO L85 PathProgramCache]: Analyzing trace with hash 859562124, now seen corresponding path program 1 times [2025-03-09 05:56:22,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:56:22,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837718952] [2025-03-09 05:56:22,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:56:22,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:56:22,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 05:56:22,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 05:56:22,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:56:22,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:56:22,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 05:56:22,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:56:22,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837718952] [2025-03-09 05:56:22,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837718952] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:56:22,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983137819] [2025-03-09 05:56:22,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:56:22,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:56:22,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:56:22,645 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:56:22,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 05:56:23,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 05:56:23,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 05:56:23,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:56:23,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:56:23,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 1302 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 05:56:23,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:56:23,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 05:56:23,270 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:56:23,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1983137819] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:56:23,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 05:56:23,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-09 05:56:23,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488235098] [2025-03-09 05:56:23,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:56:23,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:56:23,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:56:23,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:56:23,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:56:23,272 INFO L87 Difference]: Start difference. First operand 493 states and 685 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:56:23,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:56:23,378 INFO L93 Difference]: Finished difference Result 493 states and 685 transitions. [2025-03-09 05:56:23,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:56:23,378 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2025-03-09 05:56:23,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:56:23,381 INFO L225 Difference]: With dead ends: 493 [2025-03-09 05:56:23,381 INFO L226 Difference]: Without dead ends: 491 [2025-03-09 05:56:23,381 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:56:23,382 INFO L435 NwaCegarLoop]: 652 mSDtfsCounter, 568 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 582 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:56:23,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [582 Valid, 747 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:56:23,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2025-03-09 05:56:23,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 491. [2025-03-09 05:56:23,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 414 states have (on average 1.5434782608695652) internal successors, (639), 462 states have internal predecessors, (639), 27 states have call successors, (27), 13 states have call predecessors, (27), 10 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-09 05:56:23,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 683 transitions. [2025-03-09 05:56:23,398 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 683 transitions. Word has length 12 [2025-03-09 05:56:23,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:56:23,399 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 683 transitions. [2025-03-09 05:56:23,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:56:23,399 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 683 transitions. [2025-03-09 05:56:23,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-09 05:56:23,399 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:56:23,399 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:56:23,409 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 05:56:23,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-09 05:56:23,600 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-03-09 05:56:23,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:56:23,600 INFO L85 PathProgramCache]: Analyzing trace with hash 876623351, now seen corresponding path program 1 times [2025-03-09 05:56:23,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:56:23,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132922351] [2025-03-09 05:56:23,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:56:23,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:56:23,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 05:56:23,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 05:56:23,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:56:23,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:56:23,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 05:56:23,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:56:23,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132922351] [2025-03-09 05:56:23,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132922351] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:56:23,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448611393] [2025-03-09 05:56:23,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:56:23,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:56:23,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:56:23,946 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:56:23,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 05:56:24,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 05:56:24,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 05:56:24,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:56:24,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:56:24,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 1303 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:56:24,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:56:24,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 05:56:24,523 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:56:24,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 05:56:24,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448611393] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:56:24,549 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 05:56:24,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-09 05:56:24,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798644491] [2025-03-09 05:56:24,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 05:56:24,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 05:56:24,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:56:24,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 05:56:24,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:56:24,550 INFO L87 Difference]: Start difference. First operand 491 states and 683 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 05:56:24,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:56:24,655 INFO L93 Difference]: Finished difference Result 985 states and 1371 transitions. [2025-03-09 05:56:24,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 05:56:24,656 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 13 [2025-03-09 05:56:24,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:56:24,658 INFO L225 Difference]: With dead ends: 985 [2025-03-09 05:56:24,658 INFO L226 Difference]: Without dead ends: 500 [2025-03-09 05:56:24,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:56:24,659 INFO L435 NwaCegarLoop]: 657 mSDtfsCounter, 4 mSDsluCounter, 1965 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2622 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:56:24,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2622 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:56:24,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2025-03-09 05:56:24,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 500. [2025-03-09 05:56:24,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 423 states have (on average 1.5319148936170213) internal successors, (648), 471 states have internal predecessors, (648), 27 states have call successors, (27), 13 states have call predecessors, (27), 10 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-09 05:56:24,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 692 transitions. [2025-03-09 05:56:24,670 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 692 transitions. Word has length 13 [2025-03-09 05:56:24,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:56:24,670 INFO L471 AbstractCegarLoop]: Abstraction has 500 states and 692 transitions. [2025-03-09 05:56:24,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 05:56:24,670 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 692 transitions. [2025-03-09 05:56:24,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-09 05:56:24,671 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:56:24,671 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:56:24,680 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-09 05:56:24,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:56:24,871 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-03-09 05:56:24,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:56:24,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1556302062, now seen corresponding path program 2 times [2025-03-09 05:56:24,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:56:24,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826024379] [2025-03-09 05:56:24,872 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 05:56:24,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:56:25,013 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-09 05:56:25,045 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 22 statements. [2025-03-09 05:56:25,046 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 05:56:25,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:56:25,278 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-09 05:56:25,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:56:25,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826024379] [2025-03-09 05:56:25,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826024379] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:56:25,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:56:25,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 05:56:25,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451704655] [2025-03-09 05:56:25,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:56:25,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 05:56:25,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:56:25,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 05:56:25,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:56:25,280 INFO L87 Difference]: Start difference. First operand 500 states and 692 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:56:25,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:56:25,435 INFO L93 Difference]: Finished difference Result 500 states and 692 transitions. [2025-03-09 05:56:25,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 05:56:25,435 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2025-03-09 05:56:25,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:56:25,437 INFO L225 Difference]: With dead ends: 500 [2025-03-09 05:56:25,437 INFO L226 Difference]: Without dead ends: 498 [2025-03-09 05:56:25,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:56:25,438 INFO L435 NwaCegarLoop]: 647 mSDtfsCounter, 567 mSDsluCounter, 1376 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 581 SdHoareTripleChecker+Valid, 2023 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:56:25,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [581 Valid, 2023 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:56:25,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2025-03-09 05:56:25,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 498. [2025-03-09 05:56:25,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 423 states have (on average 1.5271867612293144) internal successors, (646), 469 states have internal predecessors, (646), 27 states have call successors, (27), 13 states have call predecessors, (27), 10 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-09 05:56:25,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 690 transitions. [2025-03-09 05:56:25,450 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 690 transitions. Word has length 22 [2025-03-09 05:56:25,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:56:25,450 INFO L471 AbstractCegarLoop]: Abstraction has 498 states and 690 transitions. [2025-03-09 05:56:25,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:56:25,450 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 690 transitions. [2025-03-09 05:56:25,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-09 05:56:25,451 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:56:25,451 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:56:25,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 05:56:25,451 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-03-09 05:56:25,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:56:25,451 INFO L85 PathProgramCache]: Analyzing trace with hash -519603344, now seen corresponding path program 1 times [2025-03-09 05:56:25,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:56:25,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927069432] [2025-03-09 05:56:25,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:56:25,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:56:25,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 05:56:25,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 05:56:25,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:56:25,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:56:25,756 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-09 05:56:25,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:56:25,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927069432] [2025-03-09 05:56:25,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927069432] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:56:25,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:56:25,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 05:56:25,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982111335] [2025-03-09 05:56:25,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:56:25,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:56:25,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:56:25,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:56:25,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:56:25,758 INFO L87 Difference]: Start difference. First operand 498 states and 690 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:56:25,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:56:25,841 INFO L93 Difference]: Finished difference Result 979 states and 1364 transitions. [2025-03-09 05:56:25,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:56:25,841 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2025-03-09 05:56:25,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:56:25,844 INFO L225 Difference]: With dead ends: 979 [2025-03-09 05:56:25,844 INFO L226 Difference]: Without dead ends: 501 [2025-03-09 05:56:25,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:56:25,845 INFO L435 NwaCegarLoop]: 655 mSDtfsCounter, 2 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1305 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:56:25,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1305 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:56:25,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2025-03-09 05:56:25,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 501. [2025-03-09 05:56:25,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 426 states have (on average 1.5234741784037558) internal successors, (649), 472 states have internal predecessors, (649), 27 states have call successors, (27), 13 states have call predecessors, (27), 10 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-09 05:56:25,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 693 transitions. [2025-03-09 05:56:25,860 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 693 transitions. Word has length 27 [2025-03-09 05:56:25,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:56:25,860 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 693 transitions. [2025-03-09 05:56:25,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:56:25,860 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 693 transitions. [2025-03-09 05:56:25,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-09 05:56:25,860 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:56:25,860 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:56:25,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 05:56:25,861 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-03-09 05:56:25,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:56:25,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1071832136, now seen corresponding path program 1 times [2025-03-09 05:56:25,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:56:25,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219910494] [2025-03-09 05:56:25,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:56:25,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:56:26,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-09 05:56:26,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 05:56:26,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:56:26,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:56:26,191 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-09 05:56:26,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:56:26,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219910494] [2025-03-09 05:56:26,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219910494] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:56:26,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:56:26,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:56:26,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286285725] [2025-03-09 05:56:26,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:56:26,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:56:26,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:56:26,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:56:26,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:56:26,193 INFO L87 Difference]: Start difference. First operand 501 states and 693 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:56:26,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:56:26,311 INFO L93 Difference]: Finished difference Result 799 states and 1132 transitions. [2025-03-09 05:56:26,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:56:26,312 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2025-03-09 05:56:26,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:56:26,315 INFO L225 Difference]: With dead ends: 799 [2025-03-09 05:56:26,315 INFO L226 Difference]: Without dead ends: 797 [2025-03-09 05:56:26,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:56:26,316 INFO L435 NwaCegarLoop]: 650 mSDtfsCounter, 411 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 1292 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:56:26,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 1292 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:56:26,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2025-03-09 05:56:26,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 505. [2025-03-09 05:56:26,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 430 states have (on average 1.5209302325581395) internal successors, (654), 476 states have internal predecessors, (654), 27 states have call successors, (27), 13 states have call predecessors, (27), 10 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-09 05:56:26,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 698 transitions. [2025-03-09 05:56:26,332 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 698 transitions. Word has length 28 [2025-03-09 05:56:26,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:56:26,333 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 698 transitions. [2025-03-09 05:56:26,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:56:26,333 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 698 transitions. [2025-03-09 05:56:26,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-09 05:56:26,334 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:56:26,334 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:56:26,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 05:56:26,334 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-03-09 05:56:26,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:56:26,334 INFO L85 PathProgramCache]: Analyzing trace with hash -435055705, now seen corresponding path program 1 times [2025-03-09 05:56:26,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:56:26,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352697703] [2025-03-09 05:56:26,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:56:26,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:56:26,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 05:56:26,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 05:56:26,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:56:26,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:56:26,623 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-09 05:56:26,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:56:26,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352697703] [2025-03-09 05:56:26,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352697703] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:56:26,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:56:26,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:56:26,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107197661] [2025-03-09 05:56:26,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:56:26,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:56:26,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:56:26,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:56:26,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:56:26,625 INFO L87 Difference]: Start difference. First operand 505 states and 698 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:56:26,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:56:26,730 INFO L93 Difference]: Finished difference Result 518 states and 713 transitions. [2025-03-09 05:56:26,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:56:26,731 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2025-03-09 05:56:26,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:56:26,735 INFO L225 Difference]: With dead ends: 518 [2025-03-09 05:56:26,735 INFO L226 Difference]: Without dead ends: 516 [2025-03-09 05:56:26,735 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:56:26,737 INFO L435 NwaCegarLoop]: 653 mSDtfsCounter, 3 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1302 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:56:26,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1302 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:56:26,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2025-03-09 05:56:26,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 514. [2025-03-09 05:56:26,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 439 states have (on average 1.5193621867881548) internal successors, (667), 485 states have internal predecessors, (667), 27 states have call successors, (27), 13 states have call predecessors, (27), 10 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-09 05:56:26,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 711 transitions. [2025-03-09 05:56:26,752 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 711 transitions. Word has length 30 [2025-03-09 05:56:26,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:56:26,753 INFO L471 AbstractCegarLoop]: Abstraction has 514 states and 711 transitions. [2025-03-09 05:56:26,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:56:26,754 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 711 transitions. [2025-03-09 05:56:26,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-09 05:56:26,756 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:56:26,756 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:56:26,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 05:56:26,756 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-03-09 05:56:26,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:56:26,756 INFO L85 PathProgramCache]: Analyzing trace with hash -435055545, now seen corresponding path program 1 times [2025-03-09 05:56:26,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:56:26,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048503004] [2025-03-09 05:56:26,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:56:26,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:56:26,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 05:56:26,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 05:56:26,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:56:26,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:56:27,056 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-09 05:56:27,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:56:27,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048503004] [2025-03-09 05:56:27,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048503004] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:56:27,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163370334] [2025-03-09 05:56:27,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:56:27,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:56:27,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:56:27,059 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:56:27,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 05:56:27,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 05:56:27,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 05:56:27,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:56:27,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:56:27,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 1492 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 05:56:27,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:56:27,797 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 05:56:27,798 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:56:27,894 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 05:56:27,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1163370334] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:56:27,894 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 05:56:27,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-03-09 05:56:27,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845033459] [2025-03-09 05:56:27,894 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 05:56:27,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 05:56:27,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:56:27,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 05:56:27,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-09 05:56:27,896 INFO L87 Difference]: Start difference. First operand 514 states and 711 transitions. Second operand has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 05:56:28,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:56:28,163 INFO L93 Difference]: Finished difference Result 1030 states and 1430 transitions. [2025-03-09 05:56:28,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 05:56:28,163 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2025-03-09 05:56:28,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:56:28,165 INFO L225 Difference]: With dead ends: 1030 [2025-03-09 05:56:28,166 INFO L226 Difference]: Without dead ends: 531 [2025-03-09 05:56:28,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-09 05:56:28,169 INFO L435 NwaCegarLoop]: 649 mSDtfsCounter, 5 mSDsluCounter, 4529 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 5178 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 05:56:28,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 5178 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 05:56:28,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2025-03-09 05:56:28,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 531. [2025-03-09 05:56:28,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 457 states have (on average 1.4945295404814005) internal successors, (683), 502 states have internal predecessors, (683), 27 states have call successors, (27), 13 states have call predecessors, (27), 10 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-09 05:56:28,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 727 transitions. [2025-03-09 05:56:28,183 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 727 transitions. Word has length 30 [2025-03-09 05:56:28,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:56:28,183 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 727 transitions. [2025-03-09 05:56:28,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 05:56:28,184 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 727 transitions. [2025-03-09 05:56:28,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-09 05:56:28,186 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:56:28,187 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:56:28,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-09 05:56:28,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:56:28,387 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-03-09 05:56:28,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:56:28,388 INFO L85 PathProgramCache]: Analyzing trace with hash 502769522, now seen corresponding path program 1 times [2025-03-09 05:56:28,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:56:28,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658258810] [2025-03-09 05:56:28,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:56:28,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:56:28,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-09 05:56:28,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-09 05:56:28,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:56:28,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:56:28,716 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-03-09 05:56:28,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:56:28,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658258810] [2025-03-09 05:56:28,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658258810] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:56:28,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:56:28,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:56:28,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587421790] [2025-03-09 05:56:28,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:56:28,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:56:28,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:56:28,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:56:28,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:56:28,719 INFO L87 Difference]: Start difference. First operand 531 states and 727 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:56:28,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:56:28,783 INFO L93 Difference]: Finished difference Result 531 states and 727 transitions. [2025-03-09 05:56:28,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:56:28,784 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2025-03-09 05:56:28,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:56:28,787 INFO L225 Difference]: With dead ends: 531 [2025-03-09 05:56:28,787 INFO L226 Difference]: Without dead ends: 530 [2025-03-09 05:56:28,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:56:28,788 INFO L435 NwaCegarLoop]: 653 mSDtfsCounter, 0 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1303 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:56:28,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1303 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:56:28,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2025-03-09 05:56:28,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 526. [2025-03-09 05:56:28,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 453 states have (on average 1.4944812362030906) internal successors, (677), 497 states have internal predecessors, (677), 27 states have call successors, (27), 13 states have call predecessors, (27), 10 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-09 05:56:28,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 721 transitions. [2025-03-09 05:56:28,803 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 721 transitions. Word has length 49 [2025-03-09 05:56:28,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:56:28,803 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 721 transitions. [2025-03-09 05:56:28,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:56:28,804 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 721 transitions. [2025-03-09 05:56:28,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-09 05:56:28,804 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:56:28,804 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:56:28,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 05:56:28,805 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-03-09 05:56:28,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:56:28,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1705377748, now seen corresponding path program 1 times [2025-03-09 05:56:28,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:56:28,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793685889] [2025-03-09 05:56:28,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:56:28,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:56:28,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-09 05:56:28,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-09 05:56:28,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:56:28,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:56:29,130 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 05:56:29,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:56:29,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793685889] [2025-03-09 05:56:29,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793685889] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:56:29,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018358650] [2025-03-09 05:56:29,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:56:29,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:56:29,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:56:29,133 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:56:29,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 05:56:29,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-09 05:56:29,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-09 05:56:29,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:56:29,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:56:29,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 1696 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:56:29,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:56:29,852 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 05:56:29,852 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:56:29,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018358650] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:56:29,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 05:56:29,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-09 05:56:29,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652004581] [2025-03-09 05:56:29,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:56:29,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 05:56:29,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:56:29,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 05:56:29,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:56:29,853 INFO L87 Difference]: Start difference. First operand 526 states and 721 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:56:30,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:56:30,004 INFO L93 Difference]: Finished difference Result 822 states and 1159 transitions. [2025-03-09 05:56:30,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 05:56:30,005 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2025-03-09 05:56:30,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:56:30,008 INFO L225 Difference]: With dead ends: 822 [2025-03-09 05:56:30,008 INFO L226 Difference]: Without dead ends: 821 [2025-03-09 05:56:30,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:56:30,009 INFO L435 NwaCegarLoop]: 1055 mSDtfsCounter, 821 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 837 SdHoareTripleChecker+Valid, 1956 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:56:30,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [837 Valid, 1956 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:56:30,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2025-03-09 05:56:30,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 525. [2025-03-09 05:56:30,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 453 states have (on average 1.4922737306843268) internal successors, (676), 496 states have internal predecessors, (676), 27 states have call successors, (27), 13 states have call predecessors, (27), 10 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-09 05:56:30,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 720 transitions. [2025-03-09 05:56:30,024 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 720 transitions. Word has length 50 [2025-03-09 05:56:30,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:56:30,025 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 720 transitions. [2025-03-09 05:56:30,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:56:30,025 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 720 transitions. [2025-03-09 05:56:30,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-09 05:56:30,025 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:56:30,025 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:56:30,042 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-09 05:56:30,226 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,SelfDestructingSolverStorable11 [2025-03-09 05:56:30,226 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-03-09 05:56:30,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:56:30,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1327101377, now seen corresponding path program 1 times [2025-03-09 05:56:30,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:56:30,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268185219] [2025-03-09 05:56:30,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:56:30,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:56:30,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-09 05:56:30,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-09 05:56:30,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:56:30,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:56:30,533 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 05:56:30,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:56:30,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268185219] [2025-03-09 05:56:30,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268185219] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:56:30,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677715815] [2025-03-09 05:56:30,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:56:30,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:56:30,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:56:30,535 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:56:30,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 05:56:31,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-09 05:56:31,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-09 05:56:31,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:56:31,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:56:31,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 1697 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:56:31,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:56:31,272 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 05:56:31,273 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:56:31,305 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 05:56:31,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1677715815] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:56:31,306 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 05:56:31,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-09 05:56:31,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243334528] [2025-03-09 05:56:31,307 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 05:56:31,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 05:56:31,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:56:31,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 05:56:31,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:56:31,308 INFO L87 Difference]: Start difference. First operand 525 states and 720 transitions. Second operand has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:56:31,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:56:31,605 INFO L93 Difference]: Finished difference Result 1706 states and 2466 transitions. [2025-03-09 05:56:31,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 05:56:31,605 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2025-03-09 05:56:31,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:56:31,613 INFO L225 Difference]: With dead ends: 1706 [2025-03-09 05:56:31,613 INFO L226 Difference]: Without dead ends: 1705 [2025-03-09 05:56:31,613 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:56:31,614 INFO L435 NwaCegarLoop]: 647 mSDtfsCounter, 2869 mSDsluCounter, 2077 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2901 SdHoareTripleChecker+Valid, 2724 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 05:56:31,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2901 Valid, 2724 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 05:56:31,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1705 states. [2025-03-09 05:56:31,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1705 to 537. [2025-03-09 05:56:31,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 465 states have (on average 1.4860215053763441) internal successors, (691), 508 states have internal predecessors, (691), 27 states have call successors, (27), 13 states have call predecessors, (27), 10 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-09 05:56:31,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 735 transitions. [2025-03-09 05:56:31,634 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 735 transitions. Word has length 51 [2025-03-09 05:56:31,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:56:31,635 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 735 transitions. [2025-03-09 05:56:31,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:56:31,635 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 735 transitions. [2025-03-09 05:56:31,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-09 05:56:31,635 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:56:31,635 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:56:31,646 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-09 05:56:31,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:56:31,836 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-03-09 05:56:31,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:56:31,839 INFO L85 PathProgramCache]: Analyzing trace with hash 538778984, now seen corresponding path program 1 times [2025-03-09 05:56:31,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:56:31,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785633461] [2025-03-09 05:56:31,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:56:31,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:56:31,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-09 05:56:31,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-09 05:56:31,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:56:31,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:56:32,132 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-09 05:56:32,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:56:32,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785633461] [2025-03-09 05:56:32,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785633461] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:56:32,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176056614] [2025-03-09 05:56:32,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:56:32,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:56:32,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:56:32,135 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:56:32,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 05:56:32,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-09 05:56:32,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-09 05:56:32,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:56:32,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:56:32,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 1665 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:56:32,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:56:32,919 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-09 05:56:32,919 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:56:32,941 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-09 05:56:32,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [176056614] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:56:32,941 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 05:56:32,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-09 05:56:32,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366663929] [2025-03-09 05:56:32,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 05:56:32,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 05:56:32,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:56:32,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 05:56:32,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:56:32,942 INFO L87 Difference]: Start difference. First operand 537 states and 735 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:56:33,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:56:33,073 INFO L93 Difference]: Finished difference Result 1049 states and 1447 transitions. [2025-03-09 05:56:33,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 05:56:33,074 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2025-03-09 05:56:33,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:56:33,076 INFO L225 Difference]: With dead ends: 1049 [2025-03-09 05:56:33,076 INFO L226 Difference]: Without dead ends: 555 [2025-03-09 05:56:33,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:56:33,078 INFO L435 NwaCegarLoop]: 652 mSDtfsCounter, 4 mSDsluCounter, 2596 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3248 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:56:33,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3248 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:56:33,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2025-03-09 05:56:33,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2025-03-09 05:56:33,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 483 states have (on average 1.4679089026915113) internal successors, (709), 526 states have internal predecessors, (709), 27 states have call successors, (27), 13 states have call predecessors, (27), 10 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-09 05:56:33,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 753 transitions. [2025-03-09 05:56:33,091 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 753 transitions. Word has length 55 [2025-03-09 05:56:33,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:56:33,091 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 753 transitions. [2025-03-09 05:56:33,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:56:33,091 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 753 transitions. [2025-03-09 05:56:33,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-09 05:56:33,091 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:56:33,091 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:56:33,102 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-09 05:56:33,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:56:33,292 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-03-09 05:56:33,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:56:33,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1081569096, now seen corresponding path program 1 times [2025-03-09 05:56:33,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:56:33,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125216129] [2025-03-09 05:56:33,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:56:33,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:56:33,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-09 05:56:33,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-09 05:56:33,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:56:33,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:56:33,583 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 05:56:33,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:56:33,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125216129] [2025-03-09 05:56:33,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125216129] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:56:33,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:56:33,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:56:33,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755746766] [2025-03-09 05:56:33,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:56:33,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:56:33,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:56:33,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:56:33,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:56:33,585 INFO L87 Difference]: Start difference. First operand 555 states and 753 transitions. Second operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 05:56:33,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:56:33,768 INFO L93 Difference]: Finished difference Result 1101 states and 1528 transitions. [2025-03-09 05:56:33,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:56:33,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 60 [2025-03-09 05:56:33,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:56:33,771 INFO L225 Difference]: With dead ends: 1101 [2025-03-09 05:56:33,771 INFO L226 Difference]: Without dead ends: 650 [2025-03-09 05:56:33,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:56:33,773 INFO L435 NwaCegarLoop]: 645 mSDtfsCounter, 119 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 1228 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 05:56:33,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 1228 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 05:56:33,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2025-03-09 05:56:33,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 597. [2025-03-09 05:56:33,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 524 states have (on average 1.4599236641221374) internal successors, (765), 567 states have internal predecessors, (765), 28 states have call successors, (28), 13 states have call predecessors, (28), 10 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-09 05:56:33,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 811 transitions. [2025-03-09 05:56:33,789 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 811 transitions. Word has length 60 [2025-03-09 05:56:33,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:56:33,789 INFO L471 AbstractCegarLoop]: Abstraction has 597 states and 811 transitions. [2025-03-09 05:56:33,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 05:56:33,789 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 811 transitions. [2025-03-09 05:56:33,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-09 05:56:33,789 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:56:33,790 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:56:33,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 05:56:33,790 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-03-09 05:56:33,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:56:33,790 INFO L85 PathProgramCache]: Analyzing trace with hash -5776106, now seen corresponding path program 1 times [2025-03-09 05:56:33,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:56:33,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913325254] [2025-03-09 05:56:33,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:56:33,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:56:33,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-09 05:56:33,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-09 05:56:33,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:56:33,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:56:34,049 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 05:56:34,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:56:34,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913325254] [2025-03-09 05:56:34,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913325254] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:56:34,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:56:34,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:56:34,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226176514] [2025-03-09 05:56:34,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:56:34,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:56:34,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:56:34,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:56:34,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:56:34,050 INFO L87 Difference]: Start difference. First operand 597 states and 811 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 05:56:34,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:56:34,120 INFO L93 Difference]: Finished difference Result 599 states and 811 transitions. [2025-03-09 05:56:34,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:56:34,121 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 62 [2025-03-09 05:56:34,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:56:34,123 INFO L225 Difference]: With dead ends: 599 [2025-03-09 05:56:34,123 INFO L226 Difference]: Without dead ends: 597 [2025-03-09 05:56:34,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:56:34,124 INFO L435 NwaCegarLoop]: 653 mSDtfsCounter, 1 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1301 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:56:34,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1301 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:56:34,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2025-03-09 05:56:34,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 597. [2025-03-09 05:56:34,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 524 states have (on average 1.4561068702290076) internal successors, (763), 567 states have internal predecessors, (763), 28 states have call successors, (28), 13 states have call predecessors, (28), 10 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-09 05:56:34,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 809 transitions. [2025-03-09 05:56:34,140 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 809 transitions. Word has length 62 [2025-03-09 05:56:34,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:56:34,140 INFO L471 AbstractCegarLoop]: Abstraction has 597 states and 809 transitions. [2025-03-09 05:56:34,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 05:56:34,141 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 809 transitions. [2025-03-09 05:56:34,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-09 05:56:34,141 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:56:34,141 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:56:34,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-09 05:56:34,141 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-03-09 05:56:34,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:56:34,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1725017715, now seen corresponding path program 2 times [2025-03-09 05:56:34,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:56:34,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303356938] [2025-03-09 05:56:34,142 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 05:56:34,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:56:34,313 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 63 statements into 2 equivalence classes. [2025-03-09 05:56:34,393 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 63 statements. [2025-03-09 05:56:34,394 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 05:56:34,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:56:34,589 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2025-03-09 05:56:34,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:56:34,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303356938] [2025-03-09 05:56:34,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303356938] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:56:34,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:56:34,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 05:56:34,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038913077] [2025-03-09 05:56:34,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:56:34,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 05:56:34,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:56:34,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 05:56:34,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 05:56:34,590 INFO L87 Difference]: Start difference. First operand 597 states and 809 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:56:34,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:56:34,768 INFO L93 Difference]: Finished difference Result 1122 states and 1540 transitions. [2025-03-09 05:56:34,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 05:56:34,768 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2025-03-09 05:56:34,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:56:34,771 INFO L225 Difference]: With dead ends: 1122 [2025-03-09 05:56:34,771 INFO L226 Difference]: Without dead ends: 597 [2025-03-09 05:56:34,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 05:56:34,772 INFO L435 NwaCegarLoop]: 641 mSDtfsCounter, 574 mSDsluCounter, 1896 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 588 SdHoareTripleChecker+Valid, 2537 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 05:56:34,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [588 Valid, 2537 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 05:56:34,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2025-03-09 05:56:34,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 597. [2025-03-09 05:56:34,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 524 states have (on average 1.4541984732824427) internal successors, (762), 567 states have internal predecessors, (762), 28 states have call successors, (28), 13 states have call predecessors, (28), 10 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-09 05:56:34,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 808 transitions. [2025-03-09 05:56:34,788 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 808 transitions. Word has length 63 [2025-03-09 05:56:34,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:56:34,788 INFO L471 AbstractCegarLoop]: Abstraction has 597 states and 808 transitions. [2025-03-09 05:56:34,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:56:34,789 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 808 transitions. [2025-03-09 05:56:34,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-09 05:56:34,789 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:56:34,789 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:56:34,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-09 05:56:34,789 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-03-09 05:56:34,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:56:34,790 INFO L85 PathProgramCache]: Analyzing trace with hash 657087192, now seen corresponding path program 2 times [2025-03-09 05:56:34,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:56:34,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780234461] [2025-03-09 05:56:34,790 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 05:56:34,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:56:34,943 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-03-09 05:56:35,038 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 73 of 73 statements. [2025-03-09 05:56:35,038 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 05:56:35,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:56:35,217 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2025-03-09 05:56:35,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:56:35,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780234461] [2025-03-09 05:56:35,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780234461] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:56:35,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973526930] [2025-03-09 05:56:35,218 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 05:56:35,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:56:35,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:56:35,220 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:56:35,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 05:56:35,818 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-03-09 05:57:14,088 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 73 of 73 statements. [2025-03-09 05:57:14,089 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 05:57:14,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:14,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 1803 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 05:57:14,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:57:14,168 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 58 proven. 22 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-03-09 05:57:14,172 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:57:14,252 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 58 proven. 22 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-03-09 05:57:14,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [973526930] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:57:14,252 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 05:57:14,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-03-09 05:57:14,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123259155] [2025-03-09 05:57:14,252 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 05:57:14,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 05:57:14,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:57:14,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 05:57:14,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-09 05:57:14,253 INFO L87 Difference]: Start difference. First operand 597 states and 808 transitions. Second operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:57:14,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:57:14,728 INFO L93 Difference]: Finished difference Result 1177 states and 1609 transitions. [2025-03-09 05:57:14,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-09 05:57:14,728 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2025-03-09 05:57:14,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:57:14,731 INFO L225 Difference]: With dead ends: 1177 [2025-03-09 05:57:14,731 INFO L226 Difference]: Without dead ends: 632 [2025-03-09 05:57:14,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=330, Invalid=792, Unknown=0, NotChecked=0, Total=1122 [2025-03-09 05:57:14,733 INFO L435 NwaCegarLoop]: 647 mSDtfsCounter, 9 mSDsluCounter, 4508 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 5155 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 05:57:14,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 5155 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 05:57:14,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2025-03-09 05:57:14,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 632. [2025-03-09 05:57:14,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 560 states have (on average 1.4232142857142858) internal successors, (797), 602 states have internal predecessors, (797), 28 states have call successors, (28), 13 states have call predecessors, (28), 10 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-09 05:57:14,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 843 transitions. [2025-03-09 05:57:14,748 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 843 transitions. Word has length 73 [2025-03-09 05:57:14,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:57:14,749 INFO L471 AbstractCegarLoop]: Abstraction has 632 states and 843 transitions. [2025-03-09 05:57:14,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:57:14,749 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 843 transitions. [2025-03-09 05:57:14,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-09 05:57:14,750 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:57:14,750 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:57:14,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-09 05:57:14,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-09 05:57:14,952 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-03-09 05:57:14,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:57:14,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1758612123, now seen corresponding path program 1 times [2025-03-09 05:57:14,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:57:14,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288951018] [2025-03-09 05:57:14,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:57:14,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:57:15,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-09 05:57:15,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-09 05:57:15,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:57:15,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:15,463 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-09 05:57:15,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:57:15,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288951018] [2025-03-09 05:57:15,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288951018] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:57:15,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929612764] [2025-03-09 05:57:15,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:57:15,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:57:15,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:57:15,466 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:57:15,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-09 05:57:16,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-09 05:57:16,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-09 05:57:16,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:57:16,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:16,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 2008 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 05:57:16,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:57:16,576 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-09 05:57:16,576 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:57:16,657 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-09 05:57:16,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1929612764] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:57:16,657 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 05:57:16,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-09 05:57:16,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995334890] [2025-03-09 05:57:16,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 05:57:16,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 05:57:16,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:57:16,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 05:57:16,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-09 05:57:16,659 INFO L87 Difference]: Start difference. First operand 632 states and 843 transitions. Second operand has 13 states, 12 states have (on average 5.583333333333333) internal successors, (67), 13 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:57:17,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:57:17,337 INFO L93 Difference]: Finished difference Result 3997 states and 5759 transitions. [2025-03-09 05:57:17,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 05:57:17,338 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.583333333333333) internal successors, (67), 13 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 97 [2025-03-09 05:57:17,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:57:17,350 INFO L225 Difference]: With dead ends: 3997 [2025-03-09 05:57:17,350 INFO L226 Difference]: Without dead ends: 3996 [2025-03-09 05:57:17,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-09 05:57:17,352 INFO L435 NwaCegarLoop]: 646 mSDtfsCounter, 6999 mSDsluCounter, 5833 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7079 SdHoareTripleChecker+Valid, 6479 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 05:57:17,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7079 Valid, 6479 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 05:57:17,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3996 states. [2025-03-09 05:57:17,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3996 to 656. [2025-03-09 05:57:17,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 584 states have (on average 1.4160958904109588) internal successors, (827), 626 states have internal predecessors, (827), 28 states have call successors, (28), 13 states have call predecessors, (28), 10 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-09 05:57:17,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 873 transitions. [2025-03-09 05:57:17,393 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 873 transitions. Word has length 97 [2025-03-09 05:57:17,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:57:17,393 INFO L471 AbstractCegarLoop]: Abstraction has 656 states and 873 transitions. [2025-03-09 05:57:17,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.583333333333333) internal successors, (67), 13 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:57:17,394 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 873 transitions. [2025-03-09 05:57:17,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-09 05:57:17,394 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:57:17,394 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:57:17,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-09 05:57:17,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:57:17,595 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-03-09 05:57:17,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:57:17,595 INFO L85 PathProgramCache]: Analyzing trace with hash -540964854, now seen corresponding path program 1 times [2025-03-09 05:57:17,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:57:17,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805751178] [2025-03-09 05:57:17,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:57:17,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:57:17,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-09 05:57:17,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-09 05:57:17,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:57:17,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:18,009 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-09 05:57:18,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:57:18,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805751178] [2025-03-09 05:57:18,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805751178] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:57:18,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:57:18,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:57:18,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890771619] [2025-03-09 05:57:18,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:57:18,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:57:18,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:57:18,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:57:18,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:57:18,011 INFO L87 Difference]: Start difference. First operand 656 states and 873 transitions. Second operand has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 05:57:18,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:57:18,187 INFO L93 Difference]: Finished difference Result 709 states and 952 transitions. [2025-03-09 05:57:18,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:57:18,187 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 102 [2025-03-09 05:57:18,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:57:18,190 INFO L225 Difference]: With dead ends: 709 [2025-03-09 05:57:18,190 INFO L226 Difference]: Without dead ends: 704 [2025-03-09 05:57:18,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:57:18,192 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 188 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 1097 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 05:57:18,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 1097 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 05:57:18,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2025-03-09 05:57:18,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 651. [2025-03-09 05:57:18,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 584 states have (on average 1.4075342465753424) internal successors, (822), 621 states have internal predecessors, (822), 28 states have call successors, (28), 13 states have call predecessors, (28), 10 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-09 05:57:18,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 868 transitions. [2025-03-09 05:57:18,213 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 868 transitions. Word has length 102 [2025-03-09 05:57:18,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:57:18,213 INFO L471 AbstractCegarLoop]: Abstraction has 651 states and 868 transitions. [2025-03-09 05:57:18,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 05:57:18,213 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 868 transitions. [2025-03-09 05:57:18,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-09 05:57:18,214 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:57:18,214 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:57:18,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-09 05:57:18,214 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-03-09 05:57:18,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:57:18,215 INFO L85 PathProgramCache]: Analyzing trace with hash 409959746, now seen corresponding path program 1 times [2025-03-09 05:57:18,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:57:18,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669749163] [2025-03-09 05:57:18,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:57:18,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:57:18,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-09 05:57:18,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-09 05:57:18,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:57:18,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:18,630 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-09 05:57:18,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:57:18,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669749163] [2025-03-09 05:57:18,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669749163] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:57:18,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:57:18,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:57:18,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944051981] [2025-03-09 05:57:18,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:57:18,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:57:18,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:57:18,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:57:18,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:57:18,632 INFO L87 Difference]: Start difference. First operand 651 states and 868 transitions. Second operand has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 05:57:18,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:57:18,798 INFO L93 Difference]: Finished difference Result 704 states and 947 transitions. [2025-03-09 05:57:18,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:57:18,799 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 103 [2025-03-09 05:57:18,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:57:18,801 INFO L225 Difference]: With dead ends: 704 [2025-03-09 05:57:18,801 INFO L226 Difference]: Without dead ends: 699 [2025-03-09 05:57:18,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:57:18,802 INFO L435 NwaCegarLoop]: 600 mSDtfsCounter, 186 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 1129 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:57:18,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 1129 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:57:18,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2025-03-09 05:57:18,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 634. [2025-03-09 05:57:18,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 572 states have (on average 1.3986013986013985) internal successors, (800), 604 states have internal predecessors, (800), 28 states have call successors, (28), 13 states have call predecessors, (28), 10 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-09 05:57:18,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 846 transitions. [2025-03-09 05:57:18,830 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 846 transitions. Word has length 103 [2025-03-09 05:57:18,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:57:18,830 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 846 transitions. [2025-03-09 05:57:18,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 05:57:18,830 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 846 transitions. [2025-03-09 05:57:18,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-09 05:57:18,831 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:57:18,831 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:57:18,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-09 05:57:18,831 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-03-09 05:57:18,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:57:18,832 INFO L85 PathProgramCache]: Analyzing trace with hash -324368720, now seen corresponding path program 1 times [2025-03-09 05:57:18,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:57:18,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535207067] [2025-03-09 05:57:18,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:57:18,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:57:19,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-09 05:57:19,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-09 05:57:19,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:57:19,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:19,339 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-09 05:57:19,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:57:19,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535207067] [2025-03-09 05:57:19,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535207067] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:57:19,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977802887] [2025-03-09 05:57:19,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:57:19,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:57:19,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:57:19,342 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:57:19,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-09 05:57:20,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-09 05:57:20,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-09 05:57:20,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:57:20,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:20,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 2093 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 05:57:20,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:57:20,334 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-09 05:57:20,334 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:57:20,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977802887] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:57:20,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 05:57:20,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-03-09 05:57:20,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328923606] [2025-03-09 05:57:20,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:57:20,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 05:57:20,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:57:20,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 05:57:20,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-09 05:57:20,336 INFO L87 Difference]: Start difference. First operand 634 states and 846 transitions. Second operand has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 05:57:20,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:57:20,531 INFO L93 Difference]: Finished difference Result 1195 states and 1649 transitions. [2025-03-09 05:57:20,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 05:57:20,531 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 105 [2025-03-09 05:57:20,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:57:20,534 INFO L225 Difference]: With dead ends: 1195 [2025-03-09 05:57:20,534 INFO L226 Difference]: Without dead ends: 752 [2025-03-09 05:57:20,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-09 05:57:20,537 INFO L435 NwaCegarLoop]: 693 mSDtfsCounter, 310 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 1897 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 05:57:20,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 1897 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 05:57:20,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2025-03-09 05:57:20,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 635. [2025-03-09 05:57:20,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 575 states have (on average 1.3930434782608696) internal successors, (801), 605 states have internal predecessors, (801), 28 states have call successors, (28), 13 states have call predecessors, (28), 10 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-09 05:57:20,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 847 transitions. [2025-03-09 05:57:20,559 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 847 transitions. Word has length 105 [2025-03-09 05:57:20,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:57:20,559 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 847 transitions. [2025-03-09 05:57:20,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 05:57:20,559 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 847 transitions. [2025-03-09 05:57:20,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-09 05:57:20,561 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:57:20,561 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:57:20,574 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-09 05:57:20,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-09 05:57:20,762 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-03-09 05:57:20,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:57:20,762 INFO L85 PathProgramCache]: Analyzing trace with hash 409111994, now seen corresponding path program 1 times [2025-03-09 05:57:20,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:57:20,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102772223] [2025-03-09 05:57:20,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:57:20,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:57:20,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-09 05:57:20,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-09 05:57:20,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:57:20,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:21,064 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2025-03-09 05:57:21,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:57:21,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102772223] [2025-03-09 05:57:21,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102772223] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:57:21,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:57:21,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:57:21,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087324342] [2025-03-09 05:57:21,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:57:21,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:57:21,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:57:21,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:57:21,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:57:21,066 INFO L87 Difference]: Start difference. First operand 635 states and 847 transitions. Second operand has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 05:57:21,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:57:21,153 INFO L93 Difference]: Finished difference Result 635 states and 847 transitions. [2025-03-09 05:57:21,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:57:21,153 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 108 [2025-03-09 05:57:21,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:57:21,156 INFO L225 Difference]: With dead ends: 635 [2025-03-09 05:57:21,156 INFO L226 Difference]: Without dead ends: 634 [2025-03-09 05:57:21,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:57:21,156 INFO L435 NwaCegarLoop]: 640 mSDtfsCounter, 1 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1275 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:57:21,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1275 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:57:21,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2025-03-09 05:57:21,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 634. [2025-03-09 05:57:21,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 575 states have (on average 1.391304347826087) internal successors, (800), 604 states have internal predecessors, (800), 28 states have call successors, (28), 13 states have call predecessors, (28), 10 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-09 05:57:21,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 846 transitions. [2025-03-09 05:57:21,176 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 846 transitions. Word has length 108 [2025-03-09 05:57:21,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:57:21,176 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 846 transitions. [2025-03-09 05:57:21,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 05:57:21,176 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 846 transitions. [2025-03-09 05:57:21,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-09 05:57:21,177 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:57:21,177 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:57:21,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-09 05:57:21,178 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-03-09 05:57:21,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:57:21,178 INFO L85 PathProgramCache]: Analyzing trace with hash -202428843, now seen corresponding path program 1 times [2025-03-09 05:57:21,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:57:21,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307371685] [2025-03-09 05:57:21,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:57:21,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:57:21,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-09 05:57:21,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-09 05:57:21,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:57:21,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:21,578 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2025-03-09 05:57:21,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:57:21,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307371685] [2025-03-09 05:57:21,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307371685] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:57:21,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:57:21,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 05:57:21,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79597281] [2025-03-09 05:57:21,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:57:21,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:57:21,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:57:21,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:57:21,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:57:21,579 INFO L87 Difference]: Start difference. First operand 634 states and 846 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 05:57:21,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:57:21,659 INFO L93 Difference]: Finished difference Result 1106 states and 1511 transitions. [2025-03-09 05:57:21,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:57:21,660 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 109 [2025-03-09 05:57:21,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:57:21,662 INFO L225 Difference]: With dead ends: 1106 [2025-03-09 05:57:21,662 INFO L226 Difference]: Without dead ends: 635 [2025-03-09 05:57:21,663 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:57:21,663 INFO L435 NwaCegarLoop]: 640 mSDtfsCounter, 0 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1274 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:57:21,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1274 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:57:21,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2025-03-09 05:57:21,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 635. [2025-03-09 05:57:21,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 576 states have (on average 1.390625) internal successors, (801), 605 states have internal predecessors, (801), 28 states have call successors, (28), 13 states have call predecessors, (28), 10 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-09 05:57:21,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 847 transitions. [2025-03-09 05:57:21,688 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 847 transitions. Word has length 109 [2025-03-09 05:57:21,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:57:21,689 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 847 transitions. [2025-03-09 05:57:21,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 05:57:21,690 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 847 transitions. [2025-03-09 05:57:21,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-09 05:57:21,691 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:57:21,691 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:57:21,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-09 05:57:21,691 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-03-09 05:57:21,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:57:21,691 INFO L85 PathProgramCache]: Analyzing trace with hash 206395382, now seen corresponding path program 1 times [2025-03-09 05:57:21,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:57:21,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873251759] [2025-03-09 05:57:21,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:57:21,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:57:21,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-09 05:57:21,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-09 05:57:21,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:57:21,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:22,325 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2025-03-09 05:57:22,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:57:22,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873251759] [2025-03-09 05:57:22,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873251759] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:57:22,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:57:22,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 05:57:22,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76221416] [2025-03-09 05:57:22,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:57:22,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 05:57:22,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:57:22,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 05:57:22,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 05:57:22,326 INFO L87 Difference]: Start difference. First operand 635 states and 847 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 05:57:22,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:57:22,442 INFO L93 Difference]: Finished difference Result 1115 states and 1523 transitions. [2025-03-09 05:57:22,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 05:57:22,443 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 109 [2025-03-09 05:57:22,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:57:22,445 INFO L225 Difference]: With dead ends: 1115 [2025-03-09 05:57:22,445 INFO L226 Difference]: Without dead ends: 636 [2025-03-09 05:57:22,446 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 05:57:22,447 INFO L435 NwaCegarLoop]: 639 mSDtfsCounter, 0 mSDsluCounter, 1276 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1915 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.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:57:22,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1915 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:57:22,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2025-03-09 05:57:22,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 636. [2025-03-09 05:57:22,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 577 states have (on average 1.389948006932409) internal successors, (802), 606 states have internal predecessors, (802), 28 states have call successors, (28), 13 states have call predecessors, (28), 10 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-09 05:57:22,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 848 transitions. [2025-03-09 05:57:22,482 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 848 transitions. Word has length 109 [2025-03-09 05:57:22,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:57:22,482 INFO L471 AbstractCegarLoop]: Abstraction has 636 states and 848 transitions. [2025-03-09 05:57:22,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 05:57:22,483 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 848 transitions. [2025-03-09 05:57:22,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-09 05:57:22,484 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:57:22,484 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:57:22,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-09 05:57:22,485 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-03-09 05:57:22,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:57:22,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1148432348, now seen corresponding path program 1 times [2025-03-09 05:57:22,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:57:22,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631500339] [2025-03-09 05:57:22,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:57:22,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:57:22,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-09 05:57:22,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-09 05:57:22,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:57:22,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:23,123 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2025-03-09 05:57:23,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:57:23,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631500339] [2025-03-09 05:57:23,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631500339] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:57:23,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922293551] [2025-03-09 05:57:23,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:57:23,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:57:23,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:57:23,126 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:57:23,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-09 05:57:23,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-09 05:57:24,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-09 05:57:24,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:57:24,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:24,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 2116 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 05:57:24,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:57:24,170 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2025-03-09 05:57:24,170 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:57:24,225 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2025-03-09 05:57:24,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1922293551] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:57:24,225 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 05:57:24,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-09 05:57:24,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408662720] [2025-03-09 05:57:24,225 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 05:57:24,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 05:57:24,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:57:24,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 05:57:24,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-09 05:57:24,226 INFO L87 Difference]: Start difference. First operand 636 states and 848 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 05:57:24,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:57:24,379 INFO L93 Difference]: Finished difference Result 1120 states and 1530 transitions. [2025-03-09 05:57:24,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 05:57:24,379 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 110 [2025-03-09 05:57:24,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:57:24,381 INFO L225 Difference]: With dead ends: 1120 [2025-03-09 05:57:24,381 INFO L226 Difference]: Without dead ends: 639 [2025-03-09 05:57:24,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-03-09 05:57:24,382 INFO L435 NwaCegarLoop]: 639 mSDtfsCounter, 0 mSDsluCounter, 3189 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3828 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:57:24,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3828 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:57:24,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2025-03-09 05:57:24,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 639. [2025-03-09 05:57:24,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 580 states have (on average 1.3879310344827587) internal successors, (805), 609 states have internal predecessors, (805), 28 states have call successors, (28), 13 states have call predecessors, (28), 10 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-09 05:57:24,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 851 transitions. [2025-03-09 05:57:24,400 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 851 transitions. Word has length 110 [2025-03-09 05:57:24,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:57:24,400 INFO L471 AbstractCegarLoop]: Abstraction has 639 states and 851 transitions. [2025-03-09 05:57:24,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 05:57:24,401 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 851 transitions. [2025-03-09 05:57:24,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-09 05:57:24,402 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:57:24,402 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:57:24,414 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-09 05:57:24,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-09 05:57:24,602 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-03-09 05:57:24,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:57:24,603 INFO L85 PathProgramCache]: Analyzing trace with hash -75361444, now seen corresponding path program 1 times [2025-03-09 05:57:24,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:57:24,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453404936] [2025-03-09 05:57:24,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:57:24,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:57:24,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-09 05:57:24,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-09 05:57:24,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:57:24,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:24,991 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-09 05:57:24,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:57:24,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453404936] [2025-03-09 05:57:24,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453404936] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:57:24,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203978050] [2025-03-09 05:57:24,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:57:24,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:57:24,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:57:24,994 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:57:24,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-09 05:57:25,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-09 05:57:25,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-09 05:57:25,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:57:25,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:26,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 2080 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:57:26,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:57:26,077 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-09 05:57:26,077 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:57:26,163 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-09 05:57:26,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203978050] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:57:26,164 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 05:57:26,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-09 05:57:26,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367658579] [2025-03-09 05:57:26,164 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 05:57:26,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 05:57:26,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:57:26,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 05:57:26,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:57:26,164 INFO L87 Difference]: Start difference. First operand 639 states and 851 transitions. Second operand has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:57:26,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:57:26,280 INFO L93 Difference]: Finished difference Result 742 states and 962 transitions. [2025-03-09 05:57:26,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 05:57:26,281 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 110 [2025-03-09 05:57:26,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:57:26,283 INFO L225 Difference]: With dead ends: 742 [2025-03-09 05:57:26,283 INFO L226 Difference]: Without dead ends: 741 [2025-03-09 05:57:26,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:57:26,284 INFO L435 NwaCegarLoop]: 636 mSDtfsCounter, 0 mSDsluCounter, 1272 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1908 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:57:26,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1908 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:57:26,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2025-03-09 05:57:26,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 741. [2025-03-09 05:57:26,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 741 states, 682 states have (on average 1.3387096774193548) internal successors, (913), 711 states have internal predecessors, (913), 28 states have call successors, (28), 13 states have call predecessors, (28), 10 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-09 05:57:26,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 959 transitions. [2025-03-09 05:57:26,300 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 959 transitions. Word has length 110 [2025-03-09 05:57:26,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:57:26,300 INFO L471 AbstractCegarLoop]: Abstraction has 741 states and 959 transitions. [2025-03-09 05:57:26,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:57:26,301 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 959 transitions. [2025-03-09 05:57:26,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-09 05:57:26,301 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:57:26,301 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:57:26,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-09 05:57:26,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-09 05:57:26,502 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-03-09 05:57:26,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:57:26,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1616966518, now seen corresponding path program 2 times [2025-03-09 05:57:26,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:57:26,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105521302] [2025-03-09 05:57:26,503 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 05:57:26,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:57:26,683 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 113 statements into 2 equivalence classes. [2025-03-09 05:57:26,851 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 113 of 113 statements. [2025-03-09 05:57:26,852 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 05:57:26,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:27,247 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2025-03-09 05:57:27,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:57:27,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105521302] [2025-03-09 05:57:27,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105521302] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:57:27,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846637575] [2025-03-09 05:57:27,248 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 05:57:27,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:57:27,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:57:27,250 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:57:27,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-09 05:57:28,154 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 113 statements into 2 equivalence classes.