./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 e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/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-?-e2fb8be-m [2025-03-09 01:55:33,460 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:55:33,510 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 01:55:33,514 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:55:33,515 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:55:33,528 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:55:33,528 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:55:33,528 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:55:33,529 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:55:33,529 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:55:33,529 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:55:33,529 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:55:33,529 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:55:33,529 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:55:33,529 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:55:33,530 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:55:33,530 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 01:55:33,530 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:55:33,530 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:55:33,530 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:55:33,530 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:55:33,530 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 01:55:33,530 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:55:33,530 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 01:55:33,530 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 01:55:33,530 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:55:33,530 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:55:33,531 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 01:55:33,531 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:55:33,532 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:55:33,532 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:55:33,532 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:55:33,532 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:55:33,532 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:55:33,532 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:55:33,533 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:55:33,533 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:55:33,533 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 01:55:33,533 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 01:55:33,533 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:55:33,533 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:55:33,533 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:55:33,533 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:55:33,533 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:55:33,533 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:55:33,533 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-09 01:55:33,764 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:55:33,772 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:55:33,774 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:55:33,775 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:55:33,776 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:55:33,778 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-09 01:55:34,880 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e7da6a0c/adcf7b80898949948677691fcd911e45/FLAG8c69cef2b [2025-03-09 01:55:35,230 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:55:35,231 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ddv-machzwd/ddv_machzwd_inw.i [2025-03-09 01:55:35,256 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e7da6a0c/adcf7b80898949948677691fcd911e45/FLAG8c69cef2b [2025-03-09 01:55:35,272 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e7da6a0c/adcf7b80898949948677691fcd911e45 [2025-03-09 01:55:35,274 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:55:35,275 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:55:35,276 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:55:35,276 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:55:35,279 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:55:35,280 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:55:35" (1/1) ... [2025-03-09 01:55:35,280 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18dd631b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:55:35, skipping insertion in model container [2025-03-09 01:55:35,281 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:55:35" (1/1) ... [2025-03-09 01:55:35,334 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:55:36,053 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:55:36,101 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:55:36,228 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:55:36,394 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:55:36,394 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:55:36 WrapperNode [2025-03-09 01:55:36,395 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:55:36,396 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:55:36,396 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:55:36,396 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:55:36,403 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:55:36" (1/1) ... [2025-03-09 01:55:36,461 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:55:36" (1/1) ... [2025-03-09 01:55:36,563 INFO L138 Inliner]: procedures = 473, calls = 2667, calls flagged for inlining = 55, calls inlined = 39, statements flattened = 3372 [2025-03-09 01:55:36,564 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:55:36,564 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:55:36,564 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:55:36,564 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:55:36,571 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:55:36" (1/1) ... [2025-03-09 01:55:36,572 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:55:36" (1/1) ... [2025-03-09 01:55:36,591 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:55:36" (1/1) ... [2025-03-09 01:55:36,690 INFO L175 MemorySlicer]: Split 2024 memory accesses to 27 slices as follows [5, 3, 35, 1040, 480, 59, 35, 11, 5, 15, 0, 120, 37, 67, 3, 2, 5, 20, 4, 2, 12, 18, 2, 16, 2, 21, 5]. 51 percent of accesses are in the largest equivalence class. The 1901 initializations are split as follows [3, 3, 15, 1040, 480, 59, 32, 2, 1, 10, 0, 120, 25, 67, 0, 2, 4, 4, 4, 0, 6, 18, 0, 5, 0, 0, 1]. The 58 writes are split as follows [0, 0, 6, 0, 0, 0, 0, 5, 1, 2, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 6, 0, 1, 8, 2, 21, 2]. [2025-03-09 01:55:36,692 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:55:36" (1/1) ... [2025-03-09 01:55:36,693 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:55:36" (1/1) ... [2025-03-09 01:55:36,747 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:55:36" (1/1) ... [2025-03-09 01:55:36,755 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:55:36" (1/1) ... [2025-03-09 01:55:36,768 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:55:36" (1/1) ... [2025-03-09 01:55:36,780 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:55:36" (1/1) ... [2025-03-09 01:55:36,800 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:55:36,801 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:55:36,801 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:55:36,801 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:55:36,806 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:55:36" (1/1) ... [2025-03-09 01:55:36,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:55:36,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:55:36,829 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 01:55:36,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 01:55:36,851 INFO L130 BoogieDeclarations]: Found specification of procedure zf_timer_off [2025-03-09 01:55:36,851 INFO L138 BoogieDeclarations]: Found implementation of procedure zf_timer_off [2025-03-09 01:55:36,851 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-09 01:55:36,851 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_atomic_begin [2025-03-09 01:55:36,851 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2025-03-09 01:55:36,851 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2025-03-09 01:55:36,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 01:55:36,851 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2025-03-09 01:55:36,852 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2025-03-09 01:55:36,852 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-09 01:55:36,852 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_atomic_end [2025-03-09 01:55:36,852 INFO L130 BoogieDeclarations]: Found specification of procedure zf_get_control [2025-03-09 01:55:36,852 INFO L138 BoogieDeclarations]: Found implementation of procedure zf_get_control [2025-03-09 01:55:36,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-09 01:55:36,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-09 01:55:36,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-09 01:55:36,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-09 01:55:36,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-09 01:55:36,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-09 01:55:36,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-09 01:55:36,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-09 01:55:36,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-09 01:55:36,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-03-09 01:55:36,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-03-09 01:55:36,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-03-09 01:55:36,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-03-09 01:55:36,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-03-09 01:55:36,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-03-09 01:55:36,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-03-09 01:55:36,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-03-09 01:55:36,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-03-09 01:55:36,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-03-09 01:55:36,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#19 [2025-03-09 01:55:36,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#20 [2025-03-09 01:55:36,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#21 [2025-03-09 01:55:36,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#22 [2025-03-09 01:55:36,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#23 [2025-03-09 01:55:36,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#24 [2025-03-09 01:55:36,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#25 [2025-03-09 01:55:36,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#26 [2025-03-09 01:55:36,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 01:55:36,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 01:55:36,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 01:55:36,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-09 01:55:36,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-09 01:55:36,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-09 01:55:36,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-09 01:55:36,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-09 01:55:36,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-09 01:55:36,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-09 01:55:36,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-09 01:55:36,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-09 01:55:36,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-09 01:55:36,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-09 01:55:36,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-09 01:55:36,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-09 01:55:36,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-09 01:55:36,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-03-09 01:55:36,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-03-09 01:55:36,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-03-09 01:55:36,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#20 [2025-03-09 01:55:36,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#21 [2025-03-09 01:55:36,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#22 [2025-03-09 01:55:36,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#23 [2025-03-09 01:55:36,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#24 [2025-03-09 01:55:36,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#25 [2025-03-09 01:55:36,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#26 [2025-03-09 01:55:36,856 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 01:55:36,856 INFO L130 BoogieDeclarations]: Found specification of procedure request_region [2025-03-09 01:55:36,856 INFO L138 BoogieDeclarations]: Found implementation of procedure request_region [2025-03-09 01:55:36,856 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:55:36,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-09 01:55:36,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-09 01:55:36,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-09 01:55:36,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-09 01:55:36,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-09 01:55:36,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-09 01:55:36,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-09 01:55:36,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-09 01:55:36,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-09 01:55:36,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-09 01:55:36,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-09 01:55:36,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-09 01:55:36,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-09 01:55:36,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-09 01:55:36,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-09 01:55:36,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-03-09 01:55:36,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-03-09 01:55:36,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-03-09 01:55:36,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-03-09 01:55:36,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2025-03-09 01:55:36,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#20 [2025-03-09 01:55:36,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#21 [2025-03-09 01:55:36,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#22 [2025-03-09 01:55:36,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#23 [2025-03-09 01:55:36,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#24 [2025-03-09 01:55:36,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#25 [2025-03-09 01:55:36,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#26 [2025-03-09 01:55:36,857 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2025-03-09 01:55:36,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2025-03-09 01:55:36,857 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_irqsave [2025-03-09 01:55:36,857 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_irqsave [2025-03-09 01:55:36,857 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~TO~VOID [2025-03-09 01:55:36,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~TO~VOID [2025-03-09 01:55:36,857 INFO L130 BoogieDeclarations]: Found specification of procedure release_region [2025-03-09 01:55:36,857 INFO L138 BoogieDeclarations]: Found implementation of procedure release_region [2025-03-09 01:55:36,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:55:36,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:55:36,857 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_init [2025-03-09 01:55:36,857 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_init [2025-03-09 01:55:36,857 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-09 01:55:36,857 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-09 01:55:36,857 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer [2025-03-09 01:55:36,857 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer [2025-03-09 01:55:36,857 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 01:55:36,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-09 01:55:36,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-09 01:55:36,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-09 01:55:36,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-09 01:55:36,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-09 01:55:36,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-09 01:55:36,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-09 01:55:36,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-09 01:55:36,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-09 01:55:36,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-09 01:55:36,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-09 01:55:36,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-09 01:55:36,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-09 01:55:36,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-09 01:55:36,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-09 01:55:36,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-03-09 01:55:36,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-03-09 01:55:36,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-03-09 01:55:36,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-03-09 01:55:36,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2025-03-09 01:55:36,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#20 [2025-03-09 01:55:36,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#21 [2025-03-09 01:55:36,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#22 [2025-03-09 01:55:36,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#23 [2025-03-09 01:55:36,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#24 [2025-03-09 01:55:36,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#25 [2025-03-09 01:55:36,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#26 [2025-03-09 01:55:36,858 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2025-03-09 01:55:36,858 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2025-03-09 01:55:36,861 INFO L130 BoogieDeclarations]: Found specification of procedure cdev_add [2025-03-09 01:55:36,861 INFO L138 BoogieDeclarations]: Found implementation of procedure cdev_add [2025-03-09 01:55:36,861 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~$Pointer$~TO~int [2025-03-09 01:55:36,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~$Pointer$~TO~int [2025-03-09 01:55:36,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-09 01:55:36,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-09 01:55:36,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-09 01:55:36,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-09 01:55:36,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-09 01:55:36,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-09 01:55:36,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-09 01:55:36,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-09 01:55:36,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-09 01:55:36,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-09 01:55:36,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-09 01:55:36,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-03-09 01:55:36,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-03-09 01:55:36,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-03-09 01:55:36,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-03-09 01:55:36,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-03-09 01:55:36,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-03-09 01:55:36,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-03-09 01:55:36,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2025-03-09 01:55:36,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2025-03-09 01:55:36,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#20 [2025-03-09 01:55:36,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#21 [2025-03-09 01:55:36,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#22 [2025-03-09 01:55:36,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#23 [2025-03-09 01:55:36,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#24 [2025-03-09 01:55:36,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#25 [2025-03-09 01:55:36,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#26 [2025-03-09 01:55:36,862 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-03-09 01:55:36,862 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-03-09 01:55:36,862 INFO L130 BoogieDeclarations]: Found specification of procedure outw [2025-03-09 01:55:36,862 INFO L138 BoogieDeclarations]: Found implementation of procedure outw [2025-03-09 01:55:36,862 INFO L130 BoogieDeclarations]: Found specification of procedure outb [2025-03-09 01:55:36,862 INFO L138 BoogieDeclarations]: Found implementation of procedure outb [2025-03-09 01:55:36,862 INFO L130 BoogieDeclarations]: Found specification of procedure misc_deregister [2025-03-09 01:55:36,862 INFO L138 BoogieDeclarations]: Found implementation of procedure misc_deregister [2025-03-09 01:55:36,862 INFO L130 BoogieDeclarations]: Found specification of procedure assert_context_process [2025-03-09 01:55:36,862 INFO L138 BoogieDeclarations]: Found implementation of procedure assert_context_process [2025-03-09 01:55:36,862 INFO L130 BoogieDeclarations]: Found specification of procedure zf_set_control [2025-03-09 01:55:36,862 INFO L138 BoogieDeclarations]: Found implementation of procedure zf_set_control [2025-03-09 01:55:36,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 01:55:36,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 01:55:36,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 01:55:36,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-09 01:55:36,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-09 01:55:36,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-09 01:55:36,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-09 01:55:36,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-09 01:55:36,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-09 01:55:36,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-09 01:55:36,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-09 01:55:36,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-09 01:55:36,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-09 01:55:36,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-09 01:55:36,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-09 01:55:36,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-09 01:55:36,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-09 01:55:36,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-03-09 01:55:36,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-03-09 01:55:36,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-03-09 01:55:36,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#20 [2025-03-09 01:55:36,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#21 [2025-03-09 01:55:36,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#22 [2025-03-09 01:55:36,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#23 [2025-03-09 01:55:36,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#24 [2025-03-09 01:55:36,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#25 [2025-03-09 01:55:36,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#26 [2025-03-09 01:55:36,863 INFO L130 BoogieDeclarations]: Found specification of procedure zf_readw [2025-03-09 01:55:36,863 INFO L138 BoogieDeclarations]: Found implementation of procedure zf_readw [2025-03-09 01:55:36,863 INFO L130 BoogieDeclarations]: Found specification of procedure zf_ping [2025-03-09 01:55:36,863 INFO L138 BoogieDeclarations]: Found implementation of procedure zf_ping [2025-03-09 01:55:36,863 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~TO~int [2025-03-09 01:55:36,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~TO~int [2025-03-09 01:55:36,864 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2025-03-09 01:55:36,864 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2025-03-09 01:55:36,865 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2025-03-09 01:55:36,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2025-03-09 01:55:36,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:55:36,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 01:55:36,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 01:55:36,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-09 01:55:36,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-09 01:55:36,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-09 01:55:36,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-09 01:55:36,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-09 01:55:36,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-09 01:55:36,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-09 01:55:36,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-09 01:55:36,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-09 01:55:36,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-09 01:55:36,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-09 01:55:36,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-09 01:55:36,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-09 01:55:36,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-09 01:55:36,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-09 01:55:36,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-09 01:55:36,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-09 01:55:36,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#20 [2025-03-09 01:55:36,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#21 [2025-03-09 01:55:36,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#22 [2025-03-09 01:55:36,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#23 [2025-03-09 01:55:36,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#24 [2025-03-09 01:55:36,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#25 [2025-03-09 01:55:36,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#26 [2025-03-09 01:55:37,226 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:55:37,228 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:55:37,437 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3246: havoc get_user_#t~nondet671#1; [2025-03-09 01:55:37,450 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1508: havoc #t~ret200; [2025-03-09 01:55:37,477 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1470: havoc #t~ret199#1; [2025-03-09 01:55:37,477 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3965: havoc inw_#t~nondet754#1; [2025-03-09 01:55:37,563 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3262: havoc put_user_#t~nondet673#1; [2025-03-09 01:55:37,563 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3270: havoc copy_to_user_#t~nondet674#1; [2025-03-09 01:55:37,728 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4512: havoc test_and_set_bit_#t~bitwise795#1; [2025-03-09 01:55:37,728 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1705: havoc zf_open_#t~ret218#1; [2025-03-09 01:55:41,771 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3505: havoc misc_register_#t~ret713#1; [2025-03-09 01:55:41,894 INFO L? ?]: Removed 457 outVars from TransFormulas that were not future-live. [2025-03-09 01:55:41,894 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:55:41,947 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:55:41,950 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:55:41,950 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:55:41 BoogieIcfgContainer [2025-03-09 01:55:41,950 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:55:41,952 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:55:41,952 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:55:41,956 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:55:41,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:55:35" (1/3) ... [2025-03-09 01:55:41,957 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ec8dbb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:55:41, skipping insertion in model container [2025-03-09 01:55:41,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:55:36" (2/3) ... [2025-03-09 01:55:41,958 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ec8dbb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:55:41, skipping insertion in model container [2025-03-09 01:55:41,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:55:41" (3/3) ... [2025-03-09 01:55:41,959 INFO L128 eAbstractionObserver]: Analyzing ICFG ddv_machzwd_inw.i [2025-03-09 01:55:41,973 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:55:41,975 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-09 01:55:42,032 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:55:42,041 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;@76d672c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:55:42,041 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2025-03-09 01:55:42,047 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-09 01:55:42,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-09 01:55:42,051 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:55:42,052 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:55:42,052 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-09 01:55:42,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:55:42,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1481496859, now seen corresponding path program 1 times [2025-03-09 01:55:42,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:55:42,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573277946] [2025-03-09 01:55:42,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:55:42,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:55:44,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 01:55:44,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:55:44,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:55:44,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:45,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:55:45,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:55:45,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573277946] [2025-03-09 01:55:45,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573277946] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:55:45,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:55:45,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:55:45,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266675893] [2025-03-09 01:55:45,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:55:45,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:55:45,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:55:45,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:55:45,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:55:45,288 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-09 01:55:45,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:55:45,451 INFO L93 Difference]: Finished difference Result 846 states and 1175 transitions. [2025-03-09 01:55:45,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:55:45,454 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-09 01:55:45,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:55:45,464 INFO L225 Difference]: With dead ends: 846 [2025-03-09 01:55:45,464 INFO L226 Difference]: Without dead ends: 416 [2025-03-09 01:55:45,469 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-09 01:55:45,470 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-09 01:55:45,471 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-09 01:55:45,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2025-03-09 01:55:45,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 416. [2025-03-09 01:55:45,513 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-09 01:55:45,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 561 transitions. [2025-03-09 01:55:45,522 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 561 transitions. Word has length 9 [2025-03-09 01:55:45,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:55:45,523 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 561 transitions. [2025-03-09 01:55:45,523 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-09 01:55:45,524 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 561 transitions. [2025-03-09 01:55:45,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-09 01:55:45,525 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:55:45,525 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:55:45,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:55:45,525 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-09 01:55:45,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:55:45,526 INFO L85 PathProgramCache]: Analyzing trace with hash 189621468, now seen corresponding path program 1 times [2025-03-09 01:55:45,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:55:45,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022318495] [2025-03-09 01:55:45,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:55:45,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:55:47,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 01:55:47,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 01:55:47,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:55:47,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:48,072 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:55:48,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:55:48,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022318495] [2025-03-09 01:55:48,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022318495] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:55:48,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900189969] [2025-03-09 01:55:48,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:55:48,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:55:48,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:55:48,077 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:55:48,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 01:55:50,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 01:55:50,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 01:55:50,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:55:50,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:50,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 5617 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 01:55:50,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:55:50,814 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:55:50,814 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:55:50,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1900189969] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:55:50,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:55:50,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-09 01:55:50,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468678529] [2025-03-09 01:55:50,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:55:50,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:55:50,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:55:50,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:55:50,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:55:50,816 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-09 01:55:50,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:55:50,930 INFO L93 Difference]: Finished difference Result 416 states and 561 transitions. [2025-03-09 01:55:50,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:55:50,930 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-09 01:55:50,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:55:50,933 INFO L225 Difference]: With dead ends: 416 [2025-03-09 01:55:50,933 INFO L226 Difference]: Without dead ends: 415 [2025-03-09 01:55:50,933 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-09 01:55:50,934 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-09 01:55:50,934 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-09 01:55:50,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2025-03-09 01:55:50,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 415. [2025-03-09 01:55:50,955 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-09 01:55:50,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 560 transitions. [2025-03-09 01:55:50,959 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 560 transitions. Word has length 12 [2025-03-09 01:55:50,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:55:50,959 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 560 transitions. [2025-03-09 01:55:50,960 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-09 01:55:50,960 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 560 transitions. [2025-03-09 01:55:50,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-09 01:55:50,960 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:55:50,960 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:55:50,976 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-09 01:55:51,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:55:51,161 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-09 01:55:51,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:55:51,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1583293880, now seen corresponding path program 1 times [2025-03-09 01:55:51,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:55:51,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888364145] [2025-03-09 01:55:51,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:55:51,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:55:53,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 01:55:53,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 01:55:53,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:55:53,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:53,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:55:53,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:55:53,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888364145] [2025-03-09 01:55:53,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888364145] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:55:53,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505013391] [2025-03-09 01:55:53,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:55:53,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:55:53,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:55:53,471 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:55:53,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 01:55:55,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 01:55:55,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 01:55:55,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:55:55,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:55,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 5628 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 01:55:55,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:55:55,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:55:55,984 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:55:56,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:55:56,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1505013391] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:55:56,018 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:55:56,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-09 01:55:56,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496889748] [2025-03-09 01:55:56,019 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:55:56,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 01:55:56,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:55:56,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 01:55:56,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:55:56,019 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-09 01:55:56,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:55:56,156 INFO L93 Difference]: Finished difference Result 824 states and 1114 transitions. [2025-03-09 01:55:56,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:55:56,156 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-09 01:55:56,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:55:56,159 INFO L225 Difference]: With dead ends: 824 [2025-03-09 01:55:56,159 INFO L226 Difference]: Without dead ends: 419 [2025-03-09 01:55:56,161 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-09 01:55:56,161 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-09 01:55:56,161 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-09 01:55:56,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2025-03-09 01:55:56,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2025-03-09 01:55:56,176 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-09 01:55:56,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 564 transitions. [2025-03-09 01:55:56,180 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 564 transitions. Word has length 13 [2025-03-09 01:55:56,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:55:56,181 INFO L471 AbstractCegarLoop]: Abstraction has 419 states and 564 transitions. [2025-03-09 01:55:56,181 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-09 01:55:56,181 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 564 transitions. [2025-03-09 01:55:56,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-09 01:55:56,181 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:55:56,181 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:55:56,197 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 01:55:56,382 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-09 01:55:56,382 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-09 01:55:56,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:55:56,382 INFO L85 PathProgramCache]: Analyzing trace with hash 725679198, now seen corresponding path program 1 times [2025-03-09 01:55:56,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:55:56,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427653614] [2025-03-09 01:55:56,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:55:56,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:55:58,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:55:58,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:55:58,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:55:58,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:58,454 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-09 01:55:58,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:55:58,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427653614] [2025-03-09 01:55:58,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427653614] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:55:58,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:55:58,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:55:58,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970326507] [2025-03-09 01:55:58,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:55:58,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:55:58,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:55:58,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:55:58,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:55:58,456 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-09 01:55:58,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:55:58,502 INFO L93 Difference]: Finished difference Result 419 states and 564 transitions. [2025-03-09 01:55:58,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:55:58,502 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-09 01:55:58,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:55:58,504 INFO L225 Difference]: With dead ends: 419 [2025-03-09 01:55:58,504 INFO L226 Difference]: Without dead ends: 418 [2025-03-09 01:55:58,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:55:58,505 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-09 01:55:58,505 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-09 01:55:58,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2025-03-09 01:55:58,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 418. [2025-03-09 01:55:58,521 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-09 01:55:58,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 563 transitions. [2025-03-09 01:55:58,523 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 563 transitions. Word has length 16 [2025-03-09 01:55:58,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:55:58,524 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 563 transitions. [2025-03-09 01:55:58,524 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-09 01:55:58,524 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 563 transitions. [2025-03-09 01:55:58,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-09 01:55:58,524 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:55:58,524 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:55:58,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 01:55:58,525 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-09 01:55:58,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:55:58,525 INFO L85 PathProgramCache]: Analyzing trace with hash 2139214360, now seen corresponding path program 2 times [2025-03-09 01:55:58,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:55:58,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97731411] [2025-03-09 01:55:58,525 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:55:58,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:56:00,364 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-09 01:56:00,403 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 19 statements. [2025-03-09 01:56:00,403 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:56:00,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:56:00,677 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-09 01:56:00,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:56:00,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97731411] [2025-03-09 01:56:00,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97731411] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:56:00,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:56:00,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:56:00,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9318202] [2025-03-09 01:56:00,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:56:00,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:56:00,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:56:00,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:56:00,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:56:00,679 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-09 01:56:00,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:56:00,740 INFO L93 Difference]: Finished difference Result 422 states and 567 transitions. [2025-03-09 01:56:00,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:56:00,741 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-09 01:56:00,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:56:00,743 INFO L225 Difference]: With dead ends: 422 [2025-03-09 01:56:00,743 INFO L226 Difference]: Without dead ends: 420 [2025-03-09 01:56:00,743 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-09 01:56:00,743 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.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:56:00,744 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.0s Time] [2025-03-09 01:56:00,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2025-03-09 01:56:00,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 420. [2025-03-09 01:56:00,757 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-09 01:56:00,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 565 transitions. [2025-03-09 01:56:00,759 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 565 transitions. Word has length 19 [2025-03-09 01:56:00,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:56:00,760 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 565 transitions. [2025-03-09 01:56:00,760 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-09 01:56:00,760 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 565 transitions. [2025-03-09 01:56:00,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-09 01:56:00,760 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:56:00,760 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:56:00,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 01:56:00,761 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-09 01:56:00,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:56:00,761 INFO L85 PathProgramCache]: Analyzing trace with hash 610882456, now seen corresponding path program 1 times [2025-03-09 01:56:00,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:56:00,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065785096] [2025-03-09 01:56:00,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:56:00,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:56:02,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 01:56:02,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 01:56:02,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:56:02,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:56:02,965 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-09 01:56:02,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:56:02,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065785096] [2025-03-09 01:56:02,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065785096] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:56:02,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683091652] [2025-03-09 01:56:02,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:56:02,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:56:02,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:56:02,968 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:56:02,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 01:56:05,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 01:56:05,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 01:56:05,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:56:05,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:56:05,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 5693 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 01:56:05,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:56:05,551 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-09 01:56:05,551 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:56:05,632 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-09 01:56:05,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1683091652] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:56:05,632 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:56:05,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2025-03-09 01:56:05,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559094398] [2025-03-09 01:56:05,632 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:56:05,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-09 01:56:05,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:56:05,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-09 01:56:05,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2025-03-09 01:56:05,634 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-09 01:56:05,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:56:05,783 INFO L93 Difference]: Finished difference Result 834 states and 1126 transitions. [2025-03-09 01:56:05,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-09 01:56:05,784 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-09 01:56:05,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:56:05,786 INFO L225 Difference]: With dead ends: 834 [2025-03-09 01:56:05,786 INFO L226 Difference]: Without dead ends: 428 [2025-03-09 01:56:05,787 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-09 01:56:05,788 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-09 01:56:05,788 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-09 01:56:05,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2025-03-09 01:56:05,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 428. [2025-03-09 01:56:05,802 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-09 01:56:05,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 572 transitions. [2025-03-09 01:56:05,804 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 572 transitions. Word has length 22 [2025-03-09 01:56:05,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:56:05,805 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 572 transitions. [2025-03-09 01:56:05,805 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-09 01:56:05,805 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 572 transitions. [2025-03-09 01:56:05,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-09 01:56:05,805 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:56:05,806 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-09 01:56:05,823 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 01:56:06,006 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-09 01:56:06,006 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-09 01:56:06,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:56:06,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1693122458, now seen corresponding path program 1 times [2025-03-09 01:56:06,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:56:06,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979227102] [2025-03-09 01:56:06,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:56:06,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:56:07,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-09 01:56:07,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-09 01:56:07,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:56:07,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:56:08,342 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-09 01:56:08,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:56:08,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979227102] [2025-03-09 01:56:08,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979227102] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:56:08,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:56:08,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:56:08,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942250176] [2025-03-09 01:56:08,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:56:08,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:56:08,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:56:08,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:56:08,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:56:08,344 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-09 01:56:08,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:56:08,401 INFO L93 Difference]: Finished difference Result 750 states and 1012 transitions. [2025-03-09 01:56:08,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:56:08,401 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-09 01:56:08,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:56:08,405 INFO L225 Difference]: With dead ends: 750 [2025-03-09 01:56:08,405 INFO L226 Difference]: Without dead ends: 746 [2025-03-09 01:56:08,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:56:08,407 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-09 01:56:08,407 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-09 01:56:08,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2025-03-09 01:56:08,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 740. [2025-03-09 01:56:08,429 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-09 01:56:08,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1007 transitions. [2025-03-09 01:56:08,432 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1007 transitions. Word has length 49 [2025-03-09 01:56:08,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:56:08,434 INFO L471 AbstractCegarLoop]: Abstraction has 740 states and 1007 transitions. [2025-03-09 01:56:08,434 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-09 01:56:08,434 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1007 transitions. [2025-03-09 01:56:08,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-09 01:56:08,436 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:56:08,436 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-09 01:56:08,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 01:56:08,436 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-09 01:56:08,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:56:08,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1850039131, now seen corresponding path program 1 times [2025-03-09 01:56:08,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:56:08,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575889121] [2025-03-09 01:56:08,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:56:08,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:56:10,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-09 01:56:10,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-09 01:56:10,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:56:10,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:56:10,522 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-09 01:56:10,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:56:10,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575889121] [2025-03-09 01:56:10,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575889121] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:56:10,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:56:10,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:56:10,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25128974] [2025-03-09 01:56:10,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:56:10,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:56:10,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:56:10,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:56:10,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:56:10,524 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-09 01:56:10,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:56:10,565 INFO L93 Difference]: Finished difference Result 1437 states and 1963 transitions. [2025-03-09 01:56:10,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:56:10,566 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-09 01:56:10,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:56:10,569 INFO L225 Difference]: With dead ends: 1437 [2025-03-09 01:56:10,569 INFO L226 Difference]: Without dead ends: 738 [2025-03-09 01:56:10,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:56:10,571 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-09 01:56:10,571 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-09 01:56:10,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2025-03-09 01:56:10,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 738. [2025-03-09 01:56:10,592 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-09 01:56:10,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1003 transitions. [2025-03-09 01:56:10,596 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1003 transitions. Word has length 58 [2025-03-09 01:56:10,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:56:10,597 INFO L471 AbstractCegarLoop]: Abstraction has 738 states and 1003 transitions. [2025-03-09 01:56:10,597 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-09 01:56:10,597 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1003 transitions. [2025-03-09 01:56:10,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-09 01:56:10,599 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:56:10,599 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-09 01:56:10,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 01:56:10,599 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-09 01:56:10,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:56:10,600 INFO L85 PathProgramCache]: Analyzing trace with hash -2098327459, now seen corresponding path program 1 times [2025-03-09 01:56:10,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:56:10,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70097679] [2025-03-09 01:56:10,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:56:10,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:56:12,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-09 01:56:12,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-09 01:56:12,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:56:12,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:56:12,750 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-09 01:56:12,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:56:12,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70097679] [2025-03-09 01:56:12,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70097679] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:56:12,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:56:12,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:56:12,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416649172] [2025-03-09 01:56:12,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:56:12,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:56:12,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:56:12,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:56:12,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:56:12,751 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-09 01:56:12,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:56:12,837 INFO L93 Difference]: Finished difference Result 1714 states and 2347 transitions. [2025-03-09 01:56:12,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:56:12,838 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-09 01:56:12,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:56:12,846 INFO L225 Difference]: With dead ends: 1714 [2025-03-09 01:56:12,846 INFO L226 Difference]: Without dead ends: 1048 [2025-03-09 01:56:12,848 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-09 01:56:12,852 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-09 01:56:12,852 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-09 01:56:12,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2025-03-09 01:56:12,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 1042. [2025-03-09 01:56:12,891 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-09 01:56:12,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 1429 transitions. [2025-03-09 01:56:12,897 INFO L78 Accepts]: Start accepts. Automaton has 1042 states and 1429 transitions. Word has length 78 [2025-03-09 01:56:12,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:56:12,897 INFO L471 AbstractCegarLoop]: Abstraction has 1042 states and 1429 transitions. [2025-03-09 01:56:12,898 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-09 01:56:12,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1042 states and 1429 transitions. [2025-03-09 01:56:12,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-09 01:56:12,899 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:56:12,899 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-09 01:56:12,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 01:56:12,899 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-09 01:56:12,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:56:12,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1376073993, now seen corresponding path program 1 times [2025-03-09 01:56:12,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:56:12,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648035328] [2025-03-09 01:56:12,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:56:12,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:56:14,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-09 01:56:14,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-09 01:56:14,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:56:14,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:56:15,645 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-09 01:56:15,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:56:15,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648035328] [2025-03-09 01:56:15,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648035328] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:56:15,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197074776] [2025-03-09 01:56:15,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:56:15,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:56:15,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:56:15,647 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:56:15,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 01:56:17,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-09 01:56:18,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-09 01:56:18,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:56:18,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:56:18,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 5941 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 01:56:18,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:56:18,352 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-09 01:56:18,352 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:56:18,541 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-09 01:56:18,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [197074776] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:56:18,542 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:56:18,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-03-09 01:56:18,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713332215] [2025-03-09 01:56:18,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:56:18,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-09 01:56:18,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:56:18,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-09 01:56:18,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-03-09 01:56:18,543 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-09 01:56:18,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:56:18,690 INFO L93 Difference]: Finished difference Result 2067 states and 2842 transitions. [2025-03-09 01:56:18,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-09 01:56:18,690 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-09 01:56:18,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:56:18,695 INFO L225 Difference]: With dead ends: 2067 [2025-03-09 01:56:18,695 INFO L226 Difference]: Without dead ends: 1051 [2025-03-09 01:56:18,697 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-09 01:56:18,698 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-09 01:56:18,698 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-09 01:56:18,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2025-03-09 01:56:18,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 1051. [2025-03-09 01:56:18,727 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-09 01:56:18,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 1438 transitions. [2025-03-09 01:56:18,732 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 1438 transitions. Word has length 87 [2025-03-09 01:56:18,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:56:18,732 INFO L471 AbstractCegarLoop]: Abstraction has 1051 states and 1438 transitions. [2025-03-09 01:56:18,732 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-09 01:56:18,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1438 transitions. [2025-03-09 01:56:18,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-09 01:56:18,734 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:56:18,735 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-09 01:56:18,752 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-09 01:56:18,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:56:18,935 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-09 01:56:18,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:56:18,936 INFO L85 PathProgramCache]: Analyzing trace with hash 350455466, now seen corresponding path program 2 times [2025-03-09 01:56:18,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:56:18,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077291014] [2025-03-09 01:56:18,936 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:56:18,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:56:20,721 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 96 statements into 2 equivalence classes. [2025-03-09 01:56:20,757 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 37 of 96 statements. [2025-03-09 01:56:20,757 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:56:20,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:56:20,999 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-09 01:56:21,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:56:21,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077291014] [2025-03-09 01:56:21,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077291014] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:56:21,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:56:21,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:56:21,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320434914] [2025-03-09 01:56:21,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:56:21,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:56:21,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:56:21,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:56:21,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:56:21,001 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-09 01:56:21,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:56:21,064 INFO L93 Difference]: Finished difference Result 1076 states and 1456 transitions. [2025-03-09 01:56:21,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:56:21,065 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-09 01:56:21,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:56:21,068 INFO L225 Difference]: With dead ends: 1076 [2025-03-09 01:56:21,068 INFO L226 Difference]: Without dead ends: 762 [2025-03-09 01:56:21,070 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-09 01:56:21,070 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-09 01:56:21,071 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-09 01:56:21,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2025-03-09 01:56:21,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 762. [2025-03-09 01:56:21,090 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-09 01:56:21,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 1023 transitions. [2025-03-09 01:56:21,095 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 1023 transitions. Word has length 96 [2025-03-09 01:56:21,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:56:21,095 INFO L471 AbstractCegarLoop]: Abstraction has 762 states and 1023 transitions. [2025-03-09 01:56:21,095 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-09 01:56:21,096 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 1023 transitions. [2025-03-09 01:56:21,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-09 01:56:21,097 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:56:21,097 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-09 01:56:21,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 01:56:21,097 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-09 01:56:21,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:56:21,098 INFO L85 PathProgramCache]: Analyzing trace with hash 534190558, now seen corresponding path program 1 times [2025-03-09 01:56:21,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:56:21,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253145438] [2025-03-09 01:56:21,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:56:21,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:56:22,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-09 01:56:22,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-09 01:56:22,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:56:22,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:56:23,429 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-09 01:56:23,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:56:23,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253145438] [2025-03-09 01:56:23,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253145438] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:56:23,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:56:23,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:56:23,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65548808] [2025-03-09 01:56:23,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:56:23,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:56:23,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:56:23,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:56:23,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:56:23,430 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-09 01:56:23,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:56:23,512 INFO L93 Difference]: Finished difference Result 1732 states and 2311 transitions. [2025-03-09 01:56:23,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:56:23,513 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-09 01:56:23,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:56:23,518 INFO L225 Difference]: With dead ends: 1732 [2025-03-09 01:56:23,518 INFO L226 Difference]: Without dead ends: 1056 [2025-03-09 01:56:23,520 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-09 01:56:23,521 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-09 01:56:23,521 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-09 01:56:23,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2025-03-09 01:56:23,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 1050. [2025-03-09 01:56:23,548 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-09 01:56:23,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 1378 transitions. [2025-03-09 01:56:23,553 INFO L78 Accepts]: Start accepts. Automaton has 1050 states and 1378 transitions. Word has length 100 [2025-03-09 01:56:23,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:56:23,553 INFO L471 AbstractCegarLoop]: Abstraction has 1050 states and 1378 transitions. [2025-03-09 01:56:23,553 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-09 01:56:23,553 INFO L276 IsEmpty]: Start isEmpty. Operand 1050 states and 1378 transitions. [2025-03-09 01:56:23,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-09 01:56:23,555 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:56:23,555 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-09 01:56:23,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 01:56:23,555 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-09 01:56:23,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:56:23,556 INFO L85 PathProgramCache]: Analyzing trace with hash 107375862, now seen corresponding path program 1 times [2025-03-09 01:56:23,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:56:23,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050260453] [2025-03-09 01:56:23,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:56:23,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:56:25,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-09 01:56:25,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-09 01:56:25,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:56:25,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:56:26,085 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-09 01:56:26,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:56:26,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050260453] [2025-03-09 01:56:26,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050260453] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:56:26,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:56:26,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:56:26,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255635974] [2025-03-09 01:56:26,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:56:26,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:56:26,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:56:26,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:56:26,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:56:26,087 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-09 01:56:27,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:56:27,414 INFO L93 Difference]: Finished difference Result 2016 states and 2665 transitions. [2025-03-09 01:56:27,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:56:27,415 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-09 01:56:27,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:56:27,422 INFO L225 Difference]: With dead ends: 2016 [2025-03-09 01:56:27,422 INFO L226 Difference]: Without dead ends: 1050 [2025-03-09 01:56:27,424 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-09 01:56:27,425 INFO L435 NwaCegarLoop]: 521 mSDtfsCounter, 511 mSDsluCounter, 887 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.3s IncrementalHoareTripleChecker+Time [2025-03-09 01:56:27,425 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.3s Time] [2025-03-09 01:56:27,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1050 states. [2025-03-09 01:56:27,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1050 to 1050. [2025-03-09 01:56:27,455 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-09 01:56:27,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 1376 transitions. [2025-03-09 01:56:27,460 INFO L78 Accepts]: Start accepts. Automaton has 1050 states and 1376 transitions. Word has length 135 [2025-03-09 01:56:27,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:56:27,460 INFO L471 AbstractCegarLoop]: Abstraction has 1050 states and 1376 transitions. [2025-03-09 01:56:27,460 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-09 01:56:27,460 INFO L276 IsEmpty]: Start isEmpty. Operand 1050 states and 1376 transitions. [2025-03-09 01:56:27,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-09 01:56:27,463 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:56:27,463 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-09 01:56:27,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 01:56:27,464 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-09 01:56:27,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:56:27,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1703441654, now seen corresponding path program 1 times [2025-03-09 01:56:27,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:56:27,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764343378] [2025-03-09 01:56:27,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:56:27,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:56:29,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-09 01:56:29,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-09 01:56:29,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:56:29,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:56:29,824 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-09 01:56:29,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:56:29,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764343378] [2025-03-09 01:56:29,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764343378] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:56:29,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:56:29,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:56:29,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237533339] [2025-03-09 01:56:29,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:56:29,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:56:29,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:56:29,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:56:29,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:56:29,826 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-09 01:56:29,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:56:29,928 INFO L93 Difference]: Finished difference Result 1940 states and 2562 transitions. [2025-03-09 01:56:29,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:56:29,928 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-09 01:56:29,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:56:29,935 INFO L225 Difference]: With dead ends: 1940 [2025-03-09 01:56:29,935 INFO L226 Difference]: Without dead ends: 1492 [2025-03-09 01:56:29,937 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-09 01:56:29,937 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.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:56:29,938 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.1s Time] [2025-03-09 01:56:29,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1492 states. [2025-03-09 01:56:29,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1492 to 1484. [2025-03-09 01:56:29,975 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-09 01:56:29,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1484 states to 1484 states and 1962 transitions. [2025-03-09 01:56:29,980 INFO L78 Accepts]: Start accepts. Automaton has 1484 states and 1962 transitions. Word has length 137 [2025-03-09 01:56:29,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:56:29,981 INFO L471 AbstractCegarLoop]: Abstraction has 1484 states and 1962 transitions. [2025-03-09 01:56:29,981 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-09 01:56:29,981 INFO L276 IsEmpty]: Start isEmpty. Operand 1484 states and 1962 transitions. [2025-03-09 01:56:29,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-09 01:56:29,984 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:56:29,984 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-09 01:56:29,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 01:56:29,985 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-09 01:56:29,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:56:29,985 INFO L85 PathProgramCache]: Analyzing trace with hash 198097254, now seen corresponding path program 1 times [2025-03-09 01:56:29,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:56:29,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028178028] [2025-03-09 01:56:29,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:56:29,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:56:31,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-09 01:56:31,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-09 01:56:31,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:56:31,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:56:32,624 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-09 01:56:32,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:56:32,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028178028] [2025-03-09 01:56:32,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028178028] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:56:32,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:56:32,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:56:32,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28365340] [2025-03-09 01:56:32,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:56:32,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:56:32,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:56:32,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:56:32,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:56:32,626 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-09 01:56:32,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:56:32,746 INFO L93 Difference]: Finished difference Result 3852 states and 5211 transitions. [2025-03-09 01:56:32,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:56:32,747 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-09 01:56:32,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:56:32,758 INFO L225 Difference]: With dead ends: 3852 [2025-03-09 01:56:32,759 INFO L226 Difference]: Without dead ends: 2472 [2025-03-09 01:56:32,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:56:32,763 INFO L435 NwaCegarLoop]: 548 mSDtfsCounter, 425 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-09 01:56:32,763 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-09 01:56:32,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2472 states. [2025-03-09 01:56:32,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2472 to 2321. [2025-03-09 01:56:32,850 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-09 01:56:32,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2321 states to 2321 states and 3133 transitions. [2025-03-09 01:56:32,858 INFO L78 Accepts]: Start accepts. Automaton has 2321 states and 3133 transitions. Word has length 138 [2025-03-09 01:56:32,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:56:32,858 INFO L471 AbstractCegarLoop]: Abstraction has 2321 states and 3133 transitions. [2025-03-09 01:56:32,858 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-09 01:56:32,858 INFO L276 IsEmpty]: Start isEmpty. Operand 2321 states and 3133 transitions. [2025-03-09 01:56:32,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-09 01:56:32,861 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:56:32,861 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-09 01:56:32,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 01:56:32,861 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-09 01:56:32,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:56:32,861 INFO L85 PathProgramCache]: Analyzing trace with hash 2042323241, now seen corresponding path program 1 times [2025-03-09 01:56:32,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:56:32,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488303267] [2025-03-09 01:56:32,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:56:32,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:56:34,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-09 01:56:34,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-09 01:56:34,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:56:34,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:56:35,073 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-09 01:56:35,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:56:35,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488303267] [2025-03-09 01:56:35,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488303267] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:56:35,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:56:35,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:56:35,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658578387] [2025-03-09 01:56:35,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:56:35,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:56:35,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:56:35,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:56:35,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:56:35,075 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-09 01:56:35,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:56:35,141 INFO L93 Difference]: Finished difference Result 2476 states and 3308 transitions. [2025-03-09 01:56:35,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:56:35,141 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-09 01:56:35,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:56:35,148 INFO L225 Difference]: With dead ends: 2476 [2025-03-09 01:56:35,149 INFO L226 Difference]: Without dead ends: 1663 [2025-03-09 01:56:35,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:56:35,151 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-09 01:56:35,151 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-09 01:56:35,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1663 states. [2025-03-09 01:56:35,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1663 to 1663. [2025-03-09 01:56:35,199 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-09 01:56:35,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1663 states to 1663 states and 2212 transitions. [2025-03-09 01:56:35,205 INFO L78 Accepts]: Start accepts. Automaton has 1663 states and 2212 transitions. Word has length 155 [2025-03-09 01:56:35,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:56:35,206 INFO L471 AbstractCegarLoop]: Abstraction has 1663 states and 2212 transitions. [2025-03-09 01:56:35,206 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-09 01:56:35,206 INFO L276 IsEmpty]: Start isEmpty. Operand 1663 states and 2212 transitions. [2025-03-09 01:56:35,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-09 01:56:35,207 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:56:35,207 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-09 01:56:35,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-09 01:56:35,208 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-09 01:56:35,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:56:35,208 INFO L85 PathProgramCache]: Analyzing trace with hash 475599511, now seen corresponding path program 1 times [2025-03-09 01:56:35,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:56:35,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122534332] [2025-03-09 01:56:35,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:56:35,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:56:37,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-09 01:56:37,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-09 01:56:37,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:56:37,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:56:37,368 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-09 01:56:37,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:56:37,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122534332] [2025-03-09 01:56:37,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122534332] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:56:37,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:56:37,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:56:37,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929242639] [2025-03-09 01:56:37,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:56:37,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:56:37,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:56:37,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:56:37,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:56:37,370 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-09 01:56:37,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:56:37,451 INFO L93 Difference]: Finished difference Result 1673 states and 2228 transitions. [2025-03-09 01:56:37,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:56:37,452 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-09 01:56:37,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:56:37,460 INFO L225 Difference]: With dead ends: 1673 [2025-03-09 01:56:37,461 INFO L226 Difference]: Without dead ends: 1671 [2025-03-09 01:56:37,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:56:37,462 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-09 01:56:37,462 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-09 01:56:37,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2025-03-09 01:56:37,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1671. [2025-03-09 01:56:37,518 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-09 01:56:37,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1671 states and 2220 transitions. [2025-03-09 01:56:37,525 INFO L78 Accepts]: Start accepts. Automaton has 1671 states and 2220 transitions. Word has length 155 [2025-03-09 01:56:37,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:56:37,526 INFO L471 AbstractCegarLoop]: Abstraction has 1671 states and 2220 transitions. [2025-03-09 01:56:37,526 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-09 01:56:37,526 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 2220 transitions. [2025-03-09 01:56:37,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-09 01:56:37,529 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:56:37,529 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-09 01:56:37,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-09 01:56:37,530 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-09 01:56:37,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:56:37,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1551378564, now seen corresponding path program 1 times [2025-03-09 01:56:37,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:56:37,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445980499] [2025-03-09 01:56:37,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:56:37,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:56:39,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-09 01:56:39,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-09 01:56:39,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:56:39,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:56:39,536 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-09 01:56:39,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:56:39,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445980499] [2025-03-09 01:56:39,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445980499] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:56:39,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:56:39,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:56:39,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741993615] [2025-03-09 01:56:39,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:56:39,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:56:39,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:56:39,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:56:39,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:56:39,537 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-09 01:56:39,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:56:39,593 INFO L93 Difference]: Finished difference Result 1671 states and 2220 transitions. [2025-03-09 01:56:39,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:56:39,594 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-09 01:56:39,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:56:39,600 INFO L225 Difference]: With dead ends: 1671 [2025-03-09 01:56:39,600 INFO L226 Difference]: Without dead ends: 1670 [2025-03-09 01:56:39,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:56:39,601 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-09 01:56:39,601 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-09 01:56:39,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1670 states. [2025-03-09 01:56:39,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1670 to 1670. [2025-03-09 01:56:39,649 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-09 01:56:39,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1670 states to 1670 states and 2216 transitions. [2025-03-09 01:56:39,658 INFO L78 Accepts]: Start accepts. Automaton has 1670 states and 2216 transitions. Word has length 154 [2025-03-09 01:56:39,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:56:39,658 INFO L471 AbstractCegarLoop]: Abstraction has 1670 states and 2216 transitions. [2025-03-09 01:56:39,658 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-09 01:56:39,658 INFO L276 IsEmpty]: Start isEmpty. Operand 1670 states and 2216 transitions. [2025-03-09 01:56:39,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-09 01:56:39,660 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:56:39,660 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-09 01:56:39,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-09 01:56:39,660 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-09 01:56:39,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:56:39,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1785222840, now seen corresponding path program 1 times [2025-03-09 01:56:39,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:56:39,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026242930] [2025-03-09 01:56:39,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:56:39,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:56:41,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-09 01:56:41,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-09 01:56:41,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:56:41,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:56:42,044 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-09 01:56:42,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:56:42,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026242930] [2025-03-09 01:56:42,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026242930] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:56:42,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:56:42,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:56:42,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013846585] [2025-03-09 01:56:42,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:56:42,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:56:42,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:56:42,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:56:42,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:56:42,046 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-09 01:56:42,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:56:42,127 INFO L93 Difference]: Finished difference Result 3139 states and 4227 transitions. [2025-03-09 01:56:42,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:56:42,128 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-09 01:56:42,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:56:42,135 INFO L225 Difference]: With dead ends: 3139 [2025-03-09 01:56:42,135 INFO L226 Difference]: Without dead ends: 1657 [2025-03-09 01:56:42,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:56:42,139 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-09 01:56:42,139 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-09 01:56:42,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1657 states. [2025-03-09 01:56:42,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1657 to 1657. [2025-03-09 01:56:42,188 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-09 01:56:42,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1657 states to 1657 states and 2196 transitions. [2025-03-09 01:56:42,195 INFO L78 Accepts]: Start accepts. Automaton has 1657 states and 2196 transitions. Word has length 157 [2025-03-09 01:56:42,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:56:42,195 INFO L471 AbstractCegarLoop]: Abstraction has 1657 states and 2196 transitions. [2025-03-09 01:56:42,195 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-09 01:56:42,196 INFO L276 IsEmpty]: Start isEmpty. Operand 1657 states and 2196 transitions. [2025-03-09 01:56:42,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-09 01:56:42,197 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:56:42,197 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-09 01:56:42,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-09 01:56:42,198 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-09 01:56:42,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:56:42,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1587692718, now seen corresponding path program 1 times [2025-03-09 01:56:42,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:56:42,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997915220] [2025-03-09 01:56:42,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:56:42,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:56:43,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-09 01:56:44,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-09 01:56:44,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:56:44,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:56:44,212 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-09 01:56:44,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:56:44,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997915220] [2025-03-09 01:56:44,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997915220] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:56:44,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:56:44,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:56:44,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168575706] [2025-03-09 01:56:44,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:56:44,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:56:44,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:56:44,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:56:44,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:56:44,213 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-09 01:56:44,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:56:44,266 INFO L93 Difference]: Finished difference Result 1667 states and 2212 transitions. [2025-03-09 01:56:44,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:56:44,266 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-09 01:56:44,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:56:44,272 INFO L225 Difference]: With dead ends: 1667 [2025-03-09 01:56:44,272 INFO L226 Difference]: Without dead ends: 1665 [2025-03-09 01:56:44,273 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:56:44,273 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-09 01:56:44,273 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-09 01:56:44,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1665 states. [2025-03-09 01:56:44,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1665 to 1665. [2025-03-09 01:56:44,318 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-09 01:56:44,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1665 states to 1665 states and 2204 transitions. [2025-03-09 01:56:44,323 INFO L78 Accepts]: Start accepts. Automaton has 1665 states and 2204 transitions. Word has length 164 [2025-03-09 01:56:44,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:56:44,324 INFO L471 AbstractCegarLoop]: Abstraction has 1665 states and 2204 transitions. [2025-03-09 01:56:44,325 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-09 01:56:44,325 INFO L276 IsEmpty]: Start isEmpty. Operand 1665 states and 2204 transitions. [2025-03-09 01:56:44,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-09 01:56:44,327 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:56:44,327 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-09 01:56:44,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-09 01:56:44,328 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-09 01:56:44,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:56:44,328 INFO L85 PathProgramCache]: Analyzing trace with hash 309889795, now seen corresponding path program 1 times [2025-03-09 01:56:44,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:56:44,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209570666] [2025-03-09 01:56:44,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:56:44,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:56:46,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-09 01:56:46,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-09 01:56:46,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:56:46,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:56:46,306 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-09 01:56:46,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:56:46,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209570666] [2025-03-09 01:56:46,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209570666] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:56:46,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:56:46,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:56:46,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519687771] [2025-03-09 01:56:46,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:56:46,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:56:46,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:56:46,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:56:46,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:56:46,307 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-09 01:56:47,425 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-09 01:56:47,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:56:47,674 INFO L93 Difference]: Finished difference Result 2573 states and 3433 transitions. [2025-03-09 01:56:47,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:56:47,674 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-09 01:56:47,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:56:47,680 INFO L225 Difference]: With dead ends: 2573 [2025-03-09 01:56:47,680 INFO L226 Difference]: Without dead ends: 1661 [2025-03-09 01:56:47,682 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:56:47,683 INFO L435 NwaCegarLoop]: 511 mSDtfsCounter, 469 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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, 1.3s IncrementalHoareTripleChecker+Time [2025-03-09 01:56:47,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 874 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-09 01:56:47,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1661 states. [2025-03-09 01:56:47,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1661 to 1661. [2025-03-09 01:56:47,728 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-09 01:56:47,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1661 states to 1661 states and 2192 transitions. [2025-03-09 01:56:47,733 INFO L78 Accepts]: Start accepts. Automaton has 1661 states and 2192 transitions. Word has length 167 [2025-03-09 01:56:47,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:56:47,734 INFO L471 AbstractCegarLoop]: Abstraction has 1661 states and 2192 transitions. [2025-03-09 01:56:47,735 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-09 01:56:47,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1661 states and 2192 transitions. [2025-03-09 01:56:47,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-09 01:56:47,737 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:56:47,737 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-09 01:56:47,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-09 01:56:47,737 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-09 01:56:47,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:56:47,738 INFO L85 PathProgramCache]: Analyzing trace with hash 615894944, now seen corresponding path program 1 times [2025-03-09 01:56:47,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:56:47,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720173725] [2025-03-09 01:56:47,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:56:47,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:56:49,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-09 01:56:49,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-09 01:56:49,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:56:49,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:56:49,754 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-09 01:56:49,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:56:49,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720173725] [2025-03-09 01:56:49,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720173725] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:56:49,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:56:49,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:56:49,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519437074] [2025-03-09 01:56:49,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:56:49,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:56:49,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:56:49,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:56:49,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:56:49,755 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-09 01:56:49,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:56:49,814 INFO L93 Difference]: Finished difference Result 1661 states and 2192 transitions. [2025-03-09 01:56:49,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:56:49,815 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-09 01:56:49,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:56:49,821 INFO L225 Difference]: With dead ends: 1661 [2025-03-09 01:56:49,821 INFO L226 Difference]: Without dead ends: 1660 [2025-03-09 01:56:49,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:56:49,823 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-09 01:56:49,823 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-09 01:56:49,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1660 states. [2025-03-09 01:56:49,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1660 to 1660. [2025-03-09 01:56:49,868 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-09 01:56:49,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1660 states to 1660 states and 2188 transitions. [2025-03-09 01:56:49,872 INFO L78 Accepts]: Start accepts. Automaton has 1660 states and 2188 transitions. Word has length 167 [2025-03-09 01:56:49,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:56:49,873 INFO L471 AbstractCegarLoop]: Abstraction has 1660 states and 2188 transitions. [2025-03-09 01:56:49,873 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-09 01:56:49,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1660 states and 2188 transitions. [2025-03-09 01:56:49,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-09 01:56:49,875 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:56:49,875 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-09 01:56:49,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-09 01:56:49,877 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-09 01:56:49,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:56:49,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1393150519, now seen corresponding path program 1 times [2025-03-09 01:56:49,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:56:49,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996974673] [2025-03-09 01:56:49,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:56:49,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:56:51,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-09 01:56:51,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-09 01:56:51,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:56:51,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:56:52,343 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-09 01:56:52,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:56:52,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996974673] [2025-03-09 01:56:52,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996974673] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:56:52,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:56:52,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:56:52,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045739709] [2025-03-09 01:56:52,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:56:52,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:56:52,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:56:52,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:56:52,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:56:52,345 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-09 01:56:52,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:56:52,435 INFO L93 Difference]: Finished difference Result 2551 states and 3391 transitions. [2025-03-09 01:56:52,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:56:52,436 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-09 01:56:52,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:56:52,442 INFO L225 Difference]: With dead ends: 2551 [2025-03-09 01:56:52,442 INFO L226 Difference]: Without dead ends: 1698 [2025-03-09 01:56:52,444 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-09 01:56:52,445 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-09 01:56:52,445 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-09 01:56:52,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1698 states. [2025-03-09 01:56:52,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1698 to 1664. [2025-03-09 01:56:52,500 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-09 01:56:52,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1664 states to 1664 states and 2192 transitions. [2025-03-09 01:56:52,505 INFO L78 Accepts]: Start accepts. Automaton has 1664 states and 2192 transitions. Word has length 168 [2025-03-09 01:56:52,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:56:52,505 INFO L471 AbstractCegarLoop]: Abstraction has 1664 states and 2192 transitions. [2025-03-09 01:56:52,505 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-09 01:56:52,505 INFO L276 IsEmpty]: Start isEmpty. Operand 1664 states and 2192 transitions. [2025-03-09 01:56:52,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-09 01:56:52,508 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:56:52,508 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-09 01:56:52,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-09 01:56:52,509 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-09 01:56:52,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:56:52,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1912874249, now seen corresponding path program 1 times [2025-03-09 01:56:52,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:56:52,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998763643] [2025-03-09 01:56:52,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:56:52,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:56:54,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-09 01:56:54,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-09 01:56:54,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:56:54,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:56:54,836 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-09 01:56:54,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:56:54,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998763643] [2025-03-09 01:56:54,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998763643] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:56:54,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:56:54,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:56:54,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058046495] [2025-03-09 01:56:54,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:56:54,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:56:54,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:56:54,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:56:54,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:56:54,837 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-09 01:56:54,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:56:54,897 INFO L93 Difference]: Finished difference Result 3127 states and 4175 transitions. [2025-03-09 01:56:54,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:56:54,897 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-09 01:56:54,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:56:54,903 INFO L225 Difference]: With dead ends: 3127 [2025-03-09 01:56:54,903 INFO L226 Difference]: Without dead ends: 1651 [2025-03-09 01:56:54,906 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:56:54,907 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-09 01:56:54,907 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-09 01:56:54,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1651 states. [2025-03-09 01:56:54,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1651 to 1651. [2025-03-09 01:56:54,949 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-09 01:56:54,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1651 states to 1651 states and 2172 transitions. [2025-03-09 01:56:54,954 INFO L78 Accepts]: Start accepts. Automaton has 1651 states and 2172 transitions. Word has length 168 [2025-03-09 01:56:54,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:56:54,954 INFO L471 AbstractCegarLoop]: Abstraction has 1651 states and 2172 transitions. [2025-03-09 01:56:54,954 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-09 01:56:54,955 INFO L276 IsEmpty]: Start isEmpty. Operand 1651 states and 2172 transitions. [2025-03-09 01:56:54,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-09 01:56:54,956 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:56:54,956 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-09 01:56:54,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-09 01:56:54,957 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-09 01:56:54,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:56:54,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1432569740, now seen corresponding path program 1 times [2025-03-09 01:56:54,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:56:54,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067954436] [2025-03-09 01:56:54,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:56:54,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:56:56,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-09 01:56:56,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-09 01:56:56,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:56:56,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:56:57,087 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-09 01:56:57,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:56:57,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067954436] [2025-03-09 01:56:57,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067954436] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:56:57,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:56:57,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:56:57,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136435609] [2025-03-09 01:56:57,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:56:57,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:56:57,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:56:57,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:56:57,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:56:57,088 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-09 01:56:57,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:56:57,187 INFO L93 Difference]: Finished difference Result 1838 states and 2370 transitions. [2025-03-09 01:56:57,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:56:57,187 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-09 01:56:57,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:56:57,192 INFO L225 Difference]: With dead ends: 1838 [2025-03-09 01:56:57,193 INFO L226 Difference]: Without dead ends: 1665 [2025-03-09 01:56:57,193 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-09 01:56:57,194 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-09 01:56:57,194 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-09 01:56:57,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1665 states. [2025-03-09 01:56:57,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1665 to 1659. [2025-03-09 01:56:57,237 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-09 01:56:57,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1659 states to 1659 states and 2180 transitions. [2025-03-09 01:56:57,242 INFO L78 Accepts]: Start accepts. Automaton has 1659 states and 2180 transitions. Word has length 172 [2025-03-09 01:56:57,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:56:57,242 INFO L471 AbstractCegarLoop]: Abstraction has 1659 states and 2180 transitions. [2025-03-09 01:56:57,242 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-09 01:56:57,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1659 states and 2180 transitions. [2025-03-09 01:56:57,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-09 01:56:57,244 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:56:57,245 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-09 01:56:57,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-09 01:56:57,245 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-09 01:56:57,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:56:57,245 INFO L85 PathProgramCache]: Analyzing trace with hash -630451557, now seen corresponding path program 1 times [2025-03-09 01:56:57,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:56:57,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644692275] [2025-03-09 01:56:57,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:56:57,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms