./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--cdc_mbim.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--cdc_mbim.ko-entry_point.cil.out.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 938b60b21c972fc7f556d0694990fba352b46bfd03cbdeaa77f40e339f6c8deb --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 06:22:36,718 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 06:22:36,757 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-06 06:22:36,761 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 06:22:36,761 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 06:22:36,776 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 06:22:36,777 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 06:22:36,777 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 06:22:36,777 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 06:22:36,777 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 06:22:36,777 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 06:22:36,778 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 06:22:36,778 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 06:22:36,778 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 06:22:36,778 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 06:22:36,778 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 06:22:36,778 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 06:22:36,778 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 06:22:36,778 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 06:22:36,778 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 06:22:36,779 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 06:22:36,779 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 06:22:36,779 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 06:22:36,779 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 06:22:36,779 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 06:22:36,779 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 06:22:36,779 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 06:22:36,779 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 06:22:36,779 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 06:22:36,779 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 06:22:36,779 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 06:22:36,779 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 06:22:36,779 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 06:22:36,779 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 06:22:36,779 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 06:22:36,779 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 06:22:36,779 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 06:22:36,779 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 06:22:36,779 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 06:22:36,779 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 06:22:36,779 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 938b60b21c972fc7f556d0694990fba352b46bfd03cbdeaa77f40e339f6c8deb [2025-02-06 06:22:37,001 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 06:22:37,013 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 06:22:37,016 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 06:22:37,017 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 06:22:37,017 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 06:22:37,019 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--cdc_mbim.ko-entry_point.cil.out.i [2025-02-06 06:22:38,239 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f82460f39/5129221b5f4a4de6b54fec00277b4b26/FLAGddfc235ca [2025-02-06 06:22:38,744 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 06:22:38,745 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--cdc_mbim.ko-entry_point.cil.out.i [2025-02-06 06:22:38,783 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f82460f39/5129221b5f4a4de6b54fec00277b4b26/FLAGddfc235ca [2025-02-06 06:22:38,804 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f82460f39/5129221b5f4a4de6b54fec00277b4b26 [2025-02-06 06:22:38,806 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 06:22:38,807 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 06:22:38,809 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 06:22:38,810 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 06:22:38,813 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 06:22:38,815 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:22:38" (1/1) ... [2025-02-06 06:22:38,816 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ceaecac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:22:38, skipping insertion in model container [2025-02-06 06:22:38,816 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:22:38" (1/1) ... [2025-02-06 06:22:38,896 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 06:22:39,515 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--cdc_mbim.ko-entry_point.cil.out.i[161908,161921] [2025-02-06 06:22:39,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 06:22:39,946 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 06:22:40,109 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; decl %0; sete %1": "+m" (v->counter), "=qm" (c): : "memory"); [5496-5497] [2025-02-06 06:22:40,111 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; xaddb %b0, %1\n": "+q" (__ret), "+m" (v->counter): : "memory", "cc"); [5508-5509] [2025-02-06 06:22:40,115 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; xaddw %w0, %1\n": "+r" (__ret), "+m" (v->counter): : "memory", "cc"); [5512-5513] [2025-02-06 06:22:40,116 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; xaddl %0, %1\n": "+r" (__ret), "+m" (v->counter): : "memory", "cc"); [5516-5517] [2025-02-06 06:22:40,116 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; xaddq %q0, %1\n": "+r" (__ret), "+m" (v->counter): : "memory", "cc"); [5520-5521] [2025-02-06 06:22:40,120 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--cdc_mbim.ko-entry_point.cil.out.i[161908,161921] [2025-02-06 06:22:40,202 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 06:22:40,236 INFO L204 MainTranslator]: Completed translation [2025-02-06 06:22:40,236 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:22:40 WrapperNode [2025-02-06 06:22:40,237 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 06:22:40,238 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 06:22:40,238 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 06:22:40,238 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 06:22:40,243 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:22:40" (1/1) ... [2025-02-06 06:22:40,279 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:22:40" (1/1) ... [2025-02-06 06:22:40,365 INFO L138 Inliner]: procedures = 138, calls = 566, calls flagged for inlining = 62, calls inlined = 62, statements flattened = 1911 [2025-02-06 06:22:40,366 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 06:22:40,367 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 06:22:40,367 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 06:22:40,367 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 06:22:40,373 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:22:40" (1/1) ... [2025-02-06 06:22:40,373 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:22:40" (1/1) ... [2025-02-06 06:22:40,396 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:22:40" (1/1) ... [2025-02-06 06:22:40,558 INFO L175 MemorySlicer]: Split 326 memory accesses to 17 slices as follows [2, 3, 2, 7, 5, 3, 10, 8, 3, 2, 124, 14, 19, 19, 44, 53, 8]. 38 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. The 199 writes are split as follows [0, 1, 1, 6, 4, 1, 0, 0, 1, 1, 33, 12, 19, 19, 44, 53, 4]. [2025-02-06 06:22:40,558 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:22:40" (1/1) ... [2025-02-06 06:22:40,559 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:22:40" (1/1) ... [2025-02-06 06:22:40,621 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:22:40" (1/1) ... [2025-02-06 06:22:40,628 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:22:40" (1/1) ... [2025-02-06 06:22:40,639 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:22:40" (1/1) ... [2025-02-06 06:22:40,646 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:22:40" (1/1) ... [2025-02-06 06:22:40,660 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 06:22:40,661 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 06:22:40,661 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 06:22:40,661 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 06:22:40,662 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:22:40" (1/1) ... [2025-02-06 06:22:40,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 06:22:40,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 06:22:40,687 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 06:22:40,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 06:22:40,718 INFO L130 BoogieDeclarations]: Found specification of procedure usbnet_resume [2025-02-06 06:22:40,718 INFO L138 BoogieDeclarations]: Found implementation of procedure usbnet_resume [2025-02-06 06:22:40,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-02-06 06:22:40,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-02-06 06:22:40,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-02-06 06:22:40,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-02-06 06:22:40,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-02-06 06:22:40,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-02-06 06:22:40,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-02-06 06:22:40,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-02-06 06:22:40,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-02-06 06:22:40,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-02-06 06:22:40,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-02-06 06:22:40,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-02-06 06:22:40,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-02-06 06:22:40,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-02-06 06:22:40,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-02-06 06:22:40,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-02-06 06:22:40,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-02-06 06:22:40,720 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-02-06 06:22:40,720 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-02-06 06:22:40,720 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-02-06 06:22:40,720 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-02-06 06:22:40,720 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-02-06 06:22:40,720 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-02-06 06:22:40,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-02-06 06:22:40,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-02-06 06:22:40,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2025-02-06 06:22:40,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2025-02-06 06:22:40,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#10 [2025-02-06 06:22:40,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#11 [2025-02-06 06:22:40,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#12 [2025-02-06 06:22:40,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#13 [2025-02-06 06:22:40,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#14 [2025-02-06 06:22:40,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#15 [2025-02-06 06:22:40,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#16 [2025-02-06 06:22:40,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-02-06 06:22:40,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-02-06 06:22:40,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-02-06 06:22:40,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-02-06 06:22:40,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-02-06 06:22:40,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-02-06 06:22:40,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-02-06 06:22:40,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-02-06 06:22:40,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-02-06 06:22:40,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-02-06 06:22:40,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-02-06 06:22:40,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-02-06 06:22:40,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-02-06 06:22:40,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-02-06 06:22:40,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-02-06 06:22:40,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-02-06 06:22:40,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-02-06 06:22:40,721 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-02-06 06:22:40,721 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-02-06 06:22:40,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 06:22:40,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 06:22:40,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 06:22:40,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 06:22:40,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 06:22:40,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-06 06:22:40,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-06 06:22:40,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-06 06:22:40,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-06 06:22:40,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-06 06:22:40,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-06 06:22:40,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-06 06:22:40,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-02-06 06:22:40,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-02-06 06:22:40,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-02-06 06:22:40,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-02-06 06:22:40,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-02-06 06:22:40,722 INFO L130 BoogieDeclarations]: Found specification of procedure skb_headroom [2025-02-06 06:22:40,722 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_headroom [2025-02-06 06:22:40,722 INFO L130 BoogieDeclarations]: Found specification of procedure usbnet_disconnect [2025-02-06 06:22:40,722 INFO L138 BoogieDeclarations]: Found implementation of procedure usbnet_disconnect [2025-02-06 06:22:40,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#0 [2025-02-06 06:22:40,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#1 [2025-02-06 06:22:40,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#2 [2025-02-06 06:22:40,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#3 [2025-02-06 06:22:40,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#4 [2025-02-06 06:22:40,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#5 [2025-02-06 06:22:40,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#6 [2025-02-06 06:22:40,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#7 [2025-02-06 06:22:40,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#8 [2025-02-06 06:22:40,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#9 [2025-02-06 06:22:40,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#10 [2025-02-06 06:22:40,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#11 [2025-02-06 06:22:40,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#12 [2025-02-06 06:22:40,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#13 [2025-02-06 06:22:40,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#14 [2025-02-06 06:22:40,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#15 [2025-02-06 06:22:40,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#16 [2025-02-06 06:22:40,722 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#0 [2025-02-06 06:22:40,725 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#1 [2025-02-06 06:22:40,725 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#2 [2025-02-06 06:22:40,725 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#3 [2025-02-06 06:22:40,725 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#4 [2025-02-06 06:22:40,725 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#5 [2025-02-06 06:22:40,725 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#6 [2025-02-06 06:22:40,726 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#7 [2025-02-06 06:22:40,726 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#8 [2025-02-06 06:22:40,726 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#9 [2025-02-06 06:22:40,726 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#10 [2025-02-06 06:22:40,726 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#11 [2025-02-06 06:22:40,726 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#12 [2025-02-06 06:22:40,726 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#13 [2025-02-06 06:22:40,726 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#14 [2025-02-06 06:22:40,726 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#15 [2025-02-06 06:22:40,726 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#16 [2025-02-06 06:22:40,726 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-02-06 06:22:40,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-02-06 06:22:40,726 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~pm_message_t~0~TO~int [2025-02-06 06:22:40,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~pm_message_t~0~TO~int [2025-02-06 06:22:40,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 06:22:40,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 06:22:40,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 06:22:40,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 06:22:40,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 06:22:40,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-06 06:22:40,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-06 06:22:40,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-06 06:22:40,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-06 06:22:40,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-06 06:22:40,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-06 06:22:40,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-06 06:22:40,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-02-06 06:22:40,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-02-06 06:22:40,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-02-06 06:22:40,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-02-06 06:22:40,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-02-06 06:22:40,727 INFO L130 BoogieDeclarations]: Found specification of procedure cdc_mbim_suspend [2025-02-06 06:22:40,727 INFO L138 BoogieDeclarations]: Found implementation of procedure cdc_mbim_suspend [2025-02-06 06:22:40,727 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-02-06 06:22:40,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-02-06 06:22:40,727 INFO L130 BoogieDeclarations]: Found specification of procedure cdc_mbim_resume [2025-02-06 06:22:40,727 INFO L138 BoogieDeclarations]: Found implementation of procedure cdc_mbim_resume [2025-02-06 06:22:40,727 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-02-06 06:22:40,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-02-06 06:22:40,727 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_read [2025-02-06 06:22:40,727 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_read [2025-02-06 06:22:40,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-06 06:22:40,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-06 06:22:40,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-06 06:22:40,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2025-02-06 06:22:40,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2025-02-06 06:22:40,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#5 [2025-02-06 06:22:40,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#6 [2025-02-06 06:22:40,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#7 [2025-02-06 06:22:40,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#8 [2025-02-06 06:22:40,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#9 [2025-02-06 06:22:40,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#10 [2025-02-06 06:22:40,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#11 [2025-02-06 06:22:40,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#12 [2025-02-06 06:22:40,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#13 [2025-02-06 06:22:40,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#14 [2025-02-06 06:22:40,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#15 [2025-02-06 06:22:40,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#16 [2025-02-06 06:22:40,728 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-06 06:22:40,728 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-06 06:22:40,728 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-06 06:22:40,728 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2025-02-06 06:22:40,728 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2025-02-06 06:22:40,728 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#5 [2025-02-06 06:22:40,728 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#6 [2025-02-06 06:22:40,728 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#7 [2025-02-06 06:22:40,728 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#8 [2025-02-06 06:22:40,728 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#9 [2025-02-06 06:22:40,728 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#10 [2025-02-06 06:22:40,728 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#11 [2025-02-06 06:22:40,728 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#12 [2025-02-06 06:22:40,728 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#13 [2025-02-06 06:22:40,728 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#14 [2025-02-06 06:22:40,728 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#15 [2025-02-06 06:22:40,728 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#16 [2025-02-06 06:22:40,728 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 06:22:40,728 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 06:22:40,728 INFO L130 BoogieDeclarations]: Found specification of procedure cdc_mbim_tx_fixup [2025-02-06 06:22:40,728 INFO L138 BoogieDeclarations]: Found implementation of procedure cdc_mbim_tx_fixup [2025-02-06 06:22:40,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 06:22:40,728 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop___0 [2025-02-06 06:22:40,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop___0 [2025-02-06 06:22:40,728 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_get_intfdata_4 [2025-02-06 06:22:40,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_get_intfdata_4 [2025-02-06 06:22:40,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 06:22:40,729 INFO L130 BoogieDeclarations]: Found specification of procedure __dynamic_netdev_dbg [2025-02-06 06:22:40,729 INFO L138 BoogieDeclarations]: Found implementation of procedure __dynamic_netdev_dbg [2025-02-06 06:22:40,729 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2025-02-06 06:22:40,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2025-02-06 06:22:40,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 06:22:40,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 06:22:40,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 06:22:40,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-06 06:22:40,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-06 06:22:40,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-06 06:22:40,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-02-06 06:22:40,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-02-06 06:22:40,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-02-06 06:22:40,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-02-06 06:22:40,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-02-06 06:22:40,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-02-06 06:22:40,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-02-06 06:22:40,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-02-06 06:22:40,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-02-06 06:22:40,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-02-06 06:22:40,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-02-06 06:22:40,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 06:22:40,732 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2025-02-06 06:22:40,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2025-02-06 06:22:40,732 INFO L130 BoogieDeclarations]: Found specification of procedure cdc_mbim_bind [2025-02-06 06:22:40,732 INFO L138 BoogieDeclarations]: Found implementation of procedure cdc_mbim_bind [2025-02-06 06:22:40,732 INFO L130 BoogieDeclarations]: Found specification of procedure cdc_mbim_manage_power [2025-02-06 06:22:40,732 INFO L138 BoogieDeclarations]: Found implementation of procedure cdc_mbim_manage_power [2025-02-06 06:22:40,732 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2025-02-06 06:22:40,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2025-02-06 06:22:40,732 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 06:22:40,732 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 06:22:40,732 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 06:22:40,732 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-06 06:22:40,732 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-06 06:22:40,732 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-06 06:22:40,732 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-02-06 06:22:40,732 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-02-06 06:22:40,732 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-02-06 06:22:40,732 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-02-06 06:22:40,732 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-02-06 06:22:40,732 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-02-06 06:22:40,732 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-02-06 06:22:40,732 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-02-06 06:22:40,732 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-02-06 06:22:40,732 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-02-06 06:22:40,733 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-02-06 06:22:40,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 06:22:40,734 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2025-02-06 06:22:40,734 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2025-02-06 06:22:40,734 INFO L130 BoogieDeclarations]: Found specification of procedure cdc_mbim_rx_fixup [2025-02-06 06:22:40,734 INFO L138 BoogieDeclarations]: Found implementation of procedure cdc_mbim_rx_fixup [2025-02-06 06:22:40,734 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2025-02-06 06:22:40,735 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2025-02-06 06:22:40,735 INFO L130 BoogieDeclarations]: Found specification of procedure cdc_ncm_unbind [2025-02-06 06:22:40,735 INFO L138 BoogieDeclarations]: Found implementation of procedure cdc_ncm_unbind [2025-02-06 06:22:40,735 INFO L130 BoogieDeclarations]: Found specification of procedure cdc_mbim_unbind [2025-02-06 06:22:40,735 INFO L138 BoogieDeclarations]: Found implementation of procedure cdc_mbim_unbind [2025-02-06 06:22:40,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 06:22:40,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 06:22:40,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 06:22:40,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 06:22:40,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 06:22:40,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-06 06:22:40,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-06 06:22:40,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-06 06:22:40,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-06 06:22:40,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-06 06:22:40,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-06 06:22:40,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-06 06:22:40,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-06 06:22:40,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-06 06:22:40,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-06 06:22:40,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-02-06 06:22:40,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-02-06 06:22:40,736 INFO L130 BoogieDeclarations]: Found specification of procedure skb_reset_mac_header [2025-02-06 06:22:40,736 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_reset_mac_header [2025-02-06 06:22:40,736 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-02-06 06:22:40,736 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-02-06 06:22:40,736 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-02-06 06:22:40,736 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-02-06 06:22:40,736 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-02-06 06:22:40,736 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-02-06 06:22:40,736 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-02-06 06:22:40,736 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-02-06 06:22:40,736 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2025-02-06 06:22:40,736 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2025-02-06 06:22:40,736 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#10 [2025-02-06 06:22:40,736 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#11 [2025-02-06 06:22:40,736 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#12 [2025-02-06 06:22:40,736 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#13 [2025-02-06 06:22:40,736 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#14 [2025-02-06 06:22:40,736 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#15 [2025-02-06 06:22:40,736 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#16 [2025-02-06 06:22:40,736 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2025-02-06 06:22:40,736 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2025-02-06 06:22:40,736 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 06:22:40,736 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 06:22:40,736 INFO L130 BoogieDeclarations]: Found specification of procedure eth_hdr [2025-02-06 06:22:40,736 INFO L138 BoogieDeclarations]: Found implementation of procedure eth_hdr [2025-02-06 06:22:40,736 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2025-02-06 06:22:40,736 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2025-02-06 06:22:41,177 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 06:22:41,179 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 06:22:41,540 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-02-06 06:22:41,596 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7163: havoc usbnet_suspend_#t~nondet375#1; [2025-02-06 06:22:41,596 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6317: call ULTIMATE.dealloc(~#message#1.base, ~#message#1.offset);havoc ~#message#1.base, ~#message#1.offset; [2025-02-06 06:22:41,602 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5489: havoc #t~mem18; [2025-02-06 06:22:41,757 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stop___0FINAL: assume true; [2025-02-06 06:22:41,931 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7069: havoc #t~nondet355; [2025-02-06 06:22:42,321 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5669: havoc skb_end_pointer_#t~mem39#1.base, skb_end_pointer_#t~mem39#1.offset;havoc skb_end_pointer_#t~mem40#1; [2025-02-06 06:22:42,321 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6199: call ULTIMATE.dealloc(~#descriptor~1#1.base, ~#descriptor~1#1.offset);havoc ~#descriptor~1#1.base, ~#descriptor~1#1.offset;call ULTIMATE.dealloc(~#descriptor___0~0#1.base, ~#descriptor___0~0#1.offset);havoc ~#descriptor___0~0#1.base, ~#descriptor___0~0#1.offset; [2025-02-06 06:22:42,321 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7124: havoc pskb_expand_head_#t~nondet365#1; [2025-02-06 06:22:42,321 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7096: havoc cdc_ncm_rx_verify_ndp16_#t~nondet361#1; [2025-02-06 06:22:42,321 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7130: havoc skb_push_#t~ret367#1.base, skb_push_#t~ret367#1.offset; [2025-02-06 06:22:42,322 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7100: havoc cdc_ncm_rx_verify_nth16_#t~nondet362#1; [2025-02-06 06:22:42,343 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5457: havoc #t~bitwise10; [2025-02-06 06:22:42,372 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7156: havoc #t~nondet374; [2025-02-06 06:22:42,376 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5693: havoc #t~mem50.base, #t~mem50.offset;havoc #t~mem51.base, #t~mem51.offset; [2025-02-06 06:22:42,444 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6361: call ULTIMATE.dealloc(~#__constr_expr_0~0.base, ~#__constr_expr_0~0.offset);havoc ~#__constr_expr_0~0.base, ~#__constr_expr_0~0.offset; [2025-02-06 06:22:42,613 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7092: havoc cdc_ncm_fill_tx_frame_#t~ret360#1.base, cdc_ncm_fill_tx_frame_#t~ret360#1.offset; [2025-02-06 06:22:42,614 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7127: havoc skb_pull_#t~ret366#1.base, skb_pull_#t~ret366#1.offset; [2025-02-06 06:22:42,614 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6054: call ULTIMATE.dealloc(~#sign~0#1.base, ~#sign~0#1.offset);havoc ~#sign~0#1.base, ~#sign~0#1.offset;call ULTIMATE.dealloc(~#tci~0#1.base, ~#tci~0#1.offset);havoc ~#tci~0#1.base, ~#tci~0#1.offset; [2025-02-06 06:22:42,614 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7120: havoc netdev_err_#t~nondet364#1; [2025-02-06 06:22:42,673 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7104: havoc cdc_ncm_select_altsetting_#t~nondet363#1; [2025-02-06 06:22:42,674 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7138: havoc usb_cdc_wdm_register_#t~ret371#1.base, usb_cdc_wdm_register_#t~ret371#1.offset; [2025-02-06 06:22:42,674 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7089: havoc cdc_ncm_bind_common_#t~nondet359#1; [2025-02-06 06:22:42,732 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7065: havoc __dynamic_dev_dbg_#t~nondet354#1; [2025-02-06 06:22:42,732 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5918: call ULTIMATE.dealloc(~#descriptor~0#1.base, ~#descriptor~0#1.offset);havoc ~#descriptor~0#1.base, ~#descriptor~0#1.offset; [2025-02-06 06:22:47,801 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7145: havoc usb_register_driver_#t~nondet372#1; [2025-02-06 06:22:47,801 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6489: call ULTIMATE.dealloc(main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset);havoc main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset);havoc main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg5~0#1.base, main_~#ldvarg5~0#1.offset);havoc main_~#ldvarg5~0#1.base, main_~#ldvarg5~0#1.offset; [2025-02-06 06:22:47,801 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7152: havoc usbnet_probe_#t~nondet373#1; [2025-02-06 06:22:47,832 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5699: havoc skb_mac_header_#t~mem52#1.base, skb_mac_header_#t~mem52#1.offset;havoc skb_mac_header_#t~mem53#1; [2025-02-06 06:22:48,135 INFO L? ?]: Removed 1202 outVars from TransFormulas that were not future-live. [2025-02-06 06:22:48,136 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 06:22:48,176 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 06:22:48,176 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 06:22:48,176 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:22:48 BoogieIcfgContainer [2025-02-06 06:22:48,176 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 06:22:48,178 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 06:22:48,178 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 06:22:48,185 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 06:22:48,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 06:22:38" (1/3) ... [2025-02-06 06:22:48,189 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c5e0d35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:22:48, skipping insertion in model container [2025-02-06 06:22:48,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:22:40" (2/3) ... [2025-02-06 06:22:48,189 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c5e0d35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:22:48, skipping insertion in model container [2025-02-06 06:22:48,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:22:48" (3/3) ... [2025-02-06 06:22:48,190 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--cdc_mbim.ko-entry_point.cil.out.i [2025-02-06 06:22:48,212 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 06:22:48,219 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--cdc_mbim.ko-entry_point.cil.out.i that has 65 procedures, 733 locations, 1 initial locations, 53 loop locations, and 1 error locations. [2025-02-06 06:22:48,275 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 06:22:48,284 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;@113c3852, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 06:22:48,284 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 06:22:48,288 INFO L276 IsEmpty]: Start isEmpty. Operand has 604 states, 468 states have (on average 1.4166666666666667) internal successors, (663), 487 states have internal predecessors, (663), 96 states have call successors, (96), 35 states have call predecessors, (96), 33 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2025-02-06 06:22:48,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-06 06:22:48,298 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:22:48,298 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:22:48,298 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:22:48,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:22:48,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1833896614, now seen corresponding path program 1 times [2025-02-06 06:22:48,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:22:48,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67081903] [2025-02-06 06:22:48,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:22:48,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:22:49,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-06 06:22:49,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-06 06:22:49,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:22:49,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:22:50,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 06:22:50,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:22:50,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67081903] [2025-02-06 06:22:50,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67081903] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:22:50,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:22:50,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:22:50,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52808843] [2025-02-06 06:22:50,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:22:50,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:22:50,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:22:50,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:22:50,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:22:50,410 INFO L87 Difference]: Start difference. First operand has 604 states, 468 states have (on average 1.4166666666666667) internal successors, (663), 487 states have internal predecessors, (663), 96 states have call successors, (96), 35 states have call predecessors, (96), 33 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 06:22:54,454 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 06:22:54,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:22:54,983 INFO L93 Difference]: Finished difference Result 1742 states and 2514 transitions. [2025-02-06 06:22:54,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:22:54,985 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 40 [2025-02-06 06:22:54,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:22:55,001 INFO L225 Difference]: With dead ends: 1742 [2025-02-06 06:22:55,004 INFO L226 Difference]: Without dead ends: 1112 [2025-02-06 06:22:55,011 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-02-06 06:22:55,013 INFO L435 NwaCegarLoop]: 843 mSDtfsCounter, 758 mSDsluCounter, 803 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 758 SdHoareTripleChecker+Valid, 1646 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-02-06 06:22:55,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [758 Valid, 1646 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2025-02-06 06:22:55,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1112 states. [2025-02-06 06:22:55,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1112 to 1109. [2025-02-06 06:22:55,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1109 states, 884 states have (on average 1.3914027149321266) internal successors, (1230), 891 states have internal predecessors, (1230), 163 states have call successors, (163), 62 states have call predecessors, (163), 61 states have return successors, (157), 157 states have call predecessors, (157), 157 states have call successors, (157) [2025-02-06 06:22:55,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 1550 transitions. [2025-02-06 06:22:55,108 INFO L78 Accepts]: Start accepts. Automaton has 1109 states and 1550 transitions. Word has length 40 [2025-02-06 06:22:55,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:22:55,108 INFO L471 AbstractCegarLoop]: Abstraction has 1109 states and 1550 transitions. [2025-02-06 06:22:55,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 06:22:55,109 INFO L276 IsEmpty]: Start isEmpty. Operand 1109 states and 1550 transitions. [2025-02-06 06:22:55,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-06 06:22:55,112 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:22:55,113 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-06 06:22:55,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 06:22:55,113 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:22:55,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:22:55,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1242933902, now seen corresponding path program 1 times [2025-02-06 06:22:55,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:22:55,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499731118] [2025-02-06 06:22:55,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:22:55,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:22:56,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 06:22:56,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 06:22:56,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:22:56,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:22:57,121 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 06:22:57,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:22:57,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499731118] [2025-02-06 06:22:57,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499731118] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:22:57,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:22:57,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:22:57,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809281287] [2025-02-06 06:22:57,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:22:57,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:22:57,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:22:57,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:22:57,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:22:57,127 INFO L87 Difference]: Start difference. First operand 1109 states and 1550 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 06:22:57,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:22:57,309 INFO L93 Difference]: Finished difference Result 1111 states and 1551 transitions. [2025-02-06 06:22:57,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:22:57,310 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 50 [2025-02-06 06:22:57,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:22:57,319 INFO L225 Difference]: With dead ends: 1111 [2025-02-06 06:22:57,319 INFO L226 Difference]: Without dead ends: 1108 [2025-02-06 06:22:57,320 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-02-06 06:22:57,322 INFO L435 NwaCegarLoop]: 796 mSDtfsCounter, 785 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 785 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 06:22:57,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [785 Valid, 796 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 06:22:57,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1108 states. [2025-02-06 06:22:57,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1108 to 1108. [2025-02-06 06:22:57,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1108 states, 884 states have (on average 1.3902714932126696) internal successors, (1229), 890 states have internal predecessors, (1229), 162 states have call successors, (162), 62 states have call predecessors, (162), 61 states have return successors, (157), 157 states have call predecessors, (157), 157 states have call successors, (157) [2025-02-06 06:22:57,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 1108 states and 1548 transitions. [2025-02-06 06:22:57,396 INFO L78 Accepts]: Start accepts. Automaton has 1108 states and 1548 transitions. Word has length 50 [2025-02-06 06:22:57,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:22:57,396 INFO L471 AbstractCegarLoop]: Abstraction has 1108 states and 1548 transitions. [2025-02-06 06:22:57,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 06:22:57,397 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 1548 transitions. [2025-02-06 06:22:57,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-06 06:22:57,400 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:22:57,401 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-06 06:22:57,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 06:22:57,401 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:22:57,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:22:57,402 INFO L85 PathProgramCache]: Analyzing trace with hash -124150609, now seen corresponding path program 1 times [2025-02-06 06:22:57,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:22:57,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184871241] [2025-02-06 06:22:57,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:22:57,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:22:58,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-06 06:22:58,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-06 06:22:58,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:22:58,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:22:58,779 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 06:22:58,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:22:58,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184871241] [2025-02-06 06:22:58,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184871241] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:22:58,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:22:58,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:22:58,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267892100] [2025-02-06 06:22:58,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:22:58,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:22:58,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:22:58,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:22:58,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:22:58,781 INFO L87 Difference]: Start difference. First operand 1108 states and 1548 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 06:22:58,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:22:58,966 INFO L93 Difference]: Finished difference Result 1110 states and 1549 transitions. [2025-02-06 06:22:58,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:22:58,967 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 51 [2025-02-06 06:22:58,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:22:58,973 INFO L225 Difference]: With dead ends: 1110 [2025-02-06 06:22:58,974 INFO L226 Difference]: Without dead ends: 1107 [2025-02-06 06:22:58,974 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-02-06 06:22:58,975 INFO L435 NwaCegarLoop]: 794 mSDtfsCounter, 782 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 782 SdHoareTripleChecker+Valid, 794 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 06:22:58,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [782 Valid, 794 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 06:22:58,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2025-02-06 06:22:59,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 1107. [2025-02-06 06:22:59,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1107 states, 884 states have (on average 1.3891402714932126) internal successors, (1228), 889 states have internal predecessors, (1228), 161 states have call successors, (161), 62 states have call predecessors, (161), 61 states have return successors, (157), 157 states have call predecessors, (157), 157 states have call successors, (157) [2025-02-06 06:22:59,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1107 states to 1107 states and 1546 transitions. [2025-02-06 06:22:59,036 INFO L78 Accepts]: Start accepts. Automaton has 1107 states and 1546 transitions. Word has length 51 [2025-02-06 06:22:59,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:22:59,038 INFO L471 AbstractCegarLoop]: Abstraction has 1107 states and 1546 transitions. [2025-02-06 06:22:59,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 06:22:59,038 INFO L276 IsEmpty]: Start isEmpty. Operand 1107 states and 1546 transitions. [2025-02-06 06:22:59,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-06 06:22:59,043 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:22:59,043 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-06 06:22:59,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 06:22:59,044 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:22:59,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:22:59,044 INFO L85 PathProgramCache]: Analyzing trace with hash 445901487, now seen corresponding path program 1 times [2025-02-06 06:22:59,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:22:59,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638119321] [2025-02-06 06:22:59,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:22:59,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:23:00,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-06 06:23:00,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-06 06:23:00,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:23:00,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:23:00,196 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 06:23:00,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:23:00,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638119321] [2025-02-06 06:23:00,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638119321] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:23:00,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:23:00,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:23:00,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340975049] [2025-02-06 06:23:00,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:23:00,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:23:00,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:23:00,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:23:00,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:23:00,198 INFO L87 Difference]: Start difference. First operand 1107 states and 1546 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 06:23:00,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:23:00,347 INFO L93 Difference]: Finished difference Result 1109 states and 1547 transitions. [2025-02-06 06:23:00,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:23:00,348 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 52 [2025-02-06 06:23:00,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:23:00,352 INFO L225 Difference]: With dead ends: 1109 [2025-02-06 06:23:00,352 INFO L226 Difference]: Without dead ends: 1106 [2025-02-06 06:23:00,352 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-02-06 06:23:00,353 INFO L435 NwaCegarLoop]: 792 mSDtfsCounter, 779 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 779 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 06:23:00,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [779 Valid, 792 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 06:23:00,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2025-02-06 06:23:00,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 1106. [2025-02-06 06:23:00,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1106 states, 884 states have (on average 1.3880090497737556) internal successors, (1227), 888 states have internal predecessors, (1227), 160 states have call successors, (160), 62 states have call predecessors, (160), 61 states have return successors, (157), 157 states have call predecessors, (157), 157 states have call successors, (157) [2025-02-06 06:23:00,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 1544 transitions. [2025-02-06 06:23:00,384 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 1544 transitions. Word has length 52 [2025-02-06 06:23:00,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:23:00,385 INFO L471 AbstractCegarLoop]: Abstraction has 1106 states and 1544 transitions. [2025-02-06 06:23:00,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 06:23:00,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1544 transitions. [2025-02-06 06:23:00,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-06 06:23:00,387 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:23:00,387 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-06 06:23:00,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 06:23:00,388 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:23:00,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:23:00,388 INFO L85 PathProgramCache]: Analyzing trace with hash 937646256, now seen corresponding path program 1 times [2025-02-06 06:23:00,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:23:00,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315052257] [2025-02-06 06:23:00,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:23:00,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:23:01,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-06 06:23:01,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-06 06:23:01,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:23:01,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:23:01,449 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 06:23:01,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:23:01,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315052257] [2025-02-06 06:23:01,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315052257] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:23:01,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:23:01,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:23:01,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629769035] [2025-02-06 06:23:01,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:23:01,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:23:01,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:23:01,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:23:01,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:23:01,450 INFO L87 Difference]: Start difference. First operand 1106 states and 1544 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 06:23:01,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:23:01,869 INFO L93 Difference]: Finished difference Result 3263 states and 4585 transitions. [2025-02-06 06:23:01,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:23:01,869 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 53 [2025-02-06 06:23:01,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:23:01,880 INFO L225 Difference]: With dead ends: 3263 [2025-02-06 06:23:01,880 INFO L226 Difference]: Without dead ends: 2180 [2025-02-06 06:23:01,884 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-02-06 06:23:01,885 INFO L435 NwaCegarLoop]: 825 mSDtfsCounter, 771 mSDsluCounter, 760 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 771 SdHoareTripleChecker+Valid, 1585 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 06:23:01,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [771 Valid, 1585 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 06:23:01,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2180 states. [2025-02-06 06:23:01,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2180 to 2176. [2025-02-06 06:23:01,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2176 states, 1743 states have (on average 1.3901319563970167) internal successors, (2423), 1749 states have internal predecessors, (2423), 313 states have call successors, (313), 120 states have call predecessors, (313), 119 states have return successors, (318), 310 states have call predecessors, (318), 310 states have call successors, (318) [2025-02-06 06:23:01,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2176 states to 2176 states and 3054 transitions. [2025-02-06 06:23:01,967 INFO L78 Accepts]: Start accepts. Automaton has 2176 states and 3054 transitions. Word has length 53 [2025-02-06 06:23:01,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:23:01,967 INFO L471 AbstractCegarLoop]: Abstraction has 2176 states and 3054 transitions. [2025-02-06 06:23:01,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 06:23:01,967 INFO L276 IsEmpty]: Start isEmpty. Operand 2176 states and 3054 transitions. [2025-02-06 06:23:01,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-06 06:23:01,969 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:23:01,970 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-06 06:23:01,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 06:23:01,970 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:23:01,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:23:01,970 INFO L85 PathProgramCache]: Analyzing trace with hash -998136112, now seen corresponding path program 1 times [2025-02-06 06:23:01,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:23:01,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501166761] [2025-02-06 06:23:01,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:23:01,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:23:03,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-06 06:23:03,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-06 06:23:03,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:23:03,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:23:03,417 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 06:23:03,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:23:03,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501166761] [2025-02-06 06:23:03,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501166761] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:23:03,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:23:03,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:23:03,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393909690] [2025-02-06 06:23:03,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:23:03,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:23:03,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:23:03,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:23:03,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:23:03,418 INFO L87 Difference]: Start difference. First operand 2176 states and 3054 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 06:23:03,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:23:03,577 INFO L93 Difference]: Finished difference Result 2178 states and 3055 transitions. [2025-02-06 06:23:03,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:23:03,577 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 54 [2025-02-06 06:23:03,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:23:03,586 INFO L225 Difference]: With dead ends: 2178 [2025-02-06 06:23:03,587 INFO L226 Difference]: Without dead ends: 2166 [2025-02-06 06:23:03,587 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-02-06 06:23:03,588 INFO L435 NwaCegarLoop]: 791 mSDtfsCounter, 775 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 06:23:03,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 791 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 06:23:03,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2166 states. [2025-02-06 06:23:03,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2166 to 2166. [2025-02-06 06:23:03,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2166 states, 1734 states have (on average 1.389850057670127) internal successors, (2410), 1739 states have internal predecessors, (2410), 312 states have call successors, (312), 120 states have call predecessors, (312), 119 states have return successors, (318), 310 states have call predecessors, (318), 310 states have call successors, (318) [2025-02-06 06:23:03,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2166 states to 2166 states and 3040 transitions. [2025-02-06 06:23:03,661 INFO L78 Accepts]: Start accepts. Automaton has 2166 states and 3040 transitions. Word has length 54 [2025-02-06 06:23:03,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:23:03,662 INFO L471 AbstractCegarLoop]: Abstraction has 2166 states and 3040 transitions. [2025-02-06 06:23:03,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 06:23:03,662 INFO L276 IsEmpty]: Start isEmpty. Operand 2166 states and 3040 transitions. [2025-02-06 06:23:03,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-06 06:23:03,664 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:23:03,664 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:23:03,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 06:23:03,664 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:23:03,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:23:03,665 INFO L85 PathProgramCache]: Analyzing trace with hash 537067364, now seen corresponding path program 1 times [2025-02-06 06:23:03,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:23:03,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935373598] [2025-02-06 06:23:03,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:23:03,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:23:04,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-06 06:23:04,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-06 06:23:04,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:23:04,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:23:04,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 06:23:04,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:23:04,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935373598] [2025-02-06 06:23:04,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935373598] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:23:04,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:23:04,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:23:04,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177245085] [2025-02-06 06:23:04,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:23:04,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:23:04,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:23:04,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:23:04,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:23:04,735 INFO L87 Difference]: Start difference. First operand 2166 states and 3040 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-06 06:23:05,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:23:05,249 INFO L93 Difference]: Finished difference Result 5335 states and 7463 transitions. [2025-02-06 06:23:05,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:23:05,250 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 67 [2025-02-06 06:23:05,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:23:05,263 INFO L225 Difference]: With dead ends: 5335 [2025-02-06 06:23:05,263 INFO L226 Difference]: Without dead ends: 3190 [2025-02-06 06:23:05,269 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-02-06 06:23:05,270 INFO L435 NwaCegarLoop]: 790 mSDtfsCounter, 717 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 717 SdHoareTripleChecker+Valid, 1527 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 06:23:05,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [717 Valid, 1527 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 06:23:05,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3190 states. [2025-02-06 06:23:05,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3190 to 3180. [2025-02-06 06:23:05,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3180 states, 2550 states have (on average 1.3854901960784314) internal successors, (3533), 2557 states have internal predecessors, (3533), 448 states have call successors, (448), 182 states have call predecessors, (448), 181 states have return successors, (456), 446 states have call predecessors, (456), 446 states have call successors, (456) [2025-02-06 06:23:05,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3180 states to 3180 states and 4437 transitions. [2025-02-06 06:23:05,433 INFO L78 Accepts]: Start accepts. Automaton has 3180 states and 4437 transitions. Word has length 67 [2025-02-06 06:23:05,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:23:05,433 INFO L471 AbstractCegarLoop]: Abstraction has 3180 states and 4437 transitions. [2025-02-06 06:23:05,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-06 06:23:05,433 INFO L276 IsEmpty]: Start isEmpty. Operand 3180 states and 4437 transitions. [2025-02-06 06:23:05,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-06 06:23:05,435 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:23:05,435 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:23:05,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 06:23:05,435 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:23:05,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:23:05,435 INFO L85 PathProgramCache]: Analyzing trace with hash -918462290, now seen corresponding path program 1 times [2025-02-06 06:23:05,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:23:05,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061530677] [2025-02-06 06:23:05,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:23:05,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:23:06,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-06 06:23:06,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-06 06:23:06,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:23:06,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:23:06,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 06:23:06,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:23:06,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061530677] [2025-02-06 06:23:06,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061530677] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:23:06,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:23:06,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:23:06,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277769000] [2025-02-06 06:23:06,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:23:06,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:23:06,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:23:06,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:23:06,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:23:06,495 INFO L87 Difference]: Start difference. First operand 3180 states and 4437 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-06 06:23:07,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:23:07,071 INFO L93 Difference]: Finished difference Result 5484 states and 7657 transitions. [2025-02-06 06:23:07,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:23:07,071 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 65 [2025-02-06 06:23:07,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:23:07,085 INFO L225 Difference]: With dead ends: 5484 [2025-02-06 06:23:07,085 INFO L226 Difference]: Without dead ends: 2348 [2025-02-06 06:23:07,096 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-02-06 06:23:07,098 INFO L435 NwaCegarLoop]: 790 mSDtfsCounter, 203 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 1527 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 06:23:07,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 1527 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 06:23:07,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2348 states. [2025-02-06 06:23:07,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2348 to 2346. [2025-02-06 06:23:07,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2346 states, 1865 states have (on average 1.3812332439678283) internal successors, (2576), 1871 states have internal predecessors, (2576), 342 states have call successors, (342), 139 states have call predecessors, (342), 138 states have return successors, (348), 339 states have call predecessors, (348), 340 states have call successors, (348) [2025-02-06 06:23:07,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2346 states to 2346 states and 3266 transitions. [2025-02-06 06:23:07,188 INFO L78 Accepts]: Start accepts. Automaton has 2346 states and 3266 transitions. Word has length 65 [2025-02-06 06:23:07,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:23:07,189 INFO L471 AbstractCegarLoop]: Abstraction has 2346 states and 3266 transitions. [2025-02-06 06:23:07,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-06 06:23:07,189 INFO L276 IsEmpty]: Start isEmpty. Operand 2346 states and 3266 transitions. [2025-02-06 06:23:07,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-06 06:23:07,194 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:23:07,195 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 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] [2025-02-06 06:23:07,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 06:23:07,195 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:23:07,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:23:07,195 INFO L85 PathProgramCache]: Analyzing trace with hash -441043641, now seen corresponding path program 1 times [2025-02-06 06:23:07,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:23:07,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381881999] [2025-02-06 06:23:07,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:23:07,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:23:08,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-06 06:23:08,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-06 06:23:08,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:23:08,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:23:08,822 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2025-02-06 06:23:08,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:23:08,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381881999] [2025-02-06 06:23:08,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381881999] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:23:08,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:23:08,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 06:23:08,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713457218] [2025-02-06 06:23:08,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:23:08,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 06:23:08,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:23:08,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 06:23:08,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 06:23:08,823 INFO L87 Difference]: Start difference. First operand 2346 states and 3266 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 06:23:12,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 06:23:16,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:23:16,680 INFO L93 Difference]: Finished difference Result 3426 states and 4793 transitions. [2025-02-06 06:23:16,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 06:23:16,681 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 122 [2025-02-06 06:23:16,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:23:16,696 INFO L225 Difference]: With dead ends: 3426 [2025-02-06 06:23:16,696 INFO L226 Difference]: Without dead ends: 3423 [2025-02-06 06:23:16,698 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 06:23:16,698 INFO L435 NwaCegarLoop]: 1534 mSDtfsCounter, 1499 mSDsluCounter, 1223 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1499 SdHoareTripleChecker+Valid, 2757 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2025-02-06 06:23:16,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1499 Valid, 2757 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 410 Invalid, 1 Unknown, 0 Unchecked, 7.7s Time] [2025-02-06 06:23:16,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3423 states. [2025-02-06 06:23:16,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3423 to 3409. [2025-02-06 06:23:16,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3409 states, 2717 states have (on average 1.3857195436142804) internal successors, (3765), 2725 states have internal predecessors, (3765), 495 states have call successors, (495), 197 states have call predecessors, (495), 196 states have return successors, (517), 492 states have call predecessors, (517), 493 states have call successors, (517) [2025-02-06 06:23:16,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3409 states to 3409 states and 4777 transitions. [2025-02-06 06:23:16,821 INFO L78 Accepts]: Start accepts. Automaton has 3409 states and 4777 transitions. Word has length 122 [2025-02-06 06:23:16,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:23:16,822 INFO L471 AbstractCegarLoop]: Abstraction has 3409 states and 4777 transitions. [2025-02-06 06:23:16,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 06:23:16,822 INFO L276 IsEmpty]: Start isEmpty. Operand 3409 states and 4777 transitions. [2025-02-06 06:23:16,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-06 06:23:16,825 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:23:16,825 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 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] [2025-02-06 06:23:16,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 06:23:16,826 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:23:16,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:23:16,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1517698716, now seen corresponding path program 1 times [2025-02-06 06:23:16,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:23:16,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402957598] [2025-02-06 06:23:16,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:23:16,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:23:17,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-06 06:23:17,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-06 06:23:17,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:23:17,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:23:17,886 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-02-06 06:23:17,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:23:17,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402957598] [2025-02-06 06:23:17,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402957598] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:23:17,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:23:17,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:23:17,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973648110] [2025-02-06 06:23:17,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:23:17,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:23:17,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:23:17,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:23:17,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:23:17,888 INFO L87 Difference]: Start difference. First operand 3409 states and 4777 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-02-06 06:23:21,909 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 06:23:22,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:23:22,694 INFO L93 Difference]: Finished difference Result 9644 states and 13553 transitions. [2025-02-06 06:23:22,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:23:22,695 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 124 [2025-02-06 06:23:22,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:23:22,723 INFO L225 Difference]: With dead ends: 9644 [2025-02-06 06:23:22,723 INFO L226 Difference]: Without dead ends: 6438 [2025-02-06 06:23:22,736 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-02-06 06:23:22,736 INFO L435 NwaCegarLoop]: 1045 mSDtfsCounter, 727 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 15 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 727 SdHoareTripleChecker+Valid, 1777 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-02-06 06:23:22,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [727 Valid, 1777 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 59 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2025-02-06 06:23:22,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6438 states. [2025-02-06 06:23:22,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6438 to 6425. [2025-02-06 06:23:22,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6425 states, 5178 states have (on average 1.3860563924295095) internal successors, (7177), 5192 states have internal predecessors, (7177), 879 states have call successors, (879), 368 states have call predecessors, (879), 367 states have return successors, (913), 876 states have call predecessors, (913), 877 states have call successors, (913) [2025-02-06 06:23:22,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6425 states to 6425 states and 8969 transitions. [2025-02-06 06:23:22,967 INFO L78 Accepts]: Start accepts. Automaton has 6425 states and 8969 transitions. Word has length 124 [2025-02-06 06:23:22,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:23:22,967 INFO L471 AbstractCegarLoop]: Abstraction has 6425 states and 8969 transitions. [2025-02-06 06:23:22,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-02-06 06:23:22,972 INFO L276 IsEmpty]: Start isEmpty. Operand 6425 states and 8969 transitions. [2025-02-06 06:23:22,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-06 06:23:22,977 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:23:22,977 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 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] [2025-02-06 06:23:22,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 06:23:22,978 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:23:22,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:23:22,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1409460945, now seen corresponding path program 1 times [2025-02-06 06:23:22,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:23:22,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116093072] [2025-02-06 06:23:22,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:23:22,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:23:23,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-06 06:23:23,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-06 06:23:23,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:23:23,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:23:24,052 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-02-06 06:23:24,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:23:24,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116093072] [2025-02-06 06:23:24,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116093072] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:23:24,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:23:24,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:23:24,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393285738] [2025-02-06 06:23:24,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:23:24,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:23:24,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:23:24,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:23:24,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:23:24,054 INFO L87 Difference]: Start difference. First operand 6425 states and 8969 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-02-06 06:23:28,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 06:23:28,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:23:28,857 INFO L93 Difference]: Finished difference Result 18395 states and 25706 transitions. [2025-02-06 06:23:28,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:23:28,858 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 123 [2025-02-06 06:23:28,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:23:28,902 INFO L225 Difference]: With dead ends: 18395 [2025-02-06 06:23:28,902 INFO L226 Difference]: Without dead ends: 12173 [2025-02-06 06:23:28,920 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-02-06 06:23:28,920 INFO L435 NwaCegarLoop]: 1001 mSDtfsCounter, 735 mSDsluCounter, 742 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 15 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 735 SdHoareTripleChecker+Valid, 1743 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-02-06 06:23:28,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [735 Valid, 1743 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 57 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2025-02-06 06:23:28,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12173 states. [2025-02-06 06:23:29,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12173 to 12154. [2025-02-06 06:23:29,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12154 states, 9878 states have (on average 1.3836809070662077) internal successors, (13668), 9901 states have internal predecessors, (13668), 1581 states have call successors, (1581), 695 states have call predecessors, (1581), 694 states have return successors, (1627), 1575 states have call predecessors, (1627), 1579 states have call successors, (1627) [2025-02-06 06:23:29,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12154 states to 12154 states and 16876 transitions. [2025-02-06 06:23:29,311 INFO L78 Accepts]: Start accepts. Automaton has 12154 states and 16876 transitions. Word has length 123 [2025-02-06 06:23:29,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:23:29,312 INFO L471 AbstractCegarLoop]: Abstraction has 12154 states and 16876 transitions. [2025-02-06 06:23:29,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-02-06 06:23:29,312 INFO L276 IsEmpty]: Start isEmpty. Operand 12154 states and 16876 transitions. [2025-02-06 06:23:29,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-06 06:23:29,316 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:23:29,316 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 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] [2025-02-06 06:23:29,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 06:23:29,316 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:23:29,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:23:29,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1936435589, now seen corresponding path program 1 times [2025-02-06 06:23:29,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:23:29,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324888107] [2025-02-06 06:23:29,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:23:29,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:23:30,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-06 06:23:30,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-06 06:23:30,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:23:30,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:23:30,959 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2025-02-06 06:23:30,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:23:30,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324888107] [2025-02-06 06:23:30,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324888107] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:23:30,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:23:30,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 06:23:30,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854210802] [2025-02-06 06:23:30,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:23:30,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 06:23:30,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:23:30,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 06:23:30,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 06:23:30,961 INFO L87 Difference]: Start difference. First operand 12154 states and 16876 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 06:23:32,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:23:32,503 INFO L93 Difference]: Finished difference Result 16260 states and 22579 transitions. [2025-02-06 06:23:32,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 06:23:32,503 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 123 [2025-02-06 06:23:32,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:23:32,570 INFO L225 Difference]: With dead ends: 16260 [2025-02-06 06:23:32,570 INFO L226 Difference]: Without dead ends: 12241 [2025-02-06 06:23:32,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 06:23:32,585 INFO L435 NwaCegarLoop]: 787 mSDtfsCounter, 1 mSDsluCounter, 3917 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 4704 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-06 06:23:32,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 4704 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-06 06:23:32,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12241 states. [2025-02-06 06:23:33,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12241 to 12217. [2025-02-06 06:23:33,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12217 states, 9941 states have (on average 1.3804446232773362) internal successors, (13723), 9964 states have internal predecessors, (13723), 1581 states have call successors, (1581), 695 states have call predecessors, (1581), 694 states have return successors, (1627), 1575 states have call predecessors, (1627), 1579 states have call successors, (1627) [2025-02-06 06:23:33,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12217 states to 12217 states and 16931 transitions. [2025-02-06 06:23:33,144 INFO L78 Accepts]: Start accepts. Automaton has 12217 states and 16931 transitions. Word has length 123 [2025-02-06 06:23:33,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:23:33,144 INFO L471 AbstractCegarLoop]: Abstraction has 12217 states and 16931 transitions. [2025-02-06 06:23:33,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 06:23:33,144 INFO L276 IsEmpty]: Start isEmpty. Operand 12217 states and 16931 transitions. [2025-02-06 06:23:33,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-02-06 06:23:33,151 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:23:33,152 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:23:33,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 06:23:33,152 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:23:33,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:23:33,153 INFO L85 PathProgramCache]: Analyzing trace with hash -514654530, now seen corresponding path program 1 times [2025-02-06 06:23:33,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:23:33,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454667882] [2025-02-06 06:23:33,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:23:33,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:23:34,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-06 06:23:34,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-06 06:23:34,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:23:34,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:23:34,737 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2025-02-06 06:23:34,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:23:34,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454667882] [2025-02-06 06:23:34,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454667882] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:23:34,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:23:34,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 06:23:34,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592054549] [2025-02-06 06:23:34,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:23:34,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 06:23:34,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:23:34,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 06:23:34,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 06:23:34,740 INFO L87 Difference]: Start difference. First operand 12217 states and 16931 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 06:23:36,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:23:36,012 INFO L93 Difference]: Finished difference Result 16315 states and 22602 transitions. [2025-02-06 06:23:36,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 06:23:36,012 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) Word has length 140 [2025-02-06 06:23:36,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:23:36,042 INFO L225 Difference]: With dead ends: 16315 [2025-02-06 06:23:36,042 INFO L226 Difference]: Without dead ends: 8267 [2025-02-06 06:23:36,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-06 06:23:36,063 INFO L435 NwaCegarLoop]: 785 mSDtfsCounter, 43 mSDsluCounter, 3090 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 3875 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 06:23:36,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 3875 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 06:23:36,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8267 states. [2025-02-06 06:23:36,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8267 to 8251. [2025-02-06 06:23:36,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8251 states, 6714 states have (on average 1.3757819481680071) internal successors, (9237), 6730 states have internal predecessors, (9237), 1066 states have call successors, (1066), 471 states have call predecessors, (1066), 470 states have return successors, (1080), 1061 states have call predecessors, (1080), 1064 states have call successors, (1080) [2025-02-06 06:23:36,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8251 states to 8251 states and 11383 transitions. [2025-02-06 06:23:36,480 INFO L78 Accepts]: Start accepts. Automaton has 8251 states and 11383 transitions. Word has length 140 [2025-02-06 06:23:36,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:23:36,483 INFO L471 AbstractCegarLoop]: Abstraction has 8251 states and 11383 transitions. [2025-02-06 06:23:36,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 06:23:36,484 INFO L276 IsEmpty]: Start isEmpty. Operand 8251 states and 11383 transitions. [2025-02-06 06:23:36,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-06 06:23:36,503 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:23:36,503 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:23:36,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 06:23:36,504 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:23:36,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:23:36,508 INFO L85 PathProgramCache]: Analyzing trace with hash 476286720, now seen corresponding path program 1 times [2025-02-06 06:23:36,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:23:36,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484319882] [2025-02-06 06:23:36,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:23:36,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:23:37,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-06 06:23:37,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-06 06:23:37,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:23:37,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:23:38,211 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2025-02-06 06:23:38,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:23:38,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484319882] [2025-02-06 06:23:38,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484319882] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:23:38,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:23:38,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 06:23:38,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904674472] [2025-02-06 06:23:38,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:23:38,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 06:23:38,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:23:38,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 06:23:38,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 06:23:38,214 INFO L87 Difference]: Start difference. First operand 8251 states and 11383 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-06 06:23:39,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:23:39,035 INFO L93 Difference]: Finished difference Result 16473 states and 22735 transitions. [2025-02-06 06:23:39,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 06:23:39,036 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 144 [2025-02-06 06:23:39,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:23:39,067 INFO L225 Difference]: With dead ends: 16473 [2025-02-06 06:23:39,067 INFO L226 Difference]: Without dead ends: 8252 [2025-02-06 06:23:39,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 06:23:39,079 INFO L435 NwaCegarLoop]: 788 mSDtfsCounter, 0 mSDsluCounter, 1574 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2362 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 06:23:39,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2362 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 06:23:39,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8252 states. [2025-02-06 06:23:39,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8252 to 8252. [2025-02-06 06:23:39,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8252 states, 6715 states have (on average 1.3757259865971705) internal successors, (9238), 6731 states have internal predecessors, (9238), 1066 states have call successors, (1066), 471 states have call predecessors, (1066), 470 states have return successors, (1080), 1061 states have call predecessors, (1080), 1064 states have call successors, (1080) [2025-02-06 06:23:39,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8252 states to 8252 states and 11384 transitions. [2025-02-06 06:23:39,400 INFO L78 Accepts]: Start accepts. Automaton has 8252 states and 11384 transitions. Word has length 144 [2025-02-06 06:23:39,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:23:39,400 INFO L471 AbstractCegarLoop]: Abstraction has 8252 states and 11384 transitions. [2025-02-06 06:23:39,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-06 06:23:39,401 INFO L276 IsEmpty]: Start isEmpty. Operand 8252 states and 11384 transitions. [2025-02-06 06:23:39,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-06 06:23:39,411 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:23:39,411 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:23:39,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 06:23:39,412 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:23:39,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:23:39,413 INFO L85 PathProgramCache]: Analyzing trace with hash -487648609, now seen corresponding path program 1 times [2025-02-06 06:23:39,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:23:39,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393108957] [2025-02-06 06:23:39,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:23:39,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:23:40,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-06 06:23:40,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-06 06:23:40,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:23:40,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:23:41,307 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2025-02-06 06:23:41,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:23:41,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393108957] [2025-02-06 06:23:41,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393108957] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 06:23:41,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460555817] [2025-02-06 06:23:41,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:23:41,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 06:23:41,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 06:23:41,310 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 06:23:41,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 06:23:43,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-06 06:23:43,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-06 06:23:43,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:23:43,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:23:43,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 2212 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 06:23:43,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 06:23:46,456 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-02-06 06:23:46,456 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 06:23:46,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1460555817] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:23:46,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 06:23:46,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 11 [2025-02-06 06:23:46,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532885234] [2025-02-06 06:23:46,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:23:46,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 06:23:46,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:23:46,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 06:23:46,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-02-06 06:23:46,462 INFO L87 Difference]: Start difference. First operand 8252 states and 11384 transitions. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 3 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-06 06:23:50,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 06:23:54,557 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 06:23:58,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []