./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 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ddv-machzwd/ddv_machzwd_inw.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6e6f79eda5be95b806b33aaa2a353a360ae33a1e35cc1bf6f128d14768d932de --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:42:58,193 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:42:58,242 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 10:42:58,247 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:42:58,247 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:42:58,259 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:42:58,260 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:42:58,260 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:42:58,260 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:42:58,260 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:42:58,261 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:42:58,261 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:42:58,261 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:42:58,261 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:42:58,261 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:42:58,261 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:42:58,261 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 10:42:58,261 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:42:58,262 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:42:58,262 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:42:58,262 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:42:58,262 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 10:42:58,262 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:42:58,262 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 10:42:58,262 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 10:42:58,262 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:42:58,262 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:42:58,262 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 10:42:58,262 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:42:58,262 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:42:58,263 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:42:58,263 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:42:58,263 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:42:58,263 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:42:58,263 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:42:58,263 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:42:58,263 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:42:58,263 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 10:42:58,263 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 10:42:58,263 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:42:58,263 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:42:58,263 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:42:58,264 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:42:58,264 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:42:58,264 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:42:58,264 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6e6f79eda5be95b806b33aaa2a353a360ae33a1e35cc1bf6f128d14768d932de [2025-03-04 10:42:58,472 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:42:58,477 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:42:58,479 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:42:58,479 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:42:58,479 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:42:58,480 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ddv-machzwd/ddv_machzwd_inw.i [2025-03-04 10:42:59,644 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66e18fde3/3dc15dc301e54650977f719b51f802f6/FLAG2bbc70395 [2025-03-04 10:43:00,027 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:43:00,028 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ddv-machzwd/ddv_machzwd_inw.i [2025-03-04 10:43:00,050 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66e18fde3/3dc15dc301e54650977f719b51f802f6/FLAG2bbc70395 [2025-03-04 10:43:00,214 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66e18fde3/3dc15dc301e54650977f719b51f802f6 [2025-03-04 10:43:00,220 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:43:00,223 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:43:00,223 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:43:00,224 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:43:00,227 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:43:00,227 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:43:00" (1/1) ... [2025-03-04 10:43:00,228 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3717b099 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:43:00, skipping insertion in model container [2025-03-04 10:43:00,228 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:43:00" (1/1) ... [2025-03-04 10:43:00,277 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:43:00,927 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:43:00,969 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:43:01,125 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:43:01,292 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:43:01,293 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:43:01 WrapperNode [2025-03-04 10:43:01,294 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:43:01,295 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:43:01,296 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:43:01,297 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:43:01,302 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:43:01" (1/1) ... [2025-03-04 10:43:01,348 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:43:01" (1/1) ... [2025-03-04 10:43:01,497 INFO L138 Inliner]: procedures = 473, calls = 2667, calls flagged for inlining = 55, calls inlined = 39, statements flattened = 3372 [2025-03-04 10:43:01,502 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:43:01,504 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:43:01,505 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:43:01,505 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:43:01,514 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:43:01" (1/1) ... [2025-03-04 10:43:01,515 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:43:01" (1/1) ... [2025-03-04 10:43:01,540 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:43:01" (1/1) ... [2025-03-04 10:43:01,606 INFO L175 MemorySlicer]: Split 2024 memory accesses to 27 slices as follows [5, 3, 35, 5, 1040, 480, 59, 35, 11, 5, 15, 120, 67, 37, 16, 2, 2, 2, 20, 4, 2, 12, 18, 0, 3, 21, 5]. 51 percent of accesses are in the largest equivalence class. The 1901 initializations are split as follows [3, 3, 15, 4, 1040, 480, 59, 32, 2, 1, 10, 120, 67, 25, 5, 0, 0, 2, 4, 4, 0, 6, 18, 0, 0, 0, 1]. The 58 writes are split as follows [0, 0, 6, 0, 0, 0, 0, 0, 5, 1, 2, 0, 0, 0, 8, 2, 1, 0, 4, 0, 0, 6, 0, 0, 0, 21, 2]. [2025-03-04 10:43:01,606 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:43:01" (1/1) ... [2025-03-04 10:43:01,606 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:43:01" (1/1) ... [2025-03-04 10:43:01,663 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:43:01" (1/1) ... [2025-03-04 10:43:01,670 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:43:01" (1/1) ... [2025-03-04 10:43:01,680 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:43:01" (1/1) ... [2025-03-04 10:43:01,691 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:43:01" (1/1) ... [2025-03-04 10:43:01,712 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:43:01,713 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:43:01,713 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:43:01,713 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:43:01,715 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:43:01" (1/1) ... [2025-03-04 10:43:01,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:43:01,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:43:01,741 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 10:43:01,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 10:43:01,760 INFO L130 BoogieDeclarations]: Found specification of procedure zf_timer_off [2025-03-04 10:43:01,760 INFO L138 BoogieDeclarations]: Found implementation of procedure zf_timer_off [2025-03-04 10:43:01,761 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 10:43:01,761 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_atomic_begin [2025-03-04 10:43:01,761 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2025-03-04 10:43:01,761 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2025-03-04 10:43:01,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 10:43:01,761 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2025-03-04 10:43:01,761 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2025-03-04 10:43:01,761 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 10:43:01,761 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_atomic_end [2025-03-04 10:43:01,762 INFO L130 BoogieDeclarations]: Found specification of procedure zf_get_control [2025-03-04 10:43:01,762 INFO L138 BoogieDeclarations]: Found implementation of procedure zf_get_control [2025-03-04 10:43:01,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-04 10:43:01,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-04 10:43:01,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-04 10:43:01,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-04 10:43:01,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-04 10:43:01,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-04 10:43:01,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-04 10:43:01,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-04 10:43:01,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-04 10:43:01,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-03-04 10:43:01,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-03-04 10:43:01,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-03-04 10:43:01,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-03-04 10:43:01,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-03-04 10:43:01,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-03-04 10:43:01,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-03-04 10:43:01,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-03-04 10:43:01,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-03-04 10:43:01,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-03-04 10:43:01,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#19 [2025-03-04 10:43:01,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#20 [2025-03-04 10:43:01,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#21 [2025-03-04 10:43:01,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#22 [2025-03-04 10:43:01,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#23 [2025-03-04 10:43:01,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#24 [2025-03-04 10:43:01,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#25 [2025-03-04 10:43:01,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#26 [2025-03-04 10:43:01,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 10:43:01,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 10:43:01,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 10:43:01,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 10:43:01,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 10:43:01,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 10:43:01,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 10:43:01,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-04 10:43:01,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-04 10:43:01,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-04 10:43:01,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-04 10:43:01,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-04 10:43:01,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-04 10:43:01,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-04 10:43:01,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-04 10:43:01,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-04 10:43:01,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-04 10:43:01,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-03-04 10:43:01,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-03-04 10:43:01,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-03-04 10:43:01,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#20 [2025-03-04 10:43:01,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#21 [2025-03-04 10:43:01,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#22 [2025-03-04 10:43:01,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#23 [2025-03-04 10:43:01,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#24 [2025-03-04 10:43:01,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#25 [2025-03-04 10:43:01,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#26 [2025-03-04 10:43:01,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 10:43:01,766 INFO L130 BoogieDeclarations]: Found specification of procedure request_region [2025-03-04 10:43:01,766 INFO L138 BoogieDeclarations]: Found implementation of procedure request_region [2025-03-04 10:43:01,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:43:01,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 10:43:01,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 10:43:01,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 10:43:01,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 10:43:01,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-04 10:43:01,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-04 10:43:01,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-04 10:43:01,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-04 10:43:01,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-04 10:43:01,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-04 10:43:01,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-04 10:43:01,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-04 10:43:01,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-04 10:43:01,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-04 10:43:01,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-04 10:43:01,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-03-04 10:43:01,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-03-04 10:43:01,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-03-04 10:43:01,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-03-04 10:43:01,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2025-03-04 10:43:01,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#20 [2025-03-04 10:43:01,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#21 [2025-03-04 10:43:01,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#22 [2025-03-04 10:43:01,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#23 [2025-03-04 10:43:01,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#24 [2025-03-04 10:43:01,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#25 [2025-03-04 10:43:01,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#26 [2025-03-04 10:43:01,767 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2025-03-04 10:43:01,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2025-03-04 10:43:01,767 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_irqsave [2025-03-04 10:43:01,767 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_irqsave [2025-03-04 10:43:01,767 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~TO~VOID [2025-03-04 10:43:01,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~TO~VOID [2025-03-04 10:43:01,767 INFO L130 BoogieDeclarations]: Found specification of procedure release_region [2025-03-04 10:43:01,767 INFO L138 BoogieDeclarations]: Found implementation of procedure release_region [2025-03-04 10:43:01,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:43:01,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:43:01,768 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_init [2025-03-04 10:43:01,768 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_init [2025-03-04 10:43:01,768 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 10:43:01,768 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 10:43:01,768 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer [2025-03-04 10:43:01,771 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer [2025-03-04 10:43:01,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 10:43:01,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 10:43:01,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 10:43:01,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 10:43:01,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 10:43:01,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-04 10:43:01,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-04 10:43:01,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-04 10:43:01,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-04 10:43:01,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-04 10:43:01,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-04 10:43:01,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-04 10:43:01,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-04 10:43:01,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-04 10:43:01,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-04 10:43:01,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-04 10:43:01,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-03-04 10:43:01,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-03-04 10:43:01,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-03-04 10:43:01,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-03-04 10:43:01,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2025-03-04 10:43:01,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#20 [2025-03-04 10:43:01,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#21 [2025-03-04 10:43:01,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#22 [2025-03-04 10:43:01,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#23 [2025-03-04 10:43:01,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#24 [2025-03-04 10:43:01,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#25 [2025-03-04 10:43:01,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#26 [2025-03-04 10:43:01,772 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2025-03-04 10:43:01,772 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2025-03-04 10:43:01,772 INFO L130 BoogieDeclarations]: Found specification of procedure cdev_add [2025-03-04 10:43:01,772 INFO L138 BoogieDeclarations]: Found implementation of procedure cdev_add [2025-03-04 10:43:01,772 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~$Pointer$~TO~int [2025-03-04 10:43:01,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~$Pointer$~TO~int [2025-03-04 10:43:01,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 10:43:01,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 10:43:01,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 10:43:01,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-04 10:43:01,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-04 10:43:01,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-04 10:43:01,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-04 10:43:01,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-04 10:43:01,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-04 10:43:01,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-04 10:43:01,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-04 10:43:01,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-03-04 10:43:01,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-03-04 10:43:01,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-03-04 10:43:01,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-03-04 10:43:01,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-03-04 10:43:01,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-03-04 10:43:01,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-03-04 10:43:01,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2025-03-04 10:43:01,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2025-03-04 10:43:01,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#20 [2025-03-04 10:43:01,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#21 [2025-03-04 10:43:01,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#22 [2025-03-04 10:43:01,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#23 [2025-03-04 10:43:01,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#24 [2025-03-04 10:43:01,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#25 [2025-03-04 10:43:01,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#26 [2025-03-04 10:43:01,773 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-03-04 10:43:01,773 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-03-04 10:43:01,773 INFO L130 BoogieDeclarations]: Found specification of procedure outw [2025-03-04 10:43:01,773 INFO L138 BoogieDeclarations]: Found implementation of procedure outw [2025-03-04 10:43:01,773 INFO L130 BoogieDeclarations]: Found specification of procedure outb [2025-03-04 10:43:01,773 INFO L138 BoogieDeclarations]: Found implementation of procedure outb [2025-03-04 10:43:01,773 INFO L130 BoogieDeclarations]: Found specification of procedure misc_deregister [2025-03-04 10:43:01,773 INFO L138 BoogieDeclarations]: Found implementation of procedure misc_deregister [2025-03-04 10:43:01,773 INFO L130 BoogieDeclarations]: Found specification of procedure assert_context_process [2025-03-04 10:43:01,773 INFO L138 BoogieDeclarations]: Found implementation of procedure assert_context_process [2025-03-04 10:43:01,773 INFO L130 BoogieDeclarations]: Found specification of procedure zf_set_control [2025-03-04 10:43:01,775 INFO L138 BoogieDeclarations]: Found implementation of procedure zf_set_control [2025-03-04 10:43:01,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 10:43:01,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 10:43:01,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 10:43:01,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 10:43:01,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 10:43:01,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 10:43:01,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 10:43:01,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-04 10:43:01,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-04 10:43:01,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-04 10:43:01,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-04 10:43:01,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-04 10:43:01,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-04 10:43:01,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-04 10:43:01,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-04 10:43:01,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-04 10:43:01,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-04 10:43:01,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-03-04 10:43:01,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-03-04 10:43:01,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-03-04 10:43:01,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#20 [2025-03-04 10:43:01,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#21 [2025-03-04 10:43:01,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#22 [2025-03-04 10:43:01,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#23 [2025-03-04 10:43:01,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#24 [2025-03-04 10:43:01,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#25 [2025-03-04 10:43:01,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#26 [2025-03-04 10:43:01,776 INFO L130 BoogieDeclarations]: Found specification of procedure zf_readw [2025-03-04 10:43:01,776 INFO L138 BoogieDeclarations]: Found implementation of procedure zf_readw [2025-03-04 10:43:01,776 INFO L130 BoogieDeclarations]: Found specification of procedure zf_ping [2025-03-04 10:43:01,776 INFO L138 BoogieDeclarations]: Found implementation of procedure zf_ping [2025-03-04 10:43:01,776 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~TO~int [2025-03-04 10:43:01,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~TO~int [2025-03-04 10:43:01,776 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2025-03-04 10:43:01,776 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2025-03-04 10:43:01,776 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2025-03-04 10:43:01,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2025-03-04 10:43:01,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:43:01,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 10:43:01,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 10:43:01,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 10:43:01,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 10:43:01,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 10:43:01,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 10:43:01,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-04 10:43:01,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-04 10:43:01,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-04 10:43:01,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-04 10:43:01,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-04 10:43:01,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-04 10:43:01,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-04 10:43:01,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-04 10:43:01,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-04 10:43:01,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-04 10:43:01,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-04 10:43:01,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-04 10:43:01,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-04 10:43:01,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#20 [2025-03-04 10:43:01,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#21 [2025-03-04 10:43:01,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#22 [2025-03-04 10:43:01,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#23 [2025-03-04 10:43:01,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#24 [2025-03-04 10:43:01,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#25 [2025-03-04 10:43:01,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#26 [2025-03-04 10:43:02,159 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:43:02,162 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:43:02,343 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3246: havoc get_user_#t~nondet671#1; [2025-03-04 10:43:02,357 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1508: havoc #t~ret200; [2025-03-04 10:43:02,395 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1470: havoc #t~ret199#1; [2025-03-04 10:43:02,395 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3965: havoc inw_#t~nondet754#1; [2025-03-04 10:43:02,487 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3262: havoc put_user_#t~nondet673#1; [2025-03-04 10:43:02,488 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3270: havoc copy_to_user_#t~nondet674#1; [2025-03-04 10:43:02,598 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4512: havoc test_and_set_bit_#t~bitwise795#1; [2025-03-04 10:43:02,599 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1705: havoc zf_open_#t~ret218#1; [2025-03-04 10:43:06,205 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3505: havoc misc_register_#t~ret713#1; [2025-03-04 10:43:06,329 INFO L? ?]: Removed 457 outVars from TransFormulas that were not future-live. [2025-03-04 10:43:06,330 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:43:06,353 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:43:06,353 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:43:06,353 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:43:06 BoogieIcfgContainer [2025-03-04 10:43:06,354 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:43:06,355 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:43:06,356 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:43:06,359 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:43:06,359 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:43:00" (1/3) ... [2025-03-04 10:43:06,360 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b871021 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:43:06, skipping insertion in model container [2025-03-04 10:43:06,360 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:43:01" (2/3) ... [2025-03-04 10:43:06,360 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b871021 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:43:06, skipping insertion in model container [2025-03-04 10:43:06,360 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:43:06" (3/3) ... [2025-03-04 10:43:06,361 INFO L128 eAbstractionObserver]: Analyzing ICFG ddv_machzwd_inw.i [2025-03-04 10:43:06,372 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:43:06,376 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG ddv_machzwd_inw.i that has 29 procedures, 430 locations, 1 initial locations, 4 loop locations, and 21 error locations. [2025-03-04 10:43:06,436 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:43:06,444 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;@17b03fbd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:43:06,444 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2025-03-04 10:43:06,448 INFO L276 IsEmpty]: Start isEmpty. Operand has 426 states, 300 states have (on average 1.41) internal successors, (423), 327 states have internal predecessors, (423), 78 states have call successors, (78), 26 states have call predecessors, (78), 26 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-04 10:43:06,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 10:43:06,452 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:43:06,452 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:43:06,453 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-03-04 10:43:06,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:43:06,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1481496859, now seen corresponding path program 1 times [2025-03-04 10:43:06,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:43:06,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277556942] [2025-03-04 10:43:06,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:43:06,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:43:08,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 10:43:08,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 10:43:08,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:43:08,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:09,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:43:09,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:43:09,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277556942] [2025-03-04 10:43:09,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277556942] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:43:09,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:43:09,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:43:09,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621862786] [2025-03-04 10:43:09,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:43:09,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:43:09,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:43:09,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:43:09,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:43:09,554 INFO L87 Difference]: Start difference. First operand has 426 states, 300 states have (on average 1.41) internal successors, (423), 327 states have internal predecessors, (423), 78 states have call successors, (78), 26 states have call predecessors, (78), 26 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:43:09,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:43:09,703 INFO L93 Difference]: Finished difference Result 846 states and 1175 transitions. [2025-03-04 10:43:09,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:43:09,709 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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 9 [2025-03-04 10:43:09,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:43:09,720 INFO L225 Difference]: With dead ends: 846 [2025-03-04 10:43:09,720 INFO L226 Difference]: Without dead ends: 416 [2025-03-04 10:43:09,725 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-03-04 10:43:09,727 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 1 mSDsluCounter, 1100 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1655 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:43:09,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1655 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:43:09,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2025-03-04 10:43:09,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 416. [2025-03-04 10:43:09,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 295 states have (on average 1.3898305084745763) internal successors, (410), 320 states have internal predecessors, (410), 76 states have call successors, (76), 26 states have call predecessors, (76), 26 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2025-03-04 10:43:09,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 561 transitions. [2025-03-04 10:43:09,793 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 561 transitions. Word has length 9 [2025-03-04 10:43:09,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:43:09,794 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 561 transitions. [2025-03-04 10:43:09,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:43:09,795 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 561 transitions. [2025-03-04 10:43:09,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 10:43:09,795 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:43:09,795 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:43:09,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:43:09,796 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-03-04 10:43:09,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:43:09,797 INFO L85 PathProgramCache]: Analyzing trace with hash 189621468, now seen corresponding path program 1 times [2025-03-04 10:43:09,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:43:09,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498494999] [2025-03-04 10:43:09,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:43:09,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:43:11,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:43:11,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:43:11,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:43:11,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:12,321 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:43:12,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:43:12,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498494999] [2025-03-04 10:43:12,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498494999] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:43:12,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696488273] [2025-03-04 10:43:12,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:43:12,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:43:12,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:43:12,325 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:43:12,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 10:43:14,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:43:14,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:43:14,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:43:14,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:14,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 5617 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:43:14,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:43:14,989 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:43:14,989 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:43:14,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [696488273] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:43:14,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:43:14,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-04 10:43:14,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15342958] [2025-03-04 10:43:14,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:43:14,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:43:14,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:43:14,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:43:14,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:43:14,993 INFO L87 Difference]: Start difference. First operand 416 states and 561 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:43:15,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:43:15,116 INFO L93 Difference]: Finished difference Result 416 states and 561 transitions. [2025-03-04 10:43:15,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:43:15,117 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2025-03-04 10:43:15,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:43:15,120 INFO L225 Difference]: With dead ends: 416 [2025-03-04 10:43:15,120 INFO L226 Difference]: Without dead ends: 415 [2025-03-04 10:43:15,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 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-03-04 10:43:15,124 INFO L435 NwaCegarLoop]: 538 mSDtfsCounter, 1 mSDsluCounter, 2138 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2676 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:43:15,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2676 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:43:15,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2025-03-04 10:43:15,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 415. [2025-03-04 10:43:15,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 295 states have (on average 1.3864406779661016) internal successors, (409), 319 states have internal predecessors, (409), 76 states have call successors, (76), 26 states have call predecessors, (76), 26 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2025-03-04 10:43:15,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 560 transitions. [2025-03-04 10:43:15,157 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 560 transitions. Word has length 12 [2025-03-04 10:43:15,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:43:15,157 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 560 transitions. [2025-03-04 10:43:15,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:43:15,157 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 560 transitions. [2025-03-04 10:43:15,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 10:43:15,157 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:43:15,157 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:43:15,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 10:43:15,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:43:15,358 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-03-04 10:43:15,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:43:15,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1583293880, now seen corresponding path program 1 times [2025-03-04 10:43:15,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:43:15,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583207620] [2025-03-04 10:43:15,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:43:15,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:43:17,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:43:17,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:43:17,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:43:17,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:17,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:43:17,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:43:17,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583207620] [2025-03-04 10:43:17,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583207620] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:43:17,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79600327] [2025-03-04 10:43:17,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:43:17,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:43:17,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:43:17,517 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:43:17,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 10:43:19,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:43:20,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:43:20,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:43:20,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:20,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 5628 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:43:20,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:43:20,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:43:20,119 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:43:20,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:43:20,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79600327] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:43:20,151 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:43:20,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-04 10:43:20,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049597149] [2025-03-04 10:43:20,151 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:43:20,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:43:20,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:43:20,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:43:20,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:43:20,152 INFO L87 Difference]: Start difference. First operand 415 states and 560 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:43:20,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:43:20,279 INFO L93 Difference]: Finished difference Result 824 states and 1114 transitions. [2025-03-04 10:43:20,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:43:20,280 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2025-03-04 10:43:20,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:43:20,282 INFO L225 Difference]: With dead ends: 824 [2025-03-04 10:43:20,282 INFO L226 Difference]: Without dead ends: 419 [2025-03-04 10:43:20,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 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-03-04 10:43:20,283 INFO L435 NwaCegarLoop]: 540 mSDtfsCounter, 0 mSDsluCounter, 3747 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4287 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:43:20,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4287 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:43:20,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2025-03-04 10:43:20,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2025-03-04 10:43:20,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 299 states have (on average 1.3812709030100334) internal successors, (413), 323 states have internal predecessors, (413), 76 states have call successors, (76), 26 states have call predecessors, (76), 26 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2025-03-04 10:43:20,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 564 transitions. [2025-03-04 10:43:20,305 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 564 transitions. Word has length 13 [2025-03-04 10:43:20,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:43:20,306 INFO L471 AbstractCegarLoop]: Abstraction has 419 states and 564 transitions. [2025-03-04 10:43:20,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:43:20,306 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 564 transitions. [2025-03-04 10:43:20,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 10:43:20,306 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:43:20,306 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:43:20,321 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 10:43:20,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-04 10:43:20,507 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-03-04 10:43:20,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:43:20,507 INFO L85 PathProgramCache]: Analyzing trace with hash 725679198, now seen corresponding path program 1 times [2025-03-04 10:43:20,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:43:20,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487905248] [2025-03-04 10:43:20,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:43:20,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:43:22,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:43:22,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:43:22,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:43:22,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:22,558 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:43:22,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:43:22,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487905248] [2025-03-04 10:43:22,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487905248] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:43:22,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:43:22,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:43:22,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333637894] [2025-03-04 10:43:22,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:43:22,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:43:22,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:43:22,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:43:22,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:43:22,560 INFO L87 Difference]: Start difference. First operand 419 states and 564 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:43:22,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:43:22,622 INFO L93 Difference]: Finished difference Result 419 states and 564 transitions. [2025-03-04 10:43:22,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:43:22,622 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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 16 [2025-03-04 10:43:22,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:43:22,625 INFO L225 Difference]: With dead ends: 419 [2025-03-04 10:43:22,625 INFO L226 Difference]: Without dead ends: 418 [2025-03-04 10:43:22,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:43:22,626 INFO L435 NwaCegarLoop]: 541 mSDtfsCounter, 0 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:43:22,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1079 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:43:22,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2025-03-04 10:43:22,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 418. [2025-03-04 10:43:22,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 299 states have (on average 1.3779264214046822) internal successors, (412), 322 states have internal predecessors, (412), 76 states have call successors, (76), 26 states have call predecessors, (76), 26 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2025-03-04 10:43:22,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 563 transitions. [2025-03-04 10:43:22,646 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 563 transitions. Word has length 16 [2025-03-04 10:43:22,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:43:22,646 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 563 transitions. [2025-03-04 10:43:22,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:43:22,647 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 563 transitions. [2025-03-04 10:43:22,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-04 10:43:22,647 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:43:22,647 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:43:22,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:43:22,648 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-03-04 10:43:22,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:43:22,648 INFO L85 PathProgramCache]: Analyzing trace with hash 2139214360, now seen corresponding path program 2 times [2025-03-04 10:43:22,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:43:22,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26281794] [2025-03-04 10:43:22,648 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:43:22,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:43:24,484 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-04 10:43:24,524 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 19 statements. [2025-03-04 10:43:24,525 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:43:24,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:24,826 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 10:43:24,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:43:24,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26281794] [2025-03-04 10:43:24,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26281794] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:43:24,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:43:24,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:43:24,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634616277] [2025-03-04 10:43:24,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:43:24,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:43:24,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:43:24,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:43:24,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:43:24,829 INFO L87 Difference]: Start difference. First operand 418 states and 563 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-03-04 10:43:24,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:43:24,891 INFO L93 Difference]: Finished difference Result 422 states and 567 transitions. [2025-03-04 10:43:24,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:43:24,891 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-03-04 10:43:24,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:43:24,893 INFO L225 Difference]: With dead ends: 422 [2025-03-04 10:43:24,893 INFO L226 Difference]: Without dead ends: 420 [2025-03-04 10:43:24,894 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-03-04 10:43:24,894 INFO L435 NwaCegarLoop]: 539 mSDtfsCounter, 1 mSDsluCounter, 1068 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1607 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:43:24,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1607 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:43:24,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2025-03-04 10:43:24,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 420. [2025-03-04 10:43:24,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 301 states have (on average 1.3754152823920265) internal successors, (414), 324 states have internal predecessors, (414), 76 states have call successors, (76), 26 states have call predecessors, (76), 26 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2025-03-04 10:43:24,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 565 transitions. [2025-03-04 10:43:24,913 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 565 transitions. Word has length 19 [2025-03-04 10:43:24,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:43:24,913 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 565 transitions. [2025-03-04 10:43:24,913 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-03-04 10:43:24,914 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 565 transitions. [2025-03-04 10:43:24,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 10:43:24,914 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:43:24,914 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:43:24,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:43:24,914 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-04 10:43:24,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:43:24,915 INFO L85 PathProgramCache]: Analyzing trace with hash 610882456, now seen corresponding path program 1 times [2025-03-04 10:43:24,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:43:24,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713542632] [2025-03-04 10:43:24,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:43:24,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:43:26,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 10:43:26,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:43:26,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:43:26,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:27,043 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 10:43:27,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:43:27,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713542632] [2025-03-04 10:43:27,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713542632] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:43:27,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121357131] [2025-03-04 10:43:27,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:43:27,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:43:27,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:43:27,045 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:43:27,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 10:43:29,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 10:43:29,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:43:29,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:43:29,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:29,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 5693 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:43:29,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:43:29,618 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:43:29,619 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:43:29,697 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:43:29,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1121357131] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:43:29,697 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:43:29,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2025-03-04 10:43:29,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127362255] [2025-03-04 10:43:29,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:43:29,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 10:43:29,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:43:29,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 10:43:29,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2025-03-04 10:43:29,699 INFO L87 Difference]: Start difference. First operand 420 states and 565 transitions. Second operand has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:43:29,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:43:29,839 INFO L93 Difference]: Finished difference Result 834 states and 1126 transitions. [2025-03-04 10:43:29,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 10:43:29,840 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2025-03-04 10:43:29,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:43:29,842 INFO L225 Difference]: With dead ends: 834 [2025-03-04 10:43:29,842 INFO L226 Difference]: Without dead ends: 428 [2025-03-04 10:43:29,843 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-03-04 10:43:29,847 INFO L435 NwaCegarLoop]: 534 mSDtfsCounter, 0 mSDsluCounter, 3718 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4252 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:43:29,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4252 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:43:29,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2025-03-04 10:43:29,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 428. [2025-03-04 10:43:29,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 311 states have (on average 1.3536977491961415) internal successors, (421), 332 states have internal predecessors, (421), 76 states have call successors, (76), 26 states have call predecessors, (76), 26 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2025-03-04 10:43:29,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 572 transitions. [2025-03-04 10:43:29,867 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 572 transitions. Word has length 22 [2025-03-04 10:43:29,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:43:29,867 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 572 transitions. [2025-03-04 10:43:29,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:43:29,867 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 572 transitions. [2025-03-04 10:43:29,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-04 10:43:29,868 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:43:29,869 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] [2025-03-04 10:43:29,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 10:43:30,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:43:30,069 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting zf_readwErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-04 10:43:30,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:43:30,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1693122458, now seen corresponding path program 1 times [2025-03-04 10:43:30,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:43:30,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463796046] [2025-03-04 10:43:30,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:43:30,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:43:31,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 10:43:31,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 10:43:31,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:43:31,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:32,250 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2025-03-04 10:43:32,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:43:32,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463796046] [2025-03-04 10:43:32,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463796046] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:43:32,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:43:32,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:43:32,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312165286] [2025-03-04 10:43:32,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:43:32,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:43:32,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:43:32,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:43:32,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:43:32,252 INFO L87 Difference]: Start difference. First operand 428 states and 572 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 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-03-04 10:43:32,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:43:32,318 INFO L93 Difference]: Finished difference Result 750 states and 1012 transitions. [2025-03-04 10:43:32,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:43:32,318 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 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 49 [2025-03-04 10:43:32,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:43:32,321 INFO L225 Difference]: With dead ends: 750 [2025-03-04 10:43:32,321 INFO L226 Difference]: Without dead ends: 746 [2025-03-04 10:43:32,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:43:32,326 INFO L435 NwaCegarLoop]: 569 mSDtfsCounter, 499 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 1023 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:43:32,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 1023 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:43:32,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2025-03-04 10:43:32,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 740. [2025-03-04 10:43:32,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 543 states have (on average 1.3627992633517496) internal successors, (740), 568 states have internal predecessors, (740), 134 states have call successors, (134), 48 states have call predecessors, (134), 48 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2025-03-04 10:43:32,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1007 transitions. [2025-03-04 10:43:32,357 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1007 transitions. Word has length 49 [2025-03-04 10:43:32,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:43:32,359 INFO L471 AbstractCegarLoop]: Abstraction has 740 states and 1007 transitions. [2025-03-04 10:43:32,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 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-03-04 10:43:32,359 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1007 transitions. [2025-03-04 10:43:32,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-04 10:43:32,361 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:43:32,361 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, 1, 1, 1] [2025-03-04 10:43:32,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 10:43:32,361 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-04 10:43:32,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:43:32,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1850039131, now seen corresponding path program 1 times [2025-03-04 10:43:32,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:43:32,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284262361] [2025-03-04 10:43:32,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:43:32,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:43:34,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-04 10:43:34,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 10:43:34,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:43:34,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:34,444 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2025-03-04 10:43:34,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:43:34,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284262361] [2025-03-04 10:43:34,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284262361] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:43:34,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:43:34,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:43:34,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772230227] [2025-03-04 10:43:34,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:43:34,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:43:34,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:43:34,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:43:34,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:43:34,447 INFO L87 Difference]: Start difference. First operand 740 states and 1007 transitions. Second operand has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 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-03-04 10:43:34,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:43:34,491 INFO L93 Difference]: Finished difference Result 1437 states and 1963 transitions. [2025-03-04 10:43:34,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:43:34,492 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 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 58 [2025-03-04 10:43:34,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:43:34,496 INFO L225 Difference]: With dead ends: 1437 [2025-03-04 10:43:34,496 INFO L226 Difference]: Without dead ends: 738 [2025-03-04 10:43:34,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:43:34,498 INFO L435 NwaCegarLoop]: 534 mSDtfsCounter, 530 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 530 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:43:34,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [530 Valid, 534 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:43:34,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2025-03-04 10:43:34,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 738. [2025-03-04 10:43:34,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 542 states have (on average 1.3579335793357934) internal successors, (736), 566 states have internal predecessors, (736), 134 states have call successors, (134), 48 states have call predecessors, (134), 48 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2025-03-04 10:43:34,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1003 transitions. [2025-03-04 10:43:34,521 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1003 transitions. Word has length 58 [2025-03-04 10:43:34,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:43:34,522 INFO L471 AbstractCegarLoop]: Abstraction has 738 states and 1003 transitions. [2025-03-04 10:43:34,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 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-03-04 10:43:34,522 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1003 transitions. [2025-03-04 10:43:34,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-04 10:43:34,526 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:43:34,526 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] [2025-03-04 10:43:34,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 10:43:34,526 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-04 10:43:34,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:43:34,527 INFO L85 PathProgramCache]: Analyzing trace with hash -2098327459, now seen corresponding path program 1 times [2025-03-04 10:43:34,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:43:34,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934297182] [2025-03-04 10:43:34,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:43:34,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:43:36,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-04 10:43:36,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-04 10:43:36,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:43:36,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:36,626 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2025-03-04 10:43:36,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:43:36,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934297182] [2025-03-04 10:43:36,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934297182] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:43:36,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:43:36,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:43:36,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247865397] [2025-03-04 10:43:36,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:43:36,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:43:36,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:43:36,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:43:36,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:43:36,628 INFO L87 Difference]: Start difference. First operand 738 states and 1003 transitions. Second operand has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 4 states have internal predecessors, (40), 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-03-04 10:43:36,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:43:36,702 INFO L93 Difference]: Finished difference Result 1714 states and 2347 transitions. [2025-03-04 10:43:36,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:43:36,702 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 4 states have internal predecessors, (40), 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 78 [2025-03-04 10:43:36,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:43:36,708 INFO L225 Difference]: With dead ends: 1714 [2025-03-04 10:43:36,708 INFO L226 Difference]: Without dead ends: 1048 [2025-03-04 10:43:36,710 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-03-04 10:43:36,713 INFO L435 NwaCegarLoop]: 561 mSDtfsCounter, 444 mSDsluCounter, 1050 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 1611 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:43:36,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 1611 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:43:36,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2025-03-04 10:43:36,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 1042. [2025-03-04 10:43:36,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1042 states, 770 states have (on average 1.361038961038961) internal successors, (1048), 797 states have internal predecessors, (1048), 191 states have call successors, (191), 69 states have call predecessors, (191), 69 states have return successors, (190), 190 states have call predecessors, (190), 190 states have call successors, (190) [2025-03-04 10:43:36,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 1429 transitions. [2025-03-04 10:43:36,752 INFO L78 Accepts]: Start accepts. Automaton has 1042 states and 1429 transitions. Word has length 78 [2025-03-04 10:43:36,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:43:36,752 INFO L471 AbstractCegarLoop]: Abstraction has 1042 states and 1429 transitions. [2025-03-04 10:43:36,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 4 states have internal predecessors, (40), 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-03-04 10:43:36,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1042 states and 1429 transitions. [2025-03-04 10:43:36,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-04 10:43:36,753 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:43:36,754 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, 1, 1, 1, 1] [2025-03-04 10:43:36,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 10:43:36,754 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting zf_pingErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-04 10:43:36,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:43:36,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1376073993, now seen corresponding path program 1 times [2025-03-04 10:43:36,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:43:36,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131833358] [2025-03-04 10:43:36,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:43:36,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:43:38,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-04 10:43:38,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-04 10:43:38,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:43:38,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:39,492 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-04 10:43:39,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:43:39,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131833358] [2025-03-04 10:43:39,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131833358] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:43:39,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847435169] [2025-03-04 10:43:39,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:43:39,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:43:39,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:43:39,495 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:43:39,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 10:43:41,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-04 10:43:42,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-04 10:43:42,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:43:42,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:42,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 5941 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 10:43:42,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:43:42,127 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-04 10:43:42,127 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:43:42,305 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-04 10:43:42,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [847435169] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:43:42,305 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:43:42,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-03-04 10:43:42,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595767083] [2025-03-04 10:43:42,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:43:42,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 10:43:42,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:43:42,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 10:43:42,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-03-04 10:43:42,306 INFO L87 Difference]: Start difference. First operand 1042 states and 1429 transitions. Second operand has 23 states, 23 states have (on average 3.9565217391304346) internal successors, (91), 23 states have internal predecessors, (91), 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-03-04 10:43:42,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:43:42,434 INFO L93 Difference]: Finished difference Result 2067 states and 2842 transitions. [2025-03-04 10:43:42,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 10:43:42,434 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.9565217391304346) internal successors, (91), 23 states have internal predecessors, (91), 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) Word has length 87 [2025-03-04 10:43:42,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:43:42,439 INFO L225 Difference]: With dead ends: 2067 [2025-03-04 10:43:42,440 INFO L226 Difference]: Without dead ends: 1051 [2025-03-04 10:43:42,442 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 157 SyntacticMatches, 11 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-03-04 10:43:42,443 INFO L435 NwaCegarLoop]: 531 mSDtfsCounter, 0 mSDsluCounter, 3699 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4230 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:43:42,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4230 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:43:42,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2025-03-04 10:43:42,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 1051. [2025-03-04 10:43:42,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1051 states, 779 states have (on average 1.3568677792041077) internal successors, (1057), 806 states have internal predecessors, (1057), 191 states have call successors, (191), 69 states have call predecessors, (191), 69 states have return successors, (190), 190 states have call predecessors, (190), 190 states have call successors, (190) [2025-03-04 10:43:42,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 1438 transitions. [2025-03-04 10:43:42,477 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 1438 transitions. Word has length 87 [2025-03-04 10:43:42,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:43:42,477 INFO L471 AbstractCegarLoop]: Abstraction has 1051 states and 1438 transitions. [2025-03-04 10:43:42,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.9565217391304346) internal successors, (91), 23 states have internal predecessors, (91), 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-03-04 10:43:42,477 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1438 transitions. [2025-03-04 10:43:42,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-04 10:43:42,480 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:43:42,480 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 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, 1, 1, 1, 1] [2025-03-04 10:43:42,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 10:43:42,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:43:42,681 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-03-04 10:43:42,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:43:42,682 INFO L85 PathProgramCache]: Analyzing trace with hash 350455466, now seen corresponding path program 2 times [2025-03-04 10:43:42,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:43:42,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226393339] [2025-03-04 10:43:42,682 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:43:42,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:43:44,440 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 96 statements into 2 equivalence classes. [2025-03-04 10:43:44,483 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 37 of 96 statements. [2025-03-04 10:43:44,484 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:43:44,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:44,730 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2025-03-04 10:43:44,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:43:44,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226393339] [2025-03-04 10:43:44,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226393339] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:43:44,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:43:44,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:43:44,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984265463] [2025-03-04 10:43:44,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:43:44,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:43:44,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:43:44,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:43:44,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:43:44,732 INFO L87 Difference]: Start difference. First operand 1051 states and 1438 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 10:43:44,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:43:44,793 INFO L93 Difference]: Finished difference Result 1076 states and 1456 transitions. [2025-03-04 10:43:44,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:43:44,793 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 96 [2025-03-04 10:43:44,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:43:44,798 INFO L225 Difference]: With dead ends: 1076 [2025-03-04 10:43:44,798 INFO L226 Difference]: Without dead ends: 762 [2025-03-04 10:43:44,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:43:44,800 INFO L435 NwaCegarLoop]: 533 mSDtfsCounter, 0 mSDsluCounter, 1592 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2125 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:43:44,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2125 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:43:44,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2025-03-04 10:43:44,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 762. [2025-03-04 10:43:44,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 762 states, 565 states have (on average 1.3380530973451328) internal successors, (756), 587 states have internal predecessors, (756), 134 states have call successors, (134), 51 states have call predecessors, (134), 51 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2025-03-04 10:43:44,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 1023 transitions. [2025-03-04 10:43:44,827 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 1023 transitions. Word has length 96 [2025-03-04 10:43:44,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:43:44,828 INFO L471 AbstractCegarLoop]: Abstraction has 762 states and 1023 transitions. [2025-03-04 10:43:44,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 10:43:44,828 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 1023 transitions. [2025-03-04 10:43:44,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-04 10:43:44,831 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:43:44,831 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:43:44,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 10:43:44,832 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-04 10:43:44,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:43:44,832 INFO L85 PathProgramCache]: Analyzing trace with hash 534190558, now seen corresponding path program 1 times [2025-03-04 10:43:44,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:43:44,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582252261] [2025-03-04 10:43:44,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:43:44,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:43:46,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 10:43:46,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 10:43:46,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:43:46,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:47,032 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2025-03-04 10:43:47,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:43:47,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582252261] [2025-03-04 10:43:47,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582252261] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:43:47,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:43:47,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:43:47,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040938398] [2025-03-04 10:43:47,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:43:47,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:43:47,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:43:47,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:43:47,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:43:47,035 INFO L87 Difference]: Start difference. First operand 762 states and 1023 transitions. Second operand has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 10:43:47,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:43:47,117 INFO L93 Difference]: Finished difference Result 1732 states and 2311 transitions. [2025-03-04 10:43:47,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:43:47,117 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 100 [2025-03-04 10:43:47,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:43:47,122 INFO L225 Difference]: With dead ends: 1732 [2025-03-04 10:43:47,122 INFO L226 Difference]: Without dead ends: 1056 [2025-03-04 10:43:47,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:43:47,124 INFO L435 NwaCegarLoop]: 578 mSDtfsCounter, 235 mSDsluCounter, 1049 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 1627 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:43:47,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 1627 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:43:47,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2025-03-04 10:43:47,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 1050. [2025-03-04 10:43:47,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1050 states, 767 states have (on average 1.303780964797914) internal successors, (1000), 790 states have internal predecessors, (1000), 190 states have call successors, (190), 83 states have call predecessors, (190), 83 states have return successors, (188), 188 states have call predecessors, (188), 187 states have call successors, (188) [2025-03-04 10:43:47,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 1378 transitions. [2025-03-04 10:43:47,156 INFO L78 Accepts]: Start accepts. Automaton has 1050 states and 1378 transitions. Word has length 100 [2025-03-04 10:43:47,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:43:47,157 INFO L471 AbstractCegarLoop]: Abstraction has 1050 states and 1378 transitions. [2025-03-04 10:43:47,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 10:43:47,157 INFO L276 IsEmpty]: Start isEmpty. Operand 1050 states and 1378 transitions. [2025-03-04 10:43:47,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-04 10:43:47,159 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:43:47,159 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:43:47,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 10:43:47,159 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-04 10:43:47,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:43:47,160 INFO L85 PathProgramCache]: Analyzing trace with hash 107375862, now seen corresponding path program 1 times [2025-03-04 10:43:47,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:43:47,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462382427] [2025-03-04 10:43:47,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:43:47,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:43:49,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-04 10:43:49,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-04 10:43:49,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:43:49,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:49,938 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2025-03-04 10:43:49,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:43:49,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462382427] [2025-03-04 10:43:49,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462382427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:43:49,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:43:49,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:43:49,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707725588] [2025-03-04 10:43:49,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:43:49,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:43:49,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:43:49,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:43:49,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:43:49,944 INFO L87 Difference]: Start difference. First operand 1050 states and 1378 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-04 10:43:51,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 10:43:51,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:43:51,609 INFO L93 Difference]: Finished difference Result 2016 states and 2665 transitions. [2025-03-04 10:43:51,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:43:51,609 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 135 [2025-03-04 10:43:51,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:43:51,617 INFO L225 Difference]: With dead ends: 2016 [2025-03-04 10:43:51,617 INFO L226 Difference]: Without dead ends: 1050 [2025-03-04 10:43:51,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:43:51,620 INFO L435 NwaCegarLoop]: 521 mSDtfsCounter, 511 mSDsluCounter, 887 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 1408 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-04 10:43:51,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 1408 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-04 10:43:51,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1050 states. [2025-03-04 10:43:51,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1050 to 1050. [2025-03-04 10:43:51,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1050 states, 767 states have (on average 1.3011734028683182) internal successors, (998), 790 states have internal predecessors, (998), 190 states have call successors, (190), 83 states have call predecessors, (190), 83 states have return successors, (188), 188 states have call predecessors, (188), 187 states have call successors, (188) [2025-03-04 10:43:51,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 1376 transitions. [2025-03-04 10:43:51,660 INFO L78 Accepts]: Start accepts. Automaton has 1050 states and 1376 transitions. Word has length 135 [2025-03-04 10:43:51,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:43:51,660 INFO L471 AbstractCegarLoop]: Abstraction has 1050 states and 1376 transitions. [2025-03-04 10:43:51,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-04 10:43:51,661 INFO L276 IsEmpty]: Start isEmpty. Operand 1050 states and 1376 transitions. [2025-03-04 10:43:51,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-04 10:43:51,662 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:43:51,662 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:43:51,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 10:43:51,662 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-04 10:43:51,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:43:51,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1703441654, now seen corresponding path program 1 times [2025-03-04 10:43:51,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:43:51,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006144637] [2025-03-04 10:43:51,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:43:51,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:43:53,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-04 10:43:53,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-04 10:43:53,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:43:53,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:54,102 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2025-03-04 10:43:54,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:43:54,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006144637] [2025-03-04 10:43:54,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006144637] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:43:54,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:43:54,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:43:54,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664192949] [2025-03-04 10:43:54,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:43:54,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:43:54,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:43:54,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:43:54,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:43:54,104 INFO L87 Difference]: Start difference. First operand 1050 states and 1376 transitions. Second operand has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 10:43:54,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:43:54,197 INFO L93 Difference]: Finished difference Result 1940 states and 2562 transitions. [2025-03-04 10:43:54,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:43:54,198 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 137 [2025-03-04 10:43:54,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:43:54,205 INFO L225 Difference]: With dead ends: 1940 [2025-03-04 10:43:54,205 INFO L226 Difference]: Without dead ends: 1492 [2025-03-04 10:43:54,207 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-03-04 10:43:54,208 INFO L435 NwaCegarLoop]: 519 mSDtfsCounter, 484 mSDsluCounter, 940 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 1459 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:43:54,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 1459 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:43:54,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1492 states. [2025-03-04 10:43:54,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1492 to 1484. [2025-03-04 10:43:54,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1484 states, 1085 states have (on average 1.3096774193548386) internal successors, (1421), 1114 states have internal predecessors, (1421), 273 states have call successors, (273), 119 states have call predecessors, (273), 118 states have return successors, (268), 268 states have call predecessors, (268), 267 states have call successors, (268) [2025-03-04 10:43:54,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1484 states to 1484 states and 1962 transitions. [2025-03-04 10:43:54,273 INFO L78 Accepts]: Start accepts. Automaton has 1484 states and 1962 transitions. Word has length 137 [2025-03-04 10:43:54,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:43:54,273 INFO L471 AbstractCegarLoop]: Abstraction has 1484 states and 1962 transitions. [2025-03-04 10:43:54,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 10:43:54,274 INFO L276 IsEmpty]: Start isEmpty. Operand 1484 states and 1962 transitions. [2025-03-04 10:43:54,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-04 10:43:54,277 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:43:54,278 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:43:54,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 10:43:54,278 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting zf_pingErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-04 10:43:54,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:43:54,278 INFO L85 PathProgramCache]: Analyzing trace with hash 198097254, now seen corresponding path program 1 times [2025-03-04 10:43:54,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:43:54,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116265512] [2025-03-04 10:43:54,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:43:54,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:43:56,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-04 10:43:56,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-04 10:43:56,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:43:56,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:56,941 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2025-03-04 10:43:56,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:43:56,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116265512] [2025-03-04 10:43:56,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116265512] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:43:56,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:43:56,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:43:56,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240241896] [2025-03-04 10:43:56,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:43:56,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:43:56,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:43:56,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:43:56,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:43:56,944 INFO L87 Difference]: Start difference. First operand 1484 states and 1962 transitions. Second operand has 3 states, 2 states have (on average 34.0) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-04 10:43:57,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:43:57,068 INFO L93 Difference]: Finished difference Result 3852 states and 5211 transitions. [2025-03-04 10:43:57,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:43:57,069 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 34.0) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 138 [2025-03-04 10:43:57,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:43:57,084 INFO L225 Difference]: With dead ends: 3852 [2025-03-04 10:43:57,084 INFO L226 Difference]: Without dead ends: 2472 [2025-03-04 10:43:57,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:43:57,090 INFO L435 NwaCegarLoop]: 548 mSDtfsCounter, 425 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 959 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:43:57,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 959 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:43:57,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2472 states. [2025-03-04 10:43:57,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2472 to 2321. [2025-03-04 10:43:57,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2321 states, 1712 states have (on average 1.338785046728972) internal successors, (2292), 1754 states have internal predecessors, (2292), 420 states have call successors, (420), 187 states have call predecessors, (420), 181 states have return successors, (421), 405 states have call predecessors, (421), 408 states have call successors, (421) [2025-03-04 10:43:57,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2321 states to 2321 states and 3133 transitions. [2025-03-04 10:43:57,180 INFO L78 Accepts]: Start accepts. Automaton has 2321 states and 3133 transitions. Word has length 138 [2025-03-04 10:43:57,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:43:57,180 INFO L471 AbstractCegarLoop]: Abstraction has 2321 states and 3133 transitions. [2025-03-04 10:43:57,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 34.0) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-04 10:43:57,181 INFO L276 IsEmpty]: Start isEmpty. Operand 2321 states and 3133 transitions. [2025-03-04 10:43:57,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-04 10:43:57,184 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:43:57,184 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:43:57,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 10:43:57,185 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting zf_readwErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-04 10:43:57,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:43:57,185 INFO L85 PathProgramCache]: Analyzing trace with hash 2042323241, now seen corresponding path program 1 times [2025-03-04 10:43:57,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:43:57,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541748363] [2025-03-04 10:43:57,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:43:57,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:43:58,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-04 10:43:59,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 10:43:59,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:43:59,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:59,377 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2025-03-04 10:43:59,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:43:59,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541748363] [2025-03-04 10:43:59,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541748363] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:43:59,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:43:59,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:43:59,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088346246] [2025-03-04 10:43:59,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:43:59,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:43:59,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:43:59,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:43:59,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:43:59,379 INFO L87 Difference]: Start difference. First operand 2321 states and 3133 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 10:43:59,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:43:59,446 INFO L93 Difference]: Finished difference Result 2476 states and 3308 transitions. [2025-03-04 10:43:59,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:43:59,447 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 155 [2025-03-04 10:43:59,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:43:59,455 INFO L225 Difference]: With dead ends: 2476 [2025-03-04 10:43:59,455 INFO L226 Difference]: Without dead ends: 1663 [2025-03-04 10:43:59,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:43:59,459 INFO L435 NwaCegarLoop]: 518 mSDtfsCounter, 0 mSDsluCounter, 1031 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1549 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:43:59,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1549 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:43:59,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1663 states. [2025-03-04 10:43:59,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1663 to 1663. [2025-03-04 10:43:59,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1663 states, 1224 states have (on average 1.3218954248366013) internal successors, (1618), 1254 states have internal predecessors, (1618), 296 states have call successors, (296), 138 states have call predecessors, (296), 135 states have return successors, (298), 288 states have call predecessors, (298), 289 states have call successors, (298) [2025-03-04 10:43:59,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1663 states to 1663 states and 2212 transitions. [2025-03-04 10:43:59,519 INFO L78 Accepts]: Start accepts. Automaton has 1663 states and 2212 transitions. Word has length 155 [2025-03-04 10:43:59,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:43:59,521 INFO L471 AbstractCegarLoop]: Abstraction has 1663 states and 2212 transitions. [2025-03-04 10:43:59,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 10:43:59,521 INFO L276 IsEmpty]: Start isEmpty. Operand 1663 states and 2212 transitions. [2025-03-04 10:43:59,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-04 10:43:59,523 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:43:59,524 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:43:59,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 10:43:59,524 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ##fun~$Pointer$~X~$Pointer$~TO~intErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-04 10:43:59,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:43:59,525 INFO L85 PathProgramCache]: Analyzing trace with hash 475599511, now seen corresponding path program 1 times [2025-03-04 10:43:59,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:43:59,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894845267] [2025-03-04 10:43:59,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:43:59,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:44:01,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-04 10:44:01,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 10:44:01,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:44:01,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:01,611 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-03-04 10:44:01,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:44:01,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894845267] [2025-03-04 10:44:01,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894845267] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:44:01,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:44:01,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:44:01,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256610797] [2025-03-04 10:44:01,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:44:01,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:44:01,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:44:01,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:44:01,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:44:01,612 INFO L87 Difference]: Start difference. First operand 1663 states and 2212 transitions. Second operand has 3 states, 2 states have (on average 46.0) internal successors, (92), 3 states have internal predecessors, (92), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 10:44:01,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:44:01,671 INFO L93 Difference]: Finished difference Result 1673 states and 2228 transitions. [2025-03-04 10:44:01,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:44:01,671 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 46.0) internal successors, (92), 3 states have internal predecessors, (92), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 155 [2025-03-04 10:44:01,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:44:01,679 INFO L225 Difference]: With dead ends: 1673 [2025-03-04 10:44:01,679 INFO L226 Difference]: Without dead ends: 1671 [2025-03-04 10:44:01,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:44:01,680 INFO L435 NwaCegarLoop]: 517 mSDtfsCounter, 1 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1029 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:44:01,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1029 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:44:01,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2025-03-04 10:44:01,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1671. [2025-03-04 10:44:01,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1671 states, 1232 states have (on average 1.3198051948051948) internal successors, (1626), 1262 states have internal predecessors, (1626), 296 states have call successors, (296), 138 states have call predecessors, (296), 135 states have return successors, (298), 288 states have call predecessors, (298), 289 states have call successors, (298) [2025-03-04 10:44:01,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1671 states and 2220 transitions. [2025-03-04 10:44:01,748 INFO L78 Accepts]: Start accepts. Automaton has 1671 states and 2220 transitions. Word has length 155 [2025-03-04 10:44:01,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:44:01,749 INFO L471 AbstractCegarLoop]: Abstraction has 1671 states and 2220 transitions. [2025-03-04 10:44:01,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 46.0) internal successors, (92), 3 states have internal predecessors, (92), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 10:44:01,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 2220 transitions. [2025-03-04 10:44:01,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-04 10:44:01,752 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:44:01,752 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:44:01,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 10:44:01,752 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ##fun~$Pointer$~X~$Pointer$~TO~intErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-04 10:44:01,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:44:01,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1551378564, now seen corresponding path program 1 times [2025-03-04 10:44:01,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:44:01,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645515792] [2025-03-04 10:44:01,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:44:01,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:44:03,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-04 10:44:03,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-04 10:44:03,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:44:03,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:03,935 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-03-04 10:44:03,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:44:03,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645515792] [2025-03-04 10:44:03,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645515792] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:44:03,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:44:03,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:44:03,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15973345] [2025-03-04 10:44:03,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:44:03,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:44:03,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:44:03,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:44:03,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:44:03,937 INFO L87 Difference]: Start difference. First operand 1671 states and 2220 transitions. Second operand has 3 states, 2 states have (on average 45.5) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 10:44:03,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:44:03,987 INFO L93 Difference]: Finished difference Result 1671 states and 2220 transitions. [2025-03-04 10:44:03,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:44:03,987 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 45.5) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 154 [2025-03-04 10:44:03,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:44:03,994 INFO L225 Difference]: With dead ends: 1671 [2025-03-04 10:44:03,994 INFO L226 Difference]: Without dead ends: 1670 [2025-03-04 10:44:03,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:44:03,996 INFO L435 NwaCegarLoop]: 517 mSDtfsCounter, 1 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1029 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:44:03,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1029 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:44:03,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1670 states. [2025-03-04 10:44:04,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1670 to 1670. [2025-03-04 10:44:04,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1670 states, 1232 states have (on average 1.3165584415584415) internal successors, (1622), 1261 states have internal predecessors, (1622), 296 states have call successors, (296), 138 states have call predecessors, (296), 135 states have return successors, (298), 288 states have call predecessors, (298), 289 states have call successors, (298) [2025-03-04 10:44:04,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1670 states to 1670 states and 2216 transitions. [2025-03-04 10:44:04,050 INFO L78 Accepts]: Start accepts. Automaton has 1670 states and 2216 transitions. Word has length 154 [2025-03-04 10:44:04,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:44:04,051 INFO L471 AbstractCegarLoop]: Abstraction has 1670 states and 2216 transitions. [2025-03-04 10:44:04,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 45.5) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 10:44:04,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1670 states and 2216 transitions. [2025-03-04 10:44:04,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-04 10:44:04,053 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:44:04,053 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:44:04,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 10:44:04,053 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ##fun~$Pointer$~X~$Pointer$~TO~intErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-04 10:44:04,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:44:04,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1785222840, now seen corresponding path program 1 times [2025-03-04 10:44:04,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:44:04,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35717165] [2025-03-04 10:44:04,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:44:04,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:44:05,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-04 10:44:05,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-04 10:44:05,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:44:05,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:06,431 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-03-04 10:44:06,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:44:06,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35717165] [2025-03-04 10:44:06,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35717165] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:44:06,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:44:06,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:44:06,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230929263] [2025-03-04 10:44:06,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:44:06,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:44:06,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:44:06,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:44:06,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:44:06,432 INFO L87 Difference]: Start difference. First operand 1670 states and 2216 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 10:44:06,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:44:06,492 INFO L93 Difference]: Finished difference Result 3139 states and 4227 transitions. [2025-03-04 10:44:06,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:44:06,492 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 157 [2025-03-04 10:44:06,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:44:06,500 INFO L225 Difference]: With dead ends: 3139 [2025-03-04 10:44:06,500 INFO L226 Difference]: Without dead ends: 1657 [2025-03-04 10:44:06,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:44:06,504 INFO L435 NwaCegarLoop]: 514 mSDtfsCounter, 2 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1024 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:44:06,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1024 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:44:06,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1657 states. [2025-03-04 10:44:06,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1657 to 1657. [2025-03-04 10:44:06,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1657 states, 1220 states have (on average 1.3131147540983608) internal successors, (1602), 1248 states have internal predecessors, (1602), 296 states have call successors, (296), 138 states have call predecessors, (296), 135 states have return successors, (298), 288 states have call predecessors, (298), 289 states have call successors, (298) [2025-03-04 10:44:06,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1657 states to 1657 states and 2196 transitions. [2025-03-04 10:44:06,563 INFO L78 Accepts]: Start accepts. Automaton has 1657 states and 2196 transitions. Word has length 157 [2025-03-04 10:44:06,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:44:06,564 INFO L471 AbstractCegarLoop]: Abstraction has 1657 states and 2196 transitions. [2025-03-04 10:44:06,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 10:44:06,564 INFO L276 IsEmpty]: Start isEmpty. Operand 1657 states and 2196 transitions. [2025-03-04 10:44:06,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-04 10:44:06,567 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:44:06,567 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:44:06,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 10:44:06,567 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ##fun~$Pointer$~X~$Pointer$~TO~intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-04 10:44:06,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:44:06,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1587692718, now seen corresponding path program 1 times [2025-03-04 10:44:06,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:44:06,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022264288] [2025-03-04 10:44:06,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:44:06,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:44:08,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-04 10:44:08,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-04 10:44:08,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:44:08,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:08,521 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2025-03-04 10:44:08,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:44:08,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022264288] [2025-03-04 10:44:08,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022264288] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:44:08,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:44:08,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:44:08,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699658812] [2025-03-04 10:44:08,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:44:08,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:44:08,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:44:08,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:44:08,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:44:08,522 INFO L87 Difference]: Start difference. First operand 1657 states and 2196 transitions. Second operand has 3 states, 2 states have (on average 47.5) internal successors, (95), 3 states have internal predecessors, (95), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 10:44:08,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:44:08,571 INFO L93 Difference]: Finished difference Result 1667 states and 2212 transitions. [2025-03-04 10:44:08,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:44:08,571 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 47.5) internal successors, (95), 3 states have internal predecessors, (95), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 164 [2025-03-04 10:44:08,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:44:08,577 INFO L225 Difference]: With dead ends: 1667 [2025-03-04 10:44:08,577 INFO L226 Difference]: Without dead ends: 1665 [2025-03-04 10:44:08,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:44:08,578 INFO L435 NwaCegarLoop]: 514 mSDtfsCounter, 1 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1023 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:44:08,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1023 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:44:08,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1665 states. [2025-03-04 10:44:08,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1665 to 1665. [2025-03-04 10:44:08,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1665 states, 1228 states have (on average 1.3110749185667752) internal successors, (1610), 1256 states have internal predecessors, (1610), 296 states have call successors, (296), 138 states have call predecessors, (296), 135 states have return successors, (298), 288 states have call predecessors, (298), 289 states have call successors, (298) [2025-03-04 10:44:08,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1665 states to 1665 states and 2204 transitions. [2025-03-04 10:44:08,627 INFO L78 Accepts]: Start accepts. Automaton has 1665 states and 2204 transitions. Word has length 164 [2025-03-04 10:44:08,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:44:08,627 INFO L471 AbstractCegarLoop]: Abstraction has 1665 states and 2204 transitions. [2025-03-04 10:44:08,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 47.5) internal successors, (95), 3 states have internal predecessors, (95), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 10:44:08,628 INFO L276 IsEmpty]: Start isEmpty. Operand 1665 states and 2204 transitions. [2025-03-04 10:44:08,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-04 10:44:08,630 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:44:08,631 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:44:08,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 10:44:08,632 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting zf_pingErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-04 10:44:08,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:44:08,632 INFO L85 PathProgramCache]: Analyzing trace with hash 309889795, now seen corresponding path program 1 times [2025-03-04 10:44:08,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:44:08,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975057017] [2025-03-04 10:44:08,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:44:08,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:44:10,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-04 10:44:10,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-04 10:44:10,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:44:10,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:10,570 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2025-03-04 10:44:10,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:44:10,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975057017] [2025-03-04 10:44:10,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975057017] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:44:10,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:44:10,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:44:10,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907660979] [2025-03-04 10:44:10,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:44:10,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:44:10,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:44:10,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:44:10,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:44:10,572 INFO L87 Difference]: Start difference. First operand 1665 states and 2204 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-04 10:44:13,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 10:44:13,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:44:13,574 INFO L93 Difference]: Finished difference Result 2573 states and 3433 transitions. [2025-03-04 10:44:13,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:44:13,575 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 167 [2025-03-04 10:44:13,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:44:13,581 INFO L225 Difference]: With dead ends: 2573 [2025-03-04 10:44:13,582 INFO L226 Difference]: Without dead ends: 1661 [2025-03-04 10:44:13,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:44:13,584 INFO L435 NwaCegarLoop]: 511 mSDtfsCounter, 469 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:44:13,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 874 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-03-04 10:44:13,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1661 states. [2025-03-04 10:44:13,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1661 to 1661. [2025-03-04 10:44:13,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1661 states, 1224 states have (on average 1.3055555555555556) internal successors, (1598), 1252 states have internal predecessors, (1598), 296 states have call successors, (296), 138 states have call predecessors, (296), 135 states have return successors, (298), 288 states have call predecessors, (298), 289 states have call successors, (298) [2025-03-04 10:44:13,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1661 states to 1661 states and 2192 transitions. [2025-03-04 10:44:13,640 INFO L78 Accepts]: Start accepts. Automaton has 1661 states and 2192 transitions. Word has length 167 [2025-03-04 10:44:13,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:44:13,642 INFO L471 AbstractCegarLoop]: Abstraction has 1661 states and 2192 transitions. [2025-03-04 10:44:13,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-04 10:44:13,642 INFO L276 IsEmpty]: Start isEmpty. Operand 1661 states and 2192 transitions. [2025-03-04 10:44:13,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-04 10:44:13,645 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:44:13,645 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:44:13,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 10:44:13,645 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ##fun~$Pointer$~X~$Pointer$~TO~intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-04 10:44:13,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:44:13,646 INFO L85 PathProgramCache]: Analyzing trace with hash 615894944, now seen corresponding path program 1 times [2025-03-04 10:44:13,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:44:13,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362021273] [2025-03-04 10:44:13,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:44:13,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:44:15,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-04 10:44:15,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-04 10:44:15,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:44:15,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:15,567 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2025-03-04 10:44:15,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:44:15,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362021273] [2025-03-04 10:44:15,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362021273] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:44:15,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:44:15,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:44:15,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741429791] [2025-03-04 10:44:15,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:44:15,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:44:15,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:44:15,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:44:15,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:44:15,568 INFO L87 Difference]: Start difference. First operand 1661 states and 2192 transitions. Second operand has 3 states, 2 states have (on average 49.0) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 10:44:15,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:44:15,630 INFO L93 Difference]: Finished difference Result 1661 states and 2192 transitions. [2025-03-04 10:44:15,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:44:15,630 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 49.0) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 167 [2025-03-04 10:44:15,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:44:15,637 INFO L225 Difference]: With dead ends: 1661 [2025-03-04 10:44:15,637 INFO L226 Difference]: Without dead ends: 1660 [2025-03-04 10:44:15,638 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:44:15,639 INFO L435 NwaCegarLoop]: 511 mSDtfsCounter, 1 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1017 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:44:15,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1017 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:44:15,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1660 states. [2025-03-04 10:44:15,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1660 to 1660. [2025-03-04 10:44:15,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1660 states, 1224 states have (on average 1.3022875816993464) internal successors, (1594), 1251 states have internal predecessors, (1594), 296 states have call successors, (296), 138 states have call predecessors, (296), 135 states have return successors, (298), 288 states have call predecessors, (298), 289 states have call successors, (298) [2025-03-04 10:44:15,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1660 states to 1660 states and 2188 transitions. [2025-03-04 10:44:15,696 INFO L78 Accepts]: Start accepts. Automaton has 1660 states and 2188 transitions. Word has length 167 [2025-03-04 10:44:15,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:44:15,697 INFO L471 AbstractCegarLoop]: Abstraction has 1660 states and 2188 transitions. [2025-03-04 10:44:15,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 49.0) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 10:44:15,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1660 states and 2188 transitions. [2025-03-04 10:44:15,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-04 10:44:15,699 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:44:15,700 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:44:15,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 10:44:15,700 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting zf_pingErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-04 10:44:15,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:44:15,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1393150519, now seen corresponding path program 1 times [2025-03-04 10:44:15,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:44:15,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989877234] [2025-03-04 10:44:15,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:44:15,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:44:17,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-04 10:44:17,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-04 10:44:17,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:44:17,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:17,916 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2025-03-04 10:44:17,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:44:17,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989877234] [2025-03-04 10:44:17,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989877234] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:44:17,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:44:17,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:44:17,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889615697] [2025-03-04 10:44:17,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:44:17,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:44:17,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:44:17,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:44:17,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:44:17,918 INFO L87 Difference]: Start difference. First operand 1660 states and 2188 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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-03-04 10:44:18,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:44:18,005 INFO L93 Difference]: Finished difference Result 2551 states and 3391 transitions. [2025-03-04 10:44:18,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:44:18,005 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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) Word has length 168 [2025-03-04 10:44:18,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:44:18,012 INFO L225 Difference]: With dead ends: 2551 [2025-03-04 10:44:18,012 INFO L226 Difference]: Without dead ends: 1698 [2025-03-04 10:44:18,014 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:44:18,015 INFO L435 NwaCegarLoop]: 510 mSDtfsCounter, 25 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:44:18,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 1012 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:44:18,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1698 states. [2025-03-04 10:44:18,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1698 to 1664. [2025-03-04 10:44:18,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1664 states, 1228 states have (on average 1.3013029315960911) internal successors, (1598), 1255 states have internal predecessors, (1598), 296 states have call successors, (296), 138 states have call predecessors, (296), 135 states have return successors, (298), 288 states have call predecessors, (298), 289 states have call successors, (298) [2025-03-04 10:44:18,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1664 states to 1664 states and 2192 transitions. [2025-03-04 10:44:18,066 INFO L78 Accepts]: Start accepts. Automaton has 1664 states and 2192 transitions. Word has length 168 [2025-03-04 10:44:18,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:44:18,066 INFO L471 AbstractCegarLoop]: Abstraction has 1664 states and 2192 transitions. [2025-03-04 10:44:18,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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-03-04 10:44:18,067 INFO L276 IsEmpty]: Start isEmpty. Operand 1664 states and 2192 transitions. [2025-03-04 10:44:18,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-04 10:44:18,068 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:44:18,069 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:44:18,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 10:44:18,069 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ##fun~$Pointer$~X~$Pointer$~TO~intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-04 10:44:18,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:44:18,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1912874249, now seen corresponding path program 1 times [2025-03-04 10:44:18,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:44:18,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669107955] [2025-03-04 10:44:18,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:44:18,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:44:19,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-04 10:44:19,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-04 10:44:19,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:44:19,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:20,293 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2025-03-04 10:44:20,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:44:20,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669107955] [2025-03-04 10:44:20,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669107955] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:44:20,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:44:20,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:44:20,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271807680] [2025-03-04 10:44:20,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:44:20,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:44:20,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:44:20,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:44:20,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:44:20,295 INFO L87 Difference]: Start difference. First operand 1664 states and 2192 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 10:44:20,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:44:20,353 INFO L93 Difference]: Finished difference Result 3127 states and 4175 transitions. [2025-03-04 10:44:20,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:44:20,354 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 168 [2025-03-04 10:44:20,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:44:20,361 INFO L225 Difference]: With dead ends: 3127 [2025-03-04 10:44:20,363 INFO L226 Difference]: Without dead ends: 1651 [2025-03-04 10:44:20,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:44:20,367 INFO L435 NwaCegarLoop]: 508 mSDtfsCounter, 2 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:44:20,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1012 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:44:20,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1651 states. [2025-03-04 10:44:20,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1651 to 1651. [2025-03-04 10:44:20,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1651 states, 1216 states have (on average 1.2976973684210527) internal successors, (1578), 1242 states have internal predecessors, (1578), 296 states have call successors, (296), 138 states have call predecessors, (296), 135 states have return successors, (298), 288 states have call predecessors, (298), 289 states have call successors, (298) [2025-03-04 10:44:20,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1651 states to 1651 states and 2172 transitions. [2025-03-04 10:44:20,418 INFO L78 Accepts]: Start accepts. Automaton has 1651 states and 2172 transitions. Word has length 168 [2025-03-04 10:44:20,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:44:20,418 INFO L471 AbstractCegarLoop]: Abstraction has 1651 states and 2172 transitions. [2025-03-04 10:44:20,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 10:44:20,418 INFO L276 IsEmpty]: Start isEmpty. Operand 1651 states and 2172 transitions. [2025-03-04 10:44:20,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-04 10:44:20,421 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:44:20,421 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:44:20,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 10:44:20,422 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting zf_readwErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-04 10:44:20,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:44:20,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1432569740, now seen corresponding path program 1 times [2025-03-04 10:44:20,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:44:20,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147439562] [2025-03-04 10:44:20,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:44:20,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:44:22,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-04 10:44:22,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-04 10:44:22,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:44:22,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:22,607 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2025-03-04 10:44:22,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:44:22,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147439562] [2025-03-04 10:44:22,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147439562] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:44:22,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:44:22,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:44:22,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218149273] [2025-03-04 10:44:22,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:44:22,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:44:22,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:44:22,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:44:22,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:44:22,610 INFO L87 Difference]: Start difference. First operand 1651 states and 2172 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 10:44:22,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:44:22,713 INFO L93 Difference]: Finished difference Result 1838 states and 2370 transitions. [2025-03-04 10:44:22,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:44:22,714 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 172 [2025-03-04 10:44:22,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:44:22,721 INFO L225 Difference]: With dead ends: 1838 [2025-03-04 10:44:22,721 INFO L226 Difference]: Without dead ends: 1665 [2025-03-04 10:44:22,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:44:22,722 INFO L435 NwaCegarLoop]: 501 mSDtfsCounter, 218 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:44:22,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 869 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:44:22,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1665 states. [2025-03-04 10:44:22,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1665 to 1659. [2025-03-04 10:44:22,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1659 states, 1224 states have (on average 1.2957516339869282) internal successors, (1586), 1250 states have internal predecessors, (1586), 296 states have call successors, (296), 138 states have call predecessors, (296), 135 states have return successors, (298), 288 states have call predecessors, (298), 289 states have call successors, (298) [2025-03-04 10:44:22,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1659 states to 1659 states and 2180 transitions. [2025-03-04 10:44:22,790 INFO L78 Accepts]: Start accepts. Automaton has 1659 states and 2180 transitions. Word has length 172 [2025-03-04 10:44:22,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:44:22,790 INFO L471 AbstractCegarLoop]: Abstraction has 1659 states and 2180 transitions. [2025-03-04 10:44:22,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 10:44:22,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1659 states and 2180 transitions. [2025-03-04 10:44:22,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-04 10:44:22,793 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:44:22,793 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:44:22,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 10:44:22,794 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting zf_readwErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-04 10:44:22,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:44:22,794 INFO L85 PathProgramCache]: Analyzing trace with hash -630451557, now seen corresponding path program 1 times [2025-03-04 10:44:22,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:44:22,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607760517] [2025-03-04 10:44:22,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:44:22,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms