./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/ddv-machzwd/ddv_machzwd_inw.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ddv-machzwd/ddv_machzwd_inw.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6e6f79eda5be95b806b33aaa2a353a360ae33a1e35cc1bf6f128d14768d932de --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 09:10:18,886 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 09:10:18,956 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-08 09:10:18,962 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 09:10:18,963 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 09:10:18,976 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 09:10:18,976 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 09:10:18,977 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 09:10:18,977 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 09:10:18,977 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 09:10:18,977 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 09:10:18,977 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 09:10:18,977 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 09:10:18,977 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 09:10:18,977 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 09:10:18,978 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 09:10:18,978 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 09:10:18,978 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 09:10:18,978 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 09:10:18,978 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 09:10:18,978 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 09:10:18,978 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 09:10:18,978 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 09:10:18,978 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 09:10:18,978 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 09:10:18,979 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 09:10:18,979 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 09:10:18,979 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 09:10:18,979 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 09:10:18,979 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 09:10:18,979 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 09:10:18,979 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 09:10:18,979 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 09:10:18,979 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 09:10:18,979 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 09:10:18,979 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 09:10:18,980 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 09:10:18,980 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 09:10:18,980 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 09:10:18,980 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 09:10:18,980 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 09:10:18,980 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 09:10:18,980 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 09:10:18,980 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 09:10:18,980 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 09:10:18,980 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6e6f79eda5be95b806b33aaa2a353a360ae33a1e35cc1bf6f128d14768d932de [2025-02-08 09:10:19,206 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 09:10:19,213 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 09:10:19,215 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 09:10:19,216 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 09:10:19,216 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 09:10:19,218 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ddv-machzwd/ddv_machzwd_inw.i [2025-02-08 09:10:20,372 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f6e1db397/028cdb57bed4480ca03a3a67602b2296/FLAGa66114b85 [2025-02-08 09:10:20,813 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 09:10:20,813 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ddv-machzwd/ddv_machzwd_inw.i [2025-02-08 09:10:20,842 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f6e1db397/028cdb57bed4480ca03a3a67602b2296/FLAGa66114b85 [2025-02-08 09:10:20,857 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f6e1db397/028cdb57bed4480ca03a3a67602b2296 [2025-02-08 09:10:20,859 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 09:10:20,860 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 09:10:20,861 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 09:10:20,861 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 09:10:20,864 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 09:10:20,865 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 09:10:20" (1/1) ... [2025-02-08 09:10:20,867 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7973a023 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:10:20, skipping insertion in model container [2025-02-08 09:10:20,867 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 09:10:20" (1/1) ... [2025-02-08 09:10:20,918 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 09:10:21,803 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 09:10:21,848 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 09:10:21,991 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 09:10:22,154 INFO L204 MainTranslator]: Completed translation [2025-02-08 09:10:22,155 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:10:22 WrapperNode [2025-02-08 09:10:22,156 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 09:10:22,156 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 09:10:22,157 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 09:10:22,157 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 09:10:22,162 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:10:22" (1/1) ... [2025-02-08 09:10:22,230 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:10:22" (1/1) ... [2025-02-08 09:10:22,359 INFO L138 Inliner]: procedures = 473, calls = 2667, calls flagged for inlining = 55, calls inlined = 39, statements flattened = 3372 [2025-02-08 09:10:22,360 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 09:10:22,361 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 09:10:22,361 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 09:10:22,362 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 09:10:22,369 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:10:22" (1/1) ... [2025-02-08 09:10:22,369 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:10:22" (1/1) ... [2025-02-08 09:10:22,382 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:10:22" (1/1) ... [2025-02-08 09:10:22,462 INFO L175 MemorySlicer]: Split 2024 memory accesses to 27 slices as follows [5, 3, 35, 1040, 480, 59, 35, 11, 5, 15, 120, 5, 67, 0, 16, 2, 2, 2, 20, 4, 3, 12, 2, 18, 37, 21, 5]. 51 percent of accesses are in the largest equivalence class. The 1901 initializations are split as follows [3, 3, 15, 1040, 480, 59, 32, 2, 1, 10, 120, 4, 67, 0, 5, 0, 0, 2, 4, 4, 0, 6, 0, 18, 25, 0, 1]. The 58 writes are split as follows [0, 0, 6, 0, 0, 0, 0, 5, 1, 2, 0, 0, 0, 0, 8, 1, 2, 0, 4, 0, 0, 6, 0, 0, 0, 21, 2]. [2025-02-08 09:10:22,463 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:10:22" (1/1) ... [2025-02-08 09:10:22,463 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:10:22" (1/1) ... [2025-02-08 09:10:22,543 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:10:22" (1/1) ... [2025-02-08 09:10:22,553 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:10:22" (1/1) ... [2025-02-08 09:10:22,569 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:10:22" (1/1) ... [2025-02-08 09:10:22,581 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:10:22" (1/1) ... [2025-02-08 09:10:22,603 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 09:10:22,605 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 09:10:22,605 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 09:10:22,605 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 09:10:22,606 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:10:22" (1/1) ... [2025-02-08 09:10:22,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 09:10:22,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:10:22,632 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 09:10:22,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 09:10:22,656 INFO L130 BoogieDeclarations]: Found specification of procedure zf_timer_off [2025-02-08 09:10:22,657 INFO L138 BoogieDeclarations]: Found implementation of procedure zf_timer_off [2025-02-08 09:10:22,657 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 09:10:22,657 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_atomic_begin [2025-02-08 09:10:22,657 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2025-02-08 09:10:22,657 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2025-02-08 09:10:22,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 09:10:22,657 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2025-02-08 09:10:22,657 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2025-02-08 09:10:22,657 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 09:10:22,657 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_atomic_end [2025-02-08 09:10:22,657 INFO L130 BoogieDeclarations]: Found specification of procedure zf_get_control [2025-02-08 09:10:22,657 INFO L138 BoogieDeclarations]: Found implementation of procedure zf_get_control [2025-02-08 09:10:22,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-02-08 09:10:22,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-02-08 09:10:22,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-02-08 09:10:22,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-02-08 09:10:22,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-02-08 09:10:22,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-02-08 09:10:22,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-02-08 09:10:22,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-02-08 09:10:22,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-02-08 09:10:22,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-02-08 09:10:22,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-02-08 09:10:22,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-02-08 09:10:22,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-02-08 09:10:22,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-02-08 09:10:22,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-02-08 09:10:22,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-02-08 09:10:22,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-02-08 09:10:22,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-02-08 09:10:22,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-02-08 09:10:22,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#19 [2025-02-08 09:10:22,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#20 [2025-02-08 09:10:22,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#21 [2025-02-08 09:10:22,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#22 [2025-02-08 09:10:22,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#23 [2025-02-08 09:10:22,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#24 [2025-02-08 09:10:22,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#25 [2025-02-08 09:10:22,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#26 [2025-02-08 09:10:22,661 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 09:10:22,661 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 09:10:22,661 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 09:10:22,661 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-08 09:10:22,661 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-08 09:10:22,661 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-08 09:10:22,661 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-08 09:10:22,661 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-08 09:10:22,661 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-08 09:10:22,662 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-08 09:10:22,662 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-08 09:10:22,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-08 09:10:22,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-02-08 09:10:22,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-02-08 09:10:22,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-02-08 09:10:22,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-02-08 09:10:22,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-02-08 09:10:22,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-02-08 09:10:22,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-02-08 09:10:22,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-02-08 09:10:22,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#20 [2025-02-08 09:10:22,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#21 [2025-02-08 09:10:22,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#22 [2025-02-08 09:10:22,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#23 [2025-02-08 09:10:22,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#24 [2025-02-08 09:10:22,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#25 [2025-02-08 09:10:22,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#26 [2025-02-08 09:10:22,663 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 09:10:22,663 INFO L130 BoogieDeclarations]: Found specification of procedure request_region [2025-02-08 09:10:22,663 INFO L138 BoogieDeclarations]: Found implementation of procedure request_region [2025-02-08 09:10:22,663 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 09:10:22,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 09:10:22,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 09:10:22,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 09:10:22,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-08 09:10:22,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-08 09:10:22,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-08 09:10:22,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-02-08 09:10:22,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-02-08 09:10:22,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-02-08 09:10:22,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-02-08 09:10:22,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-02-08 09:10:22,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-02-08 09:10:22,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-02-08 09:10:22,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-02-08 09:10:22,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-02-08 09:10:22,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-02-08 09:10:22,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-02-08 09:10:22,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-02-08 09:10:22,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-02-08 09:10:22,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2025-02-08 09:10:22,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#20 [2025-02-08 09:10:22,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#21 [2025-02-08 09:10:22,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#22 [2025-02-08 09:10:22,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#23 [2025-02-08 09:10:22,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#24 [2025-02-08 09:10:22,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#25 [2025-02-08 09:10:22,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#26 [2025-02-08 09:10:22,664 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2025-02-08 09:10:22,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2025-02-08 09:10:22,664 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_irqsave [2025-02-08 09:10:22,664 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_irqsave [2025-02-08 09:10:22,664 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~TO~VOID [2025-02-08 09:10:22,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~TO~VOID [2025-02-08 09:10:22,664 INFO L130 BoogieDeclarations]: Found specification of procedure release_region [2025-02-08 09:10:22,664 INFO L138 BoogieDeclarations]: Found implementation of procedure release_region [2025-02-08 09:10:22,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 09:10:22,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 09:10:22,664 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_init [2025-02-08 09:10:22,665 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_init [2025-02-08 09:10:22,665 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-08 09:10:22,665 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-08 09:10:22,665 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer [2025-02-08 09:10:22,665 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer [2025-02-08 09:10:22,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 09:10:22,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 09:10:22,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 09:10:22,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 09:10:22,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-08 09:10:22,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-08 09:10:22,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-08 09:10:22,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-02-08 09:10:22,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-02-08 09:10:22,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-02-08 09:10:22,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-02-08 09:10:22,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-02-08 09:10:22,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-02-08 09:10:22,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-02-08 09:10:22,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-02-08 09:10:22,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-02-08 09:10:22,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-02-08 09:10:22,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-02-08 09:10:22,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-02-08 09:10:22,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-02-08 09:10:22,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2025-02-08 09:10:22,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#20 [2025-02-08 09:10:22,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#21 [2025-02-08 09:10:22,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#22 [2025-02-08 09:10:22,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#23 [2025-02-08 09:10:22,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#24 [2025-02-08 09:10:22,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#25 [2025-02-08 09:10:22,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#26 [2025-02-08 09:10:22,668 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2025-02-08 09:10:22,668 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2025-02-08 09:10:22,668 INFO L130 BoogieDeclarations]: Found specification of procedure cdev_add [2025-02-08 09:10:22,668 INFO L138 BoogieDeclarations]: Found implementation of procedure cdev_add [2025-02-08 09:10:22,668 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~$Pointer$~TO~int [2025-02-08 09:10:22,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~$Pointer$~TO~int [2025-02-08 09:10:22,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-08 09:10:22,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-08 09:10:22,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-08 09:10:22,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-02-08 09:10:22,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-02-08 09:10:22,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-02-08 09:10:22,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-02-08 09:10:22,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-02-08 09:10:22,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-02-08 09:10:22,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-02-08 09:10:22,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-02-08 09:10:22,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-02-08 09:10:22,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-02-08 09:10:22,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-02-08 09:10:22,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-02-08 09:10:22,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-02-08 09:10:22,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-02-08 09:10:22,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-02-08 09:10:22,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2025-02-08 09:10:22,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2025-02-08 09:10:22,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#20 [2025-02-08 09:10:22,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#21 [2025-02-08 09:10:22,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#22 [2025-02-08 09:10:22,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#23 [2025-02-08 09:10:22,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#24 [2025-02-08 09:10:22,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#25 [2025-02-08 09:10:22,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#26 [2025-02-08 09:10:22,669 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-02-08 09:10:22,669 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-02-08 09:10:22,669 INFO L130 BoogieDeclarations]: Found specification of procedure outw [2025-02-08 09:10:22,669 INFO L138 BoogieDeclarations]: Found implementation of procedure outw [2025-02-08 09:10:22,669 INFO L130 BoogieDeclarations]: Found specification of procedure outb [2025-02-08 09:10:22,669 INFO L138 BoogieDeclarations]: Found implementation of procedure outb [2025-02-08 09:10:22,669 INFO L130 BoogieDeclarations]: Found specification of procedure misc_deregister [2025-02-08 09:10:22,669 INFO L138 BoogieDeclarations]: Found implementation of procedure misc_deregister [2025-02-08 09:10:22,669 INFO L130 BoogieDeclarations]: Found specification of procedure assert_context_process [2025-02-08 09:10:22,669 INFO L138 BoogieDeclarations]: Found implementation of procedure assert_context_process [2025-02-08 09:10:22,669 INFO L130 BoogieDeclarations]: Found specification of procedure zf_set_control [2025-02-08 09:10:22,669 INFO L138 BoogieDeclarations]: Found implementation of procedure zf_set_control [2025-02-08 09:10:22,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 09:10:22,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 09:10:22,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 09:10:22,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-08 09:10:22,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-08 09:10:22,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-08 09:10:22,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-08 09:10:22,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-08 09:10:22,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-08 09:10:22,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-08 09:10:22,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-08 09:10:22,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-08 09:10:22,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-02-08 09:10:22,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-02-08 09:10:22,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-02-08 09:10:22,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-02-08 09:10:22,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-02-08 09:10:22,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-02-08 09:10:22,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-02-08 09:10:22,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-02-08 09:10:22,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#20 [2025-02-08 09:10:22,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#21 [2025-02-08 09:10:22,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#22 [2025-02-08 09:10:22,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#23 [2025-02-08 09:10:22,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#24 [2025-02-08 09:10:22,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#25 [2025-02-08 09:10:22,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#26 [2025-02-08 09:10:22,670 INFO L130 BoogieDeclarations]: Found specification of procedure zf_readw [2025-02-08 09:10:22,670 INFO L138 BoogieDeclarations]: Found implementation of procedure zf_readw [2025-02-08 09:10:22,670 INFO L130 BoogieDeclarations]: Found specification of procedure zf_ping [2025-02-08 09:10:22,670 INFO L138 BoogieDeclarations]: Found implementation of procedure zf_ping [2025-02-08 09:10:22,670 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~TO~int [2025-02-08 09:10:22,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~TO~int [2025-02-08 09:10:22,673 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2025-02-08 09:10:22,673 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2025-02-08 09:10:22,673 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2025-02-08 09:10:22,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2025-02-08 09:10:22,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 09:10:22,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 09:10:22,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 09:10:22,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-08 09:10:22,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-08 09:10:22,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-08 09:10:22,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-08 09:10:22,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-08 09:10:22,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-08 09:10:22,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-08 09:10:22,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-08 09:10:22,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-08 09:10:22,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-08 09:10:22,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-08 09:10:22,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-08 09:10:22,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-02-08 09:10:22,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-02-08 09:10:22,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-02-08 09:10:22,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-02-08 09:10:22,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-02-08 09:10:22,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#20 [2025-02-08 09:10:22,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#21 [2025-02-08 09:10:22,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#22 [2025-02-08 09:10:22,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#23 [2025-02-08 09:10:22,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#24 [2025-02-08 09:10:22,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#25 [2025-02-08 09:10:22,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#26 [2025-02-08 09:10:23,098 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 09:10:23,103 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 09:10:23,239 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3246: havoc get_user_#t~nondet671#1;zf_write_#t~ret212#1 := get_user_#res#1;havoc get_user_#t~nondet671#1, get_user_~size#1, get_user_~ptr#1.base, get_user_~ptr#1.offset;havoc get_user_#in~size#1, get_user_#in~ptr#1.base, get_user_#in~ptr#1.offset;assume { :end_inline_get_user } true;assume -2147483648 <= zf_write_#t~ret212#1 && zf_write_#t~ret212#1 <= 2147483647; [2025-02-08 09:10:23,240 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1646: assume 86 == zf_write_~c~0#1;~zf_expect_close~0 := 42; [2025-02-08 09:10:23,240 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1646: assume !(86 == zf_write_~c~0#1); [2025-02-08 09:10:23,240 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1644: assume 0 != zf_write_#t~ret212#1;havoc zf_write_#t~ret212#1;zf_write_#res#1 := -14; [2025-02-08 09:10:23,240 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1644: assume !(0 != zf_write_#t~ret212#1);havoc zf_write_#t~ret212#1; [2025-02-08 09:10:23,240 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1642-1: havoc zf_write_~c~0#1;zf_write_#t~post213#1 := zf_write_~ofs~0#1;zf_write_~ofs~0#1 := 1 + zf_write_#t~post213#1;havoc zf_write_#t~post213#1; [2025-02-08 09:10:23,248 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1508: havoc #t~ret200; [2025-02-08 09:10:23,266 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1470: havoc #t~ret199#1; [2025-02-08 09:10:23,266 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3965: havoc inw_#t~nondet754#1; [2025-02-08 09:10:23,342 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3262: havoc put_user_#t~nondet673#1;zf_ioctl_#t~ret216#1 := put_user_#res#1;havoc put_user_#t~nondet673#1, put_user_~size#1, put_user_~ptr#1.base, put_user_~ptr#1.offset;havoc put_user_#in~size#1, put_user_#in~ptr#1.base, put_user_#in~ptr#1.offset;assume { :end_inline_put_user } true;assume -2147483648 <= zf_ioctl_#t~ret216#1 && zf_ioctl_#t~ret216#1 <= 2147483647;zf_ioctl_#res#1 := zf_ioctl_#t~ret216#1;havoc zf_ioctl_#t~ret216#1; [2025-02-08 09:10:23,342 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1671-1: assume 0 != zf_ioctl_#t~ret215#1 % 4294967296;havoc zf_ioctl_#t~ret215#1;zf_ioctl_#res#1 := -14; [2025-02-08 09:10:23,342 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1671-1: assume !(0 != zf_ioctl_#t~ret215#1 % 4294967296);havoc zf_ioctl_#t~ret215#1; [2025-02-08 09:10:23,343 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3270: havoc copy_to_user_#t~nondet674#1;zf_ioctl_#t~ret215#1 := copy_to_user_#res#1;havoc copy_to_user_#t~nondet674#1, copy_to_user_~to#1.base, copy_to_user_~to#1.offset, copy_to_user_~from#1.base, copy_to_user_~from#1.offset, copy_to_user_~n#1;havoc copy_to_user_#in~to#1.base, copy_to_user_#in~to#1.offset, copy_to_user_#in~from#1.base, copy_to_user_#in~from#1.offset, copy_to_user_#in~n#1;assume { :end_inline_copy_to_user } true; [2025-02-08 09:10:23,437 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1567: assume { :begin_inline_zf_set_timer } true;zf_set_timer_#in~new#1, zf_set_timer_#in~n#1 := 65535, 0;havoc zf_set_timer_#t~switch201#1, zf_set_timer_~new#1, zf_set_timer_~n#1;zf_set_timer_~new#1 := zf_set_timer_#in~new#1;zf_set_timer_~n#1 := zf_set_timer_#in~n#1;zf_set_timer_#t~switch201#1 := 0 == (if zf_set_timer_~n#1 % 256 % 4294967296 <= 2147483647 then zf_set_timer_~n#1 % 256 % 4294967296 else zf_set_timer_~n#1 % 256 % 4294967296 - 4294967296); [2025-02-08 09:10:23,438 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1567-1: SUMMARY for call outb(255, 537); srcloc: null [2025-02-08 09:10:23,438 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1567-2: SUMMARY for call outb(15, 536); srcloc: null [2025-02-08 09:10:23,438 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1526: SUMMARY for call outw(zf_set_timer_~new#1, 538); srcloc: null [2025-02-08 09:10:23,438 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1526-1: SUMMARY for call outb(12, 536); srcloc: null [2025-02-08 09:10:23,438 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1580: zf_timer_on_~ctrl_reg~1#1 := zf_timer_on_#t~ret205#1 % 65536;havoc zf_timer_on_#t~ret205#1; [2025-02-08 09:10:23,438 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1580-1: SUMMARY for call zf_timer_on_#t~ret205#1 := zf_get_control(); srcloc: null [2025-02-08 09:10:23,438 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1: #res#1 := #t~funptrres805#1;havoc #t~funptrres805#1;havoc #t~ret806#1;havoc #t~ret807#1; [2025-02-08 09:10:23,439 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1-1: #t~ret807#1 := zf_close_#res#1;havoc zf_close_#t~ret219#1, zf_close_#t~ret220#1, zf_close_~inode#1.base, zf_close_~inode#1.offset, zf_close_~file#1.base, zf_close_~file#1.offset;havoc zf_close_#in~inode#1.base, zf_close_#in~inode#1.offset, zf_close_#in~file#1.base, zf_close_#in~file#1.offset;assume { :end_inline_zf_close } true;assume -2147483648 <= #t~ret807#1 && #t~ret807#1 <= 2147483647;#t~funptrres805#1 := #t~ret807#1; [2025-02-08 09:10:23,439 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4512: havoc test_and_set_bit_#t~bitwise795#1;zf_open_#t~ret217#1 := test_and_set_bit_#res#1;havoc test_and_set_bit_#t~bitwise792#1, test_and_set_bit_#t~mem793#1, test_and_set_bit_#t~bitwise794#1, test_and_set_bit_#t~bitwise795#1, test_and_set_bit_~nr#1, test_and_set_bit_~addr#1.base, test_and_set_bit_~addr#1.offset, test_and_set_bit_~bit~0#1, test_and_set_bit_~old~0#1;havoc test_and_set_bit_#in~nr#1, test_and_set_bit_#in~addr#1.base, test_and_set_bit_#in~addr#1.offset;assume { :end_inline_test_and_set_bit } true;assume -2147483648 <= zf_open_#t~ret217#1 && zf_open_#t~ret217#1 <= 2147483647; [2025-02-08 09:10:23,439 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1527: assume zf_set_timer_#t~switch201#1; [2025-02-08 09:10:23,439 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1527: assume !zf_set_timer_#t~switch201#1; [2025-02-08 09:10:23,439 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1527-1: zf_set_timer_#t~switch201#1 := zf_set_timer_#t~switch201#1 || 1 == (if zf_set_timer_~n#1 % 256 % 4294967296 <= 2147483647 then zf_set_timer_~n#1 % 256 % 4294967296 else zf_set_timer_~n#1 % 256 % 4294967296 - 4294967296); [2025-02-08 09:10:23,439 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1585: assume -2147483648 <= zf_timer_on_#t~ret207#1 && zf_timer_on_#t~ret207#1 <= 2147483647;havoc zf_timer_on_#t~ret207#1;havoc zf_timer_on_#t~ret205#1, zf_timer_on_#t~bitwise206#1, zf_timer_on_#t~ret207#1, zf_timer_on_~ctrl_reg~1#1, zf_timer_on_~flags~1#1;assume { :end_inline_zf_timer_on } true;assume { :begin_inline_nonseekable_open } true;nonseekable_open_#in~inode#1.base, nonseekable_open_#in~inode#1.offset, nonseekable_open_#in~filp#1.base, nonseekable_open_#in~filp#1.offset := zf_open_~inode#1.base, zf_open_~inode#1.offset, zf_open_~file#1.base, zf_open_~file#1.offset;havoc nonseekable_open_#res#1;havoc nonseekable_open_~inode#1.base, nonseekable_open_~inode#1.offset, nonseekable_open_~filp#1.base, nonseekable_open_~filp#1.offset, nonseekable_open_~i~16#1;nonseekable_open_~inode#1.base, nonseekable_open_~inode#1.offset := nonseekable_open_#in~inode#1.base, nonseekable_open_#in~inode#1.offset;nonseekable_open_~filp#1.base, nonseekable_open_~filp#1.offset := nonseekable_open_#in~filp#1.base, nonseekable_open_#in~filp#1.offset;havoc nonseekable_open_~i~16#1;nonseekable_open_#res#1 := nonseekable_open_~i~16#1; [2025-02-08 09:10:23,439 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1585-1: SUMMARY for call zf_timer_on_#t~ret207#1 := printk(11, 0); srcloc: null [2025-02-08 09:10:23,439 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1581: zf_timer_on_~ctrl_reg~1#1 := zf_timer_on_#t~bitwise206#1;havoc zf_timer_on_#t~bitwise206#1; [2025-02-08 09:10:23,439 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1581-1: [2025-02-08 09:10:23,439 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1581-2: havoc zf_timer_on_#t~bitwise206#1;assume (zf_timer_on_#t~bitwise206#1 % 4294967296 >= zf_timer_on_~ctrl_reg~1#1 % 4294967296 && zf_timer_on_#t~bitwise206#1 % 4294967296 >= (1 + ~zf_action~0 - ~zf_action~0 % 2) % 4294967296) && zf_timer_on_#t~bitwise206#1 % 4294967296 <= zf_timer_on_~ctrl_reg~1#1 % 4294967296 + (1 + ~zf_action~0 - ~zf_action~0 % 2) % 4294967296; [2025-02-08 09:10:23,439 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1581-3: assume 0 == (1 + ~zf_action~0 - ~zf_action~0 % 2) % 4294967296;zf_timer_on_#t~bitwise206#1 := zf_timer_on_~ctrl_reg~1#1; [2025-02-08 09:10:23,439 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1581-3: assume !(0 == (1 + ~zf_action~0 - ~zf_action~0 % 2) % 4294967296); [2025-02-08 09:10:23,440 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1705: havoc zf_open_#t~ret218#1;#t~ret806#1 := zf_open_#res#1;havoc zf_open_#t~ret217#1, zf_open_#t~ret218#1, zf_open_~inode#1.base, zf_open_~inode#1.offset, zf_open_~file#1.base, zf_open_~file#1.offset;havoc zf_open_#in~inode#1.base, zf_open_#in~inode#1.offset, zf_open_#in~file#1.base, zf_open_#in~file#1.offset;assume { :end_inline_zf_open } true;assume -2147483648 <= #t~ret806#1 && #t~ret806#1 <= 2147483647;#t~funptrres805#1 := #t~ret806#1; [2025-02-08 09:10:23,440 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1581-4: assume 0 == zf_timer_on_~ctrl_reg~1#1 % 4294967296 || zf_timer_on_~ctrl_reg~1#1 % 4294967296 == (1 + ~zf_action~0 - ~zf_action~0 % 2) % 4294967296;zf_timer_on_#t~bitwise206#1 := 1 + ~zf_action~0 - ~zf_action~0 % 2; [2025-02-08 09:10:23,440 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1581-4: assume !(0 == zf_timer_on_~ctrl_reg~1#1 % 4294967296 || zf_timer_on_~ctrl_reg~1#1 % 4294967296 == (1 + ~zf_action~0 - ~zf_action~0 % 2) % 4294967296); [2025-02-08 09:10:23,440 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1577: SUMMARY for call add_timer(~#zf_timer~0.base, ~#zf_timer~0.offset); srcloc: null [2025-02-08 09:10:23,440 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1705-2: zf_open_#t~ret218#1 := nonseekable_open_#res#1;havoc nonseekable_open_~inode#1.base, nonseekable_open_~inode#1.offset, nonseekable_open_~filp#1.base, nonseekable_open_~filp#1.offset, nonseekable_open_~i~16#1;havoc nonseekable_open_#in~inode#1.base, nonseekable_open_#in~inode#1.offset, nonseekable_open_#in~filp#1.base, nonseekable_open_#in~filp#1.offset;assume { :end_inline_nonseekable_open } true;assume -2147483648 <= zf_open_#t~ret218#1 && zf_open_#t~ret218#1 <= 2147483647;zf_open_#res#1 := zf_open_#t~ret218#1;havoc zf_open_#t~ret218#1; [2025-02-08 09:10:23,440 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1701: assume { :begin_inline_zf_timer_on } true;havoc zf_timer_on_#t~ret205#1, zf_timer_on_#t~bitwise206#1, zf_timer_on_#t~ret207#1, zf_timer_on_~ctrl_reg~1#1, zf_timer_on_~flags~1#1;zf_timer_on_~ctrl_reg~1#1 := 0;havoc zf_timer_on_~flags~1#1; [2025-02-08 09:10:23,440 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1701-1: SUMMARY for call spin_unlock(~#zf_lock~0.base, ~#zf_lock~0.offset); srcloc: null [2025-02-08 09:10:23,440 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1565: SUMMARY for call spin_lock_irqsave(~#zf_port_lock~0.base, ~#zf_port_lock~0.offset, zf_timer_on_~flags~1#1); srcloc: null [2025-02-08 09:10:23,440 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1693: assume 0 != zf_open_#t~ret217#1;havoc zf_open_#t~ret217#1; [2025-02-08 09:10:23,440 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1693: assume !(0 != zf_open_#t~ret217#1);havoc zf_open_#t~ret217#1; [2025-02-08 09:10:23,440 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1528: SUMMARY for call outb((if (if zf_set_timer_~new#1 % 65536 % 4294967296 <= 2147483647 then zf_set_timer_~new#1 % 65536 % 4294967296 else zf_set_timer_~new#1 % 65536 % 4294967296 - 4294967296) > 255 then 255 else (if zf_set_timer_~new#1 % 65536 % 4294967296 <= 2147483647 then zf_set_timer_~new#1 % 65536 % 4294967296 else zf_set_timer_~new#1 % 65536 % 4294967296 - 4294967296)), 537); srcloc: null [2025-02-08 09:10:23,440 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1528-1: SUMMARY for call outb(14, 536); srcloc: null [2025-02-08 09:10:23,440 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1582: SUMMARY for call zf_set_control(zf_timer_on_~ctrl_reg~1#1); srcloc: null [2025-02-08 09:10:23,441 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1698: assume 0 != ~nowayout~0;assume { :begin_inline___module_get } true;__module_get_#in~module#1.base, __module_get_#in~module#1.offset := 0, 0;havoc __module_get_~module#1.base, __module_get_~module#1.offset;__module_get_~module#1.base, __module_get_~module#1.offset := __module_get_#in~module#1.base, __module_get_#in~module#1.offset;havoc __module_get_~module#1.base, __module_get_~module#1.offset;havoc __module_get_#in~module#1.base, __module_get_#in~module#1.offset;assume { :end_inline___module_get } true; [2025-02-08 09:10:23,441 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1698: assume !(0 != ~nowayout~0); [2025-02-08 09:10:23,441 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1694: zf_open_#res#1 := -16; [2025-02-08 09:10:23,441 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1694-1: SUMMARY for call spin_unlock(~#zf_lock~0.base, ~#zf_lock~0.offset); srcloc: null [2025-02-08 09:10:23,441 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1529: assume zf_set_timer_#t~switch201#1; [2025-02-08 09:10:23,441 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1529: assume !zf_set_timer_#t~switch201#1;havoc zf_set_timer_#t~switch201#1;havoc zf_set_timer_#t~switch201#1;havoc zf_set_timer_#t~switch201#1, zf_set_timer_~new#1, zf_set_timer_~n#1;havoc zf_set_timer_#in~new#1, zf_set_timer_#in~n#1;assume { :end_inline_zf_set_timer } true;~next_heartbeat~0 := 1000 + ~jiffies~0;call write~int#14(50 + ~jiffies~0, ~#zf_timer~0.base, ~#zf_timer~0.offset, 4); [2025-02-08 09:10:23,441 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1529-1: zf_set_timer_#t~switch201#1 := true; [2025-02-08 09:10:23,441 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1525: assume zf_set_timer_#t~switch201#1; [2025-02-08 09:10:23,441 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1525: assume !zf_set_timer_#t~switch201#1; [2025-02-08 09:10:23,441 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint ##fun~$Pointer$~X~$Pointer$~TO~intFINAL: assume true; [2025-02-08 09:10:23,441 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1583: SUMMARY for call spin_unlock_irqrestore(~#zf_port_lock~0.base, ~#zf_port_lock~0.offset, zf_timer_on_~flags~1#1); srcloc: null [2025-02-08 09:10:27,557 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4247: assume ~number_timer_registered~0 < 1;call write~int#14(0, init_timer_~timer#1.base, 12 + init_timer_~timer#1.offset, 2);call write~int#14(1, init_timer_~timer#1.base, 14 + init_timer_~timer#1.offset, 2);call write~$Pointer$#8(init_timer_~timer#1.base, init_timer_~timer#1.offset, ~#timer_registered~0.base, ~#timer_registered~0.offset + 4 * ~number_timer_registered~0, 4);init_timer_#t~post767#1 := ~number_timer_registered~0; [2025-02-08 09:10:27,557 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4247: assume !(~number_timer_registered~0 < 1); [2025-02-08 09:10:27,557 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1803: assume zf_init_#t~ret229#1.base == 0 && zf_init_#t~ret229#1.offset == 0;havoc zf_init_#t~ret229#1.base, zf_init_#t~ret229#1.offset; [2025-02-08 09:10:27,557 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1803: assume !(zf_init_#t~ret229#1.base == 0 && zf_init_#t~ret229#1.offset == 0);havoc zf_init_#t~ret229#1.base, zf_init_#t~ret229#1.offset;assume { :begin_inline_register_reboot_notifier } true;register_reboot_notifier_#in~dummy#1.base, register_reboot_notifier_#in~dummy#1.offset := ~#zf_notifier~0.base, ~#zf_notifier~0.offset;havoc register_reboot_notifier_#res#1;havoc register_reboot_notifier_~dummy#1.base, register_reboot_notifier_~dummy#1.offset, register_reboot_notifier_~i~17#1;register_reboot_notifier_~dummy#1.base, register_reboot_notifier_~dummy#1.offset := register_reboot_notifier_#in~dummy#1.base, register_reboot_notifier_#in~dummy#1.offset;havoc register_reboot_notifier_~i~17#1;register_reboot_notifier_#res#1 := register_reboot_notifier_~i~17#1;zf_init_#t~ret231#1 := register_reboot_notifier_#res#1;havoc register_reboot_notifier_~dummy#1.base, register_reboot_notifier_~dummy#1.offset, register_reboot_notifier_~i~17#1;havoc register_reboot_notifier_#in~dummy#1.base, register_reboot_notifier_#in~dummy#1.offset;assume { :end_inline_register_reboot_notifier } true;assume -2147483648 <= zf_init_#t~ret231#1 && zf_init_#t~ret231#1 <= 2147483647;zf_init_~ret~3#1 := zf_init_#t~ret231#1;havoc zf_init_#t~ret231#1; [2025-02-08 09:10:27,557 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1803-1: SUMMARY for call zf_init_#t~ret229#1.base, zf_init_#t~ret229#1.offset := request_region(536, 3, 23, 0); srcloc: null [2025-02-08 09:10:27,557 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3505: havoc misc_register_#t~ret713#1;zf_init_#t~ret227#1 := misc_register_#res#1;havoc misc_register_#t~post709#1, misc_register_#t~mem710#1.base, misc_register_#t~mem710#1.offset, misc_register_#t~mem711#1, misc_register_#t~bitwise712#1, misc_register_#t~ret713#1, misc_register_~misc#1.base, misc_register_~misc#1.offset, misc_register_~i~9#1, misc_register_~dev~0#1;havoc misc_register_#in~misc#1.base, misc_register_#in~misc#1.offset;assume { :end_inline_misc_register } true;assume -2147483648 <= zf_init_#t~ret227#1 && zf_init_#t~ret227#1 <= 2147483647;zf_init_~ret~3#1 := zf_init_#t~ret227#1;havoc zf_init_#t~ret227#1; [2025-02-08 09:10:27,558 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1804: assume -2147483648 <= zf_init_#t~ret230#1 && zf_init_#t~ret230#1 <= 2147483647;havoc zf_init_#t~ret230#1;zf_init_~ret~3#1 := -16; [2025-02-08 09:10:27,558 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1804-1: SUMMARY for call zf_init_#t~ret230#1 := printk(24, 0); srcloc: null [2025-02-08 09:10:27,558 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1821: havoc init_timer_#t~post767#1, init_timer_~timer#1.base, init_timer_~timer#1.offset;havoc init_timer_#in~timer#1.base, init_timer_#in~timer#1.offset;assume { :end_inline_init_timer } true;call write~$Pointer$#14(#funAddr~zf_ping.base, #funAddr~zf_ping.offset, ~#zf_timer~0.base, 4 + ~#zf_timer~0.offset, 4);call write~int#14(0, ~#zf_timer~0.base, 8 + ~#zf_timer~0.offset, 4);zf_init_#res#1 := 0; [2025-02-08 09:10:27,558 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4252-1: assume 1 + init_timer_#t~post767#1 >= -32768; [2025-02-08 09:10:27,558 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4252-1: assume !(1 + init_timer_#t~post767#1 >= -32768); [2025-02-08 09:10:27,558 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4252: assume 1 + init_timer_#t~post767#1 <= 32767;~number_timer_registered~0 := 1 + init_timer_#t~post767#1;havoc init_timer_#t~post767#1; [2025-02-08 09:10:27,558 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4252: assume !(1 + init_timer_#t~post767#1 <= 32767); [2025-02-08 09:10:27,558 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1811: assume 0 != zf_init_~ret~3#1; [2025-02-08 09:10:27,558 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1811: assume !(0 != zf_init_~ret~3#1);assume { :begin_inline_zf_set_status } true;zf_set_status_#in~new#1 := 0;havoc zf_set_status_~new#1;zf_set_status_~new#1 := zf_set_status_#in~new#1; [2025-02-08 09:10:27,558 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828: SUMMARY for call release_region(536, 3); srcloc: null [2025-02-08 09:10:27,558 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1812: assume -2147483648 <= zf_init_#t~ret232#1 && zf_init_#t~ret232#1 <= 2147483647;havoc zf_init_#t~ret232#1; [2025-02-08 09:10:27,559 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1812-1: SUMMARY for call zf_init_#t~ret232#1 := printk(25, 0); srcloc: null [2025-02-08 09:10:27,559 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1830: assume -2147483648 <= zf_init_#t~ret233#1 && zf_init_#t~ret233#1 <= 2147483647;zf_init_#res#1 := zf_init_~ret~3#1; [2025-02-08 09:10:27,559 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1830-1: SUMMARY for call zf_init_#t~ret233#1 := misc_deregister(~#zf_miscdev~0.base, ~#zf_miscdev~0.offset); srcloc: null [2025-02-08 09:10:27,559 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1797: assume 0 != zf_init_~ret~3#1; [2025-02-08 09:10:27,559 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1797: assume !(0 != zf_init_~ret~3#1); [2025-02-08 09:10:27,559 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1500: havoc zf_set_status_~new#1;havoc zf_set_status_#in~new#1;assume { :end_inline_zf_set_status } true; [2025-02-08 09:10:27,559 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1500-1: SUMMARY for call outb(zf_set_status_~new#1, 537); srcloc: null [2025-02-08 09:10:27,559 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1500-2: SUMMARY for call outb(18, 536); srcloc: null [2025-02-08 09:10:27,559 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2772: call_cdev_functions_#t~ret327#1 := ##fun~$Pointer$~X~~loff_t~0~X~int~TO~~loff_t~0_#res#1;havoc ##fun~$Pointer$~X~~loff_t~0~X~int~TO~~loff_t~0_#~320#1.base, ##fun~$Pointer$~X~~loff_t~0~X~int~TO~~loff_t~0_#~320#1.offset, ##fun~$Pointer$~X~~loff_t~0~X~int~TO~~loff_t~0_#~321#1, ##fun~$Pointer$~X~~loff_t~0~X~int~TO~~loff_t~0_#~322#1, ##fun~$Pointer$~X~~loff_t~0~X~int~TO~~loff_t~0_#t~ret802#1;havoc ##fun~$Pointer$~X~~loff_t~0~X~int~TO~~loff_t~0_#in~320#1.base, ##fun~$Pointer$~X~~loff_t~0~X~int~TO~~loff_t~0_#in~320#1.offset, ##fun~$Pointer$~X~~loff_t~0~X~int~TO~~loff_t~0_#in~321#1, ##fun~$Pointer$~X~~loff_t~0~X~int~TO~~loff_t~0_#in~322#1, ##fun~$Pointer$~X~~loff_t~0~X~int~TO~~loff_t~0_#in~#fp#1.base, ##fun~$Pointer$~X~~loff_t~0~X~int~TO~~loff_t~0_#in~#fp#1.offset;assume { :end_inline_##fun~$Pointer$~X~~loff_t~0~X~int~TO~~loff_t~0 } true;assume -9223372036854775808 <= call_cdev_functions_#t~ret327#1 && call_cdev_functions_#t~ret327#1 <= 9223372036854775807;havoc call_cdev_functions_#t~mem323#1;havoc call_cdev_functions_#t~mem324#1.base, call_cdev_functions_#t~mem324#1.offset;havoc call_cdev_functions_#t~mem325#1.base, call_cdev_functions_#t~mem325#1.offset;havoc call_cdev_functions_#t~mem326#1.base, call_cdev_functions_#t~mem326#1.offset;havoc call_cdev_functions_#t~ret327#1; [2025-02-08 09:10:27,559 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1798: assume -2147483648 <= zf_init_#t~ret228#1 && zf_init_#t~ret228#1 <= 2147483647;havoc zf_init_#t~ret228#1; [2025-02-08 09:10:27,559 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1798-1: SUMMARY for call zf_init_#t~ret228#1 := printk(22, 0); srcloc: null [2025-02-08 09:10:27,559 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1-1: ##fun~$Pointer$~X~~loff_t~0~X~int~TO~~loff_t~0_#t~ret802#1 := no_llseek_#res#1;havoc no_llseek_~file#1.base, no_llseek_~file#1.offset, no_llseek_~offset#1, no_llseek_~origin#1, no_llseek_~l~0#1;havoc no_llseek_#in~file#1.base, no_llseek_#in~file#1.offset, no_llseek_#in~offset#1, no_llseek_#in~origin#1;assume { :end_inline_no_llseek } true;assume -9223372036854775808 <= ##fun~$Pointer$~X~~loff_t~0~X~int~TO~~loff_t~0_#t~ret802#1 && ##fun~$Pointer$~X~~loff_t~0~X~int~TO~~loff_t~0_#t~ret802#1 <= 9223372036854775807;##fun~$Pointer$~X~~loff_t~0~X~int~TO~~loff_t~0_#res#1 := ##fun~$Pointer$~X~~loff_t~0~X~int~TO~~loff_t~0_#t~ret802#1;havoc ##fun~$Pointer$~X~~loff_t~0~X~int~TO~~loff_t~0_#t~ret802#1; [2025-02-08 09:10:27,559 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1818: assume { :begin_inline_init_timer } true;init_timer_#in~timer#1.base, init_timer_#in~timer#1.offset := ~#zf_timer~0.base, ~#zf_timer~0.offset;havoc init_timer_#t~post767#1, init_timer_~timer#1.base, init_timer_~timer#1.offset;init_timer_~timer#1.base, init_timer_~timer#1.offset := init_timer_#in~timer#1.base, init_timer_#in~timer#1.offset; [2025-02-08 09:10:27,560 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1818-1: SUMMARY for call zf_set_control(0); srcloc: null [2025-02-08 09:10:27,677 INFO L? ?]: Removed 391 outVars from TransFormulas that were not future-live. [2025-02-08 09:10:27,677 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 09:10:27,709 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 09:10:27,709 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 09:10:27,711 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 09:10:27 BoogieIcfgContainer [2025-02-08 09:10:27,711 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 09:10:27,713 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 09:10:27,714 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 09:10:27,717 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 09:10:27,717 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 09:10:20" (1/3) ... [2025-02-08 09:10:27,718 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6be91e84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 09:10:27, skipping insertion in model container [2025-02-08 09:10:27,718 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:10:22" (2/3) ... [2025-02-08 09:10:27,718 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6be91e84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 09:10:27, skipping insertion in model container [2025-02-08 09:10:27,718 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 09:10:27" (3/3) ... [2025-02-08 09:10:27,719 INFO L128 eAbstractionObserver]: Analyzing ICFG ddv_machzwd_inw.i [2025-02-08 09:10:27,729 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 09:10:27,732 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG ddv_machzwd_inw.i that has 29 procedures, 345 locations, 1 initial locations, 4 loop locations, and 21 error locations. [2025-02-08 09:10:27,808 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 09:10:27,823 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;@6b7c5a64, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 09:10:27,823 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2025-02-08 09:10:27,827 INFO L276 IsEmpty]: Start isEmpty. Operand has 337 states, 225 states have (on average 1.4755555555555555) internal successors, (332), 258 states have internal predecessors, (332), 55 states have call successors, (55), 25 states have call predecessors, (55), 24 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2025-02-08 09:10:27,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-08 09:10:27,832 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:10:27,833 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:10:27,833 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-02-08 09:10:27,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:10:27,841 INFO L85 PathProgramCache]: Analyzing trace with hash 160667902, now seen corresponding path program 1 times [2025-02-08 09:10:27,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:10:27,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630397015] [2025-02-08 09:10:27,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:10:27,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:10:30,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 09:10:30,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 09:10:30,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:10:30,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:10:31,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:10:31,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:10:31,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630397015] [2025-02-08 09:10:31,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630397015] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:10:31,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:10:31,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 09:10:31,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228245670] [2025-02-08 09:10:31,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:10:31,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 09:10:31,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:10:31,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 09:10:31,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 09:10:31,099 INFO L87 Difference]: Start difference. First operand has 337 states, 225 states have (on average 1.4755555555555555) internal successors, (332), 258 states have internal predecessors, (332), 55 states have call successors, (55), 25 states have call predecessors, (55), 24 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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-02-08 09:10:32,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 09:10:35,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 09:10:35,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:10:35,697 INFO L93 Difference]: Finished difference Result 662 states and 883 transitions. [2025-02-08 09:10:35,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 09:10:35,700 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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 8 [2025-02-08 09:10:35,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:10:35,707 INFO L225 Difference]: With dead ends: 662 [2025-02-08 09:10:35,707 INFO L226 Difference]: Without dead ends: 208 [2025-02-08 09:10:35,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-02-08 09:10:35,715 INFO L435 NwaCegarLoop]: 413 mSDtfsCounter, 1 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1230 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-02-08 09:10:35,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1230 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-02-08 09:10:35,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2025-02-08 09:10:35,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2025-02-08 09:10:35,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 139 states have (on average 1.2517985611510791) internal successors, (174), 161 states have internal predecessors, (174), 39 states have call successors, (39), 18 states have call predecessors, (39), 13 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-02-08 09:10:35,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 242 transitions. [2025-02-08 09:10:35,765 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 242 transitions. Word has length 8 [2025-02-08 09:10:35,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:10:35,766 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 242 transitions. [2025-02-08 09:10:35,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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-02-08 09:10:35,767 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 242 transitions. [2025-02-08 09:10:35,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 09:10:35,767 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:10:35,767 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:10:35,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 09:10:35,768 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-02-08 09:10:35,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:10:35,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1864497657, now seen corresponding path program 1 times [2025-02-08 09:10:35,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:10:35,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476249053] [2025-02-08 09:10:35,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:10:35,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:10:37,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 09:10:37,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 09:10:37,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:10:37,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:10:38,353 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:10:38,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:10:38,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476249053] [2025-02-08 09:10:38,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476249053] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:10:38,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973877546] [2025-02-08 09:10:38,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:10:38,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:10:38,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:10:38,358 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 09:10:38,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 09:10:40,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 09:10:41,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 09:10:41,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:10:41,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:10:41,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 5607 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 09:10:41,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:10:41,210 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:10:41,210 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 09:10:41,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [973877546] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:10:41,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 09:10:41,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-02-08 09:10:41,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898168526] [2025-02-08 09:10:41,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:10:41,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 09:10:41,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:10:41,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 09:10:41,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-08 09:10:41,213 INFO L87 Difference]: Start difference. First operand 208 states and 242 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 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-02-08 09:10:42,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 09:10:47,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 09:10:49,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 09:10:49,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:10:49,590 INFO L93 Difference]: Finished difference Result 208 states and 242 transitions. [2025-02-08 09:10:49,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 09:10:49,591 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 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 11 [2025-02-08 09:10:49,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:10:49,592 INFO L225 Difference]: With dead ends: 208 [2025-02-08 09:10:49,592 INFO L226 Difference]: Without dead ends: 207 [2025-02-08 09:10:49,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-08 09:10:49,593 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 1 mSDsluCounter, 888 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1113 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2025-02-08 09:10:49,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1113 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 8.4s Time] [2025-02-08 09:10:49,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-02-08 09:10:49,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2025-02-08 09:10:49,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 139 states have (on average 1.2446043165467626) internal successors, (173), 160 states have internal predecessors, (173), 39 states have call successors, (39), 18 states have call predecessors, (39), 13 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-02-08 09:10:49,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 241 transitions. [2025-02-08 09:10:49,603 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 241 transitions. Word has length 11 [2025-02-08 09:10:49,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:10:49,603 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 241 transitions. [2025-02-08 09:10:49,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 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-02-08 09:10:49,603 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 241 transitions. [2025-02-08 09:10:49,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-08 09:10:49,604 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:10:49,604 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:10:49,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 09:10:49,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:10:49,805 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-02-08 09:10:49,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:10:49,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1964848187, now seen corresponding path program 1 times [2025-02-08 09:10:49,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:10:49,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220444593] [2025-02-08 09:10:49,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:10:49,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:10:51,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 09:10:51,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 09:10:51,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:10:51,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:10:51,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:10:51,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:10:51,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220444593] [2025-02-08 09:10:51,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220444593] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:10:51,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926314790] [2025-02-08 09:10:51,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:10:51,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:10:51,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:10:51,981 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 09:10:51,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 09:10:54,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 09:10:54,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 09:10:54,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:10:54,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:10:54,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 5618 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 09:10:54,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:10:54,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:10:54,942 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:10:54,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:10:54,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [926314790] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:10:54,979 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 09:10:54,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-02-08 09:10:54,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632371152] [2025-02-08 09:10:54,979 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 09:10:54,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 09:10:54,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:10:54,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 09:10:54,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-08 09:10:54,980 INFO L87 Difference]: Start difference. First operand 207 states and 241 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 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-02-08 09:10:57,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 09:10:58,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 09:10:59,557 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 09:11:01,635 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 09:11:02,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 09:11:02,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:11:02,919 INFO L93 Difference]: Finished difference Result 409 states and 477 transitions. [2025-02-08 09:11:02,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 09:11:02,919 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 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 12 [2025-02-08 09:11:02,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:11:02,923 INFO L225 Difference]: With dead ends: 409 [2025-02-08 09:11:02,923 INFO L226 Difference]: Without dead ends: 211 [2025-02-08 09:11:02,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-08 09:11:02,926 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 0 mSDsluCounter, 1114 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1341 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2025-02-08 09:11:02,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1341 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 7.9s Time] [2025-02-08 09:11:02,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-02-08 09:11:02,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2025-02-08 09:11:02,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 143 states have (on average 1.2377622377622377) internal successors, (177), 164 states have internal predecessors, (177), 39 states have call successors, (39), 18 states have call predecessors, (39), 13 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-02-08 09:11:02,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 245 transitions. [2025-02-08 09:11:02,937 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 245 transitions. Word has length 12 [2025-02-08 09:11:02,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:11:02,938 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 245 transitions. [2025-02-08 09:11:02,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 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-02-08 09:11:02,938 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 245 transitions. [2025-02-08 09:11:02,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-08 09:11:02,938 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:11:02,938 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:11:02,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 09:11:03,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:11:03,142 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-02-08 09:11:03,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:11:03,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1169378565, now seen corresponding path program 1 times [2025-02-08 09:11:03,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:11:03,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151286432] [2025-02-08 09:11:03,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:11:03,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:11:04,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 09:11:04,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 09:11:04,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:11:04,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:11:05,402 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-08 09:11:05,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:11:05,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151286432] [2025-02-08 09:11:05,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151286432] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:11:05,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:11:05,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 09:11:05,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611455921] [2025-02-08 09:11:05,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:11:05,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 09:11:05,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:11:05,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 09:11:05,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:11:05,404 INFO L87 Difference]: Start difference. First operand 211 states and 245 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-02-08 09:11:06,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 09:11:06,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:11:06,513 INFO L93 Difference]: Finished difference Result 211 states and 245 transitions. [2025-02-08 09:11:06,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 09:11:06,514 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 15 [2025-02-08 09:11:06,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:11:06,515 INFO L225 Difference]: With dead ends: 211 [2025-02-08 09:11:06,515 INFO L226 Difference]: Without dead ends: 210 [2025-02-08 09:11:06,515 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-02-08 09:11:06,521 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 0 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-08 09:11:06,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 453 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-08 09:11:06,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-02-08 09:11:06,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2025-02-08 09:11:06,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 143 states have (on average 1.2307692307692308) internal successors, (176), 163 states have internal predecessors, (176), 39 states have call successors, (39), 18 states have call predecessors, (39), 13 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-02-08 09:11:06,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 244 transitions. [2025-02-08 09:11:06,535 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 244 transitions. Word has length 15 [2025-02-08 09:11:06,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:11:06,536 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 244 transitions. [2025-02-08 09:11:06,536 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-02-08 09:11:06,536 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 244 transitions. [2025-02-08 09:11:06,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-08 09:11:06,536 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:11:06,536 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:11:06,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 09:11:06,536 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-02-08 09:11:06,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:11:06,538 INFO L85 PathProgramCache]: Analyzing trace with hash -476496293, now seen corresponding path program 2 times [2025-02-08 09:11:06,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:11:06,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530554761] [2025-02-08 09:11:06,538 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 09:11:06,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:11:08,265 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-02-08 09:11:08,344 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 18 statements. [2025-02-08 09:11:08,344 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 09:11:08,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:11:08,574 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 09:11:08,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:11:08,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530554761] [2025-02-08 09:11:08,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530554761] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:11:08,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:11:08,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 09:11:08,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786436311] [2025-02-08 09:11:08,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:11:08,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 09:11:08,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:11:08,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 09:11:08,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 09:11:08,575 INFO L87 Difference]: Start difference. First operand 210 states and 244 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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-02-08 09:11:11,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 09:11:13,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 09:11:13,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:11:13,441 INFO L93 Difference]: Finished difference Result 210 states and 244 transitions. [2025-02-08 09:11:13,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 09:11:13,442 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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 18 [2025-02-08 09:11:13,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:11:13,443 INFO L225 Difference]: With dead ends: 210 [2025-02-08 09:11:13,443 INFO L226 Difference]: Without dead ends: 209 [2025-02-08 09:11:13,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-02-08 09:11:13,444 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 1 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2025-02-08 09:11:13,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 664 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2025-02-08 09:11:13,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-02-08 09:11:13,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2025-02-08 09:11:13,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 143 states have (on average 1.2237762237762237) internal successors, (175), 162 states have internal predecessors, (175), 39 states have call successors, (39), 18 states have call predecessors, (39), 13 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-02-08 09:11:13,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 243 transitions. [2025-02-08 09:11:13,451 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 243 transitions. Word has length 18 [2025-02-08 09:11:13,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:11:13,451 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 243 transitions. [2025-02-08 09:11:13,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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-02-08 09:11:13,452 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 243 transitions. [2025-02-08 09:11:13,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-08 09:11:13,452 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:11:13,452 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:11:13,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 09:11:13,452 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-02-08 09:11:13,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:11:13,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1886482600, now seen corresponding path program 1 times [2025-02-08 09:11:13,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:11:13,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370976282] [2025-02-08 09:11:13,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:11:13,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:11:15,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 09:11:15,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 09:11:15,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:11:15,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:11:15,496 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 09:11:15,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:11:15,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370976282] [2025-02-08 09:11:15,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370976282] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:11:15,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:11:15,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 09:11:15,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280952206] [2025-02-08 09:11:15,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:11:15,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 09:11:15,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:11:15,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 09:11:15,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 09:11:15,497 INFO L87 Difference]: Start difference. First operand 209 states and 243 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 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-02-08 09:11:17,897 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 09:11:19,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 09:11:19,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:11:19,345 INFO L93 Difference]: Finished difference Result 212 states and 246 transitions. [2025-02-08 09:11:19,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 09:11:19,345 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 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 19 [2025-02-08 09:11:19,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:11:19,346 INFO L225 Difference]: With dead ends: 212 [2025-02-08 09:11:19,346 INFO L226 Difference]: Without dead ends: 211 [2025-02-08 09:11:19,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-02-08 09:11:19,347 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 0 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-02-08 09:11:19,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 667 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-02-08 09:11:19,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-02-08 09:11:19,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2025-02-08 09:11:19,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 145 states have (on average 1.2206896551724138) internal successors, (177), 164 states have internal predecessors, (177), 39 states have call successors, (39), 18 states have call predecessors, (39), 13 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-02-08 09:11:19,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 245 transitions. [2025-02-08 09:11:19,353 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 245 transitions. Word has length 19 [2025-02-08 09:11:19,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:11:19,353 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 245 transitions. [2025-02-08 09:11:19,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 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-02-08 09:11:19,353 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 245 transitions. [2025-02-08 09:11:19,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-08 09:11:19,354 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:11:19,354 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:11:19,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 09:11:19,354 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-02-08 09:11:19,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:11:19,354 INFO L85 PathProgramCache]: Analyzing trace with hash -555473699, now seen corresponding path program 1 times [2025-02-08 09:11:19,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:11:19,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251902182] [2025-02-08 09:11:19,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:11:19,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:11:21,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 09:11:21,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 09:11:21,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:11:21,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:11:21,514 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 09:11:21,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:11:21,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251902182] [2025-02-08 09:11:21,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251902182] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:11:21,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910257303] [2025-02-08 09:11:21,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:11:21,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:11:21,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:11:21,517 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 09:11:21,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 09:11:23,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 09:11:24,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 09:11:24,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:11:24,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:11:24,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 5684 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 09:11:24,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:11:24,170 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 09:11:24,170 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:11:24,278 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 09:11:24,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [910257303] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:11:24,279 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 09:11:24,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2025-02-08 09:11:24,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99945358] [2025-02-08 09:11:24,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 09:11:24,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-08 09:11:24,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:11:24,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-08 09:11:24,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2025-02-08 09:11:24,280 INFO L87 Difference]: Start difference. First operand 211 states and 245 transitions. Second operand has 19 states, 19 states have (on average 2.0) internal successors, (38), 19 states have internal predecessors, (38), 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-02-08 09:11:26,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 09:11:28,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 09:11:31,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 09:11:32,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 09:11:36,739 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 09:11:38,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 09:11:41,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 09:11:41,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:11:41,337 INFO L93 Difference]: Finished difference Result 418 states and 488 transitions. [2025-02-08 09:11:41,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-08 09:11:41,338 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.0) internal successors, (38), 19 states have internal predecessors, (38), 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-02-08 09:11:41,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:11:41,339 INFO L225 Difference]: With dead ends: 418 [2025-02-08 09:11:41,339 INFO L226 Difference]: Without dead ends: 220 [2025-02-08 09:11:41,340 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2025-02-08 09:11:41,340 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 0 mSDsluCounter, 1534 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1755 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:11:41,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1755 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 120 Invalid, 1 Unknown, 0 Unchecked, 17.0s Time] [2025-02-08 09:11:41,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-02-08 09:11:41,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2025-02-08 09:11:41,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 155 states have (on average 1.1935483870967742) internal successors, (185), 173 states have internal predecessors, (185), 39 states have call successors, (39), 18 states have call predecessors, (39), 13 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-02-08 09:11:41,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 253 transitions. [2025-02-08 09:11:41,352 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 253 transitions. Word has length 22 [2025-02-08 09:11:41,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:11:41,353 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 253 transitions. [2025-02-08 09:11:41,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.0) internal successors, (38), 19 states have internal predecessors, (38), 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-02-08 09:11:41,353 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 253 transitions. [2025-02-08 09:11:41,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-08 09:11:41,354 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:11:41,354 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 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-02-08 09:11:41,374 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 09:11:41,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:11:41,559 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting zf_readwErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-02-08 09:11:41,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:11:41,560 INFO L85 PathProgramCache]: Analyzing trace with hash 427593648, now seen corresponding path program 1 times [2025-02-08 09:11:41,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:11:41,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487905248] [2025-02-08 09:11:41,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:11:41,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:11:43,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 09:11:43,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 09:11:43,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:11:43,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:11:44,057 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2025-02-08 09:11:44,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:11:44,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487905248] [2025-02-08 09:11:44,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487905248] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:11:44,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:11:44,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 09:11:44,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416374015] [2025-02-08 09:11:44,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:11:44,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 09:11:44,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:11:44,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 09:11:44,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:11:44,059 INFO L87 Difference]: Start difference. First operand 220 states and 253 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 09:11:44,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:11:44,076 INFO L93 Difference]: Finished difference Result 220 states and 253 transitions. [2025-02-08 09:11:44,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 09:11:44,076 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2025-02-08 09:11:44,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:11:44,077 INFO L225 Difference]: With dead ends: 220 [2025-02-08 09:11:44,077 INFO L226 Difference]: Without dead ends: 213 [2025-02-08 09:11:44,078 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-02-08 09:11:44,078 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 214 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:11:44,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 223 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:11:44,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-02-08 09:11:44,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2025-02-08 09:11:44,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 153 states have (on average 1.1699346405228759) internal successors, (179), 167 states have internal predecessors, (179), 36 states have call successors, (36), 18 states have call predecessors, (36), 13 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-08 09:11:44,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 243 transitions. [2025-02-08 09:11:44,085 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 243 transitions. Word has length 46 [2025-02-08 09:11:44,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:11:44,085 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 243 transitions. [2025-02-08 09:11:44,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 09:11:44,085 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 243 transitions. [2025-02-08 09:11:44,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-08 09:11:44,086 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:11:44,086 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 09:11:44,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 09:11:44,086 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-02-08 09:11:44,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:11:44,087 INFO L85 PathProgramCache]: Analyzing trace with hash 886225357, now seen corresponding path program 1 times [2025-02-08 09:11:44,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:11:44,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291703332] [2025-02-08 09:11:44,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:11:44,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:11:45,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-08 09:11:45,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 09:11:45,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:11:45,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:11:46,217 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2025-02-08 09:11:46,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:11:46,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291703332] [2025-02-08 09:11:46,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291703332] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:11:46,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:11:46,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 09:11:46,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735213882] [2025-02-08 09:11:46,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:11:46,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 09:11:46,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:11:46,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 09:11:46,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:11:46,220 INFO L87 Difference]: Start difference. First operand 213 states and 243 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, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 09:11:46,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:11:46,245 INFO L93 Difference]: Finished difference Result 248 states and 280 transitions. [2025-02-08 09:11:46,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 09:11:46,246 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, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 55 [2025-02-08 09:11:46,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:11:46,247 INFO L225 Difference]: With dead ends: 248 [2025-02-08 09:11:46,247 INFO L226 Difference]: Without dead ends: 211 [2025-02-08 09:11:46,247 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-02-08 09:11:46,248 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 203 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:11:46,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 211 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:11:46,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-02-08 09:11:46,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2025-02-08 09:11:46,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 152 states have (on average 1.1513157894736843) internal successors, (175), 165 states have internal predecessors, (175), 36 states have call successors, (36), 18 states have call predecessors, (36), 13 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-08 09:11:46,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 239 transitions. [2025-02-08 09:11:46,260 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 239 transitions. Word has length 55 [2025-02-08 09:11:46,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:11:46,260 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 239 transitions. [2025-02-08 09:11:46,261 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, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 09:11:46,261 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 239 transitions. [2025-02-08 09:11:46,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-08 09:11:46,263 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:11:46,263 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 3, 3, 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, 1, 1, 1] [2025-02-08 09:11:46,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 09:11:46,264 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-02-08 09:11:46,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:11:46,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1959666610, now seen corresponding path program 1 times [2025-02-08 09:11:46,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:11:46,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714206343] [2025-02-08 09:11:46,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:11:46,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:11:47,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-08 09:11:48,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-08 09:11:48,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:11:48,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:11:48,317 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2025-02-08 09:11:48,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:11:48,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714206343] [2025-02-08 09:11:48,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714206343] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:11:48,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:11:48,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 09:11:48,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41125306] [2025-02-08 09:11:48,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:11:48,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 09:11:48,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:11:48,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 09:11:48,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 09:11:48,318 INFO L87 Difference]: Start difference. First operand 211 states and 239 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-08 09:11:48,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:11:48,349 INFO L93 Difference]: Finished difference Result 215 states and 242 transitions. [2025-02-08 09:11:48,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 09:11:48,349 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 74 [2025-02-08 09:11:48,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:11:48,350 INFO L225 Difference]: With dead ends: 215 [2025-02-08 09:11:48,350 INFO L226 Difference]: Without dead ends: 213 [2025-02-08 09:11:48,350 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-02-08 09:11:48,350 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 177 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:11:48,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 436 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:11:48,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-02-08 09:11:48,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2025-02-08 09:11:48,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 155 states have (on average 1.135483870967742) internal successors, (176), 166 states have internal predecessors, (176), 36 states have call successors, (36), 19 states have call predecessors, (36), 14 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-08 09:11:48,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 240 transitions. [2025-02-08 09:11:48,360 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 240 transitions. Word has length 74 [2025-02-08 09:11:48,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:11:48,361 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 240 transitions. [2025-02-08 09:11:48,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-08 09:11:48,361 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 240 transitions. [2025-02-08 09:11:48,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-08 09:11:48,362 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:11:48,363 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:11:48,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 09:11:48,363 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting zf_pingErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-02-08 09:11:48,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:11:48,363 INFO L85 PathProgramCache]: Analyzing trace with hash -625149697, now seen corresponding path program 1 times [2025-02-08 09:11:48,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:11:48,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818727367] [2025-02-08 09:11:48,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:11:48,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:11:50,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-08 09:11:50,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-08 09:11:50,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:11:50,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:11:51,021 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-08 09:11:51,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:11:51,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818727367] [2025-02-08 09:11:51,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818727367] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:11:51,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324411358] [2025-02-08 09:11:51,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:11:51,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:11:51,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:11:51,026 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 09:11:51,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 09:11:53,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-08 09:11:53,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-08 09:11:53,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:11:53,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:11:53,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 5931 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-08 09:11:53,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:11:53,738 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-08 09:11:53,738 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:11:54,014 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-08 09:11:54,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324411358] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:11:54,015 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 09:11:54,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-02-08 09:11:54,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650553426] [2025-02-08 09:11:54,015 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 09:11:54,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-08 09:11:54,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:11:54,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-08 09:11:54,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-02-08 09:11:54,016 INFO L87 Difference]: Start difference. First operand 213 states and 240 transitions. Second operand has 23 states, 23 states have (on average 3.739130434782609) internal successors, (86), 23 states have internal predecessors, (86), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-08 09:11:55,358 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 09:11:58,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []