./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--usb--class--cdc-wdm.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--usb--class--cdc-wdm.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 4de76b02991c4f8780142b48e1370b1ba073d7148b74e77b2c83d6f21359d59e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 19:05:14,814 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 19:05:14,882 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-01-09 19:05:14,887 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 19:05:14,887 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 19:05:14,907 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 19:05:14,907 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 19:05:14,907 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 19:05:14,907 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 19:05:14,908 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 19:05:14,908 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 19:05:14,908 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 19:05:14,908 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 19:05:14,908 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 19:05:14,908 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 19:05:14,908 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 19:05:14,908 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 19:05:14,908 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 19:05:14,908 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 19:05:14,908 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 19:05:14,908 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 19:05:14,908 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 19:05:14,908 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 19:05:14,908 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 19:05:14,908 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 19:05:14,908 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 19:05:14,909 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 19:05:14,909 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 19:05:14,909 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 19:05:14,909 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 19:05:14,909 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 19:05:14,909 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 19:05:14,909 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 19:05:14,909 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 19:05:14,909 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 19:05:14,909 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 19:05:14,909 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 19:05:14,909 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 19:05:14,909 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 19:05:14,909 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 19:05:14,909 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 19:05:14,909 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 19:05:14,909 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 19:05:14,909 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 19:05:14,909 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 19:05:14,909 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 -> 4de76b02991c4f8780142b48e1370b1ba073d7148b74e77b2c83d6f21359d59e [2025-01-09 19:05:15,157 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 19:05:15,164 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 19:05:15,168 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 19:05:15,169 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 19:05:15,169 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 19:05:15,171 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--usb--class--cdc-wdm.ko-entry_point.cil.out.i [2025-01-09 19:05:16,392 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/90ebb387f/829e5bf5faa84c54906d2dda883a7066/FLAG4ae2378c9 [2025-01-09 19:05:16,850 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 19:05:16,851 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--usb--class--cdc-wdm.ko-entry_point.cil.out.i [2025-01-09 19:05:16,874 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/90ebb387f/829e5bf5faa84c54906d2dda883a7066/FLAG4ae2378c9 [2025-01-09 19:05:16,977 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/90ebb387f/829e5bf5faa84c54906d2dda883a7066 [2025-01-09 19:05:16,979 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 19:05:16,980 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 19:05:16,981 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 19:05:16,981 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 19:05:16,984 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 19:05:16,985 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 07:05:16" (1/1) ... [2025-01-09 19:05:16,985 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19d7ac6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:05:16, skipping insertion in model container [2025-01-09 19:05:16,986 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 07:05:16" (1/1) ... [2025-01-09 19:05:17,049 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 19:05:17,964 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-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--usb--class--cdc-wdm.ko-entry_point.cil.out.i[185536,185549] [2025-01-09 19:05:18,088 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 19:05:18,115 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 19:05:18,167 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; bts %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [3542] [2025-01-09 19:05:18,169 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; btr %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr)); [3549] [2025-01-09 19:05:18,170 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; bts %2, %0; setc %1": "+m" (*addr), "=qm" (c): "Ir" (nr): "memory"); [3557-3558] [2025-01-09 19:05:18,276 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-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--usb--class--cdc-wdm.ko-entry_point.cil.out.i[185536,185549] [2025-01-09 19:05:18,292 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 19:05:18,389 INFO L204 MainTranslator]: Completed translation [2025-01-09 19:05:18,389 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:05:18 WrapperNode [2025-01-09 19:05:18,390 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 19:05:18,390 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 19:05:18,390 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 19:05:18,390 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 19:05:18,394 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:05:18" (1/1) ... [2025-01-09 19:05:18,452 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:05:18" (1/1) ... [2025-01-09 19:05:18,546 INFO L138 Inliner]: procedures = 282, calls = 1556, calls flagged for inlining = 103, calls inlined = 86, statements flattened = 2839 [2025-01-09 19:05:18,547 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 19:05:18,548 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 19:05:18,548 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 19:05:18,548 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 19:05:18,555 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:05:18" (1/1) ... [2025-01-09 19:05:18,556 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:05:18" (1/1) ... [2025-01-09 19:05:18,574 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:05:18" (1/1) ... [2025-01-09 19:05:18,898 INFO L175 MemorySlicer]: Split 590 memory accesses to 22 slices as follows [2, 8, 12, 4, 4, 8, 8, 29, 7, 8, 49, 8, 8, 8, 8, 10, 56, 22, 8, 45, 276, 2]. 47 percent of accesses are in the largest equivalence class. The 180 initializations are split as follows [2, 8, 0, 4, 0, 8, 8, 0, 0, 8, 0, 8, 8, 8, 8, 10, 56, 0, 8, 0, 36, 0]. The 236 writes are split as follows [0, 0, 2, 0, 1, 0, 0, 29, 6, 0, 42, 0, 0, 0, 0, 0, 0, 22, 0, 45, 88, 1]. [2025-01-09 19:05:18,898 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:05:18" (1/1) ... [2025-01-09 19:05:18,898 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:05:18" (1/1) ... [2025-01-09 19:05:18,982 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:05:18" (1/1) ... [2025-01-09 19:05:18,987 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:05:18" (1/1) ... [2025-01-09 19:05:19,002 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:05:18" (1/1) ... [2025-01-09 19:05:19,018 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:05:18" (1/1) ... [2025-01-09 19:05:19,026 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:05:18" (1/1) ... [2025-01-09 19:05:19,048 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 19:05:19,049 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 19:05:19,049 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 19:05:19,049 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 19:05:19,050 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:05:18" (1/1) ... [2025-01-09 19:05:19,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 19:05:19,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 19:05:19,084 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-01-09 19:05:19,091 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-01-09 19:05:19,110 INFO L130 BoogieDeclarations]: Found specification of procedure usb_submit_urb [2025-01-09 19:05:19,111 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_submit_urb [2025-01-09 19:05:19,111 INFO L130 BoogieDeclarations]: Found specification of procedure usb_translate_errors [2025-01-09 19:05:19,111 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_translate_errors [2025-01-09 19:05:19,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-01-09 19:05:19,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-01-09 19:05:19,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-01-09 19:05:19,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-01-09 19:05:19,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-01-09 19:05:19,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-01-09 19:05:19,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-01-09 19:05:19,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-01-09 19:05:19,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-01-09 19:05:19,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-01-09 19:05:19,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-01-09 19:05:19,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-01-09 19:05:19,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-01-09 19:05:19,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-01-09 19:05:19,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-01-09 19:05:19,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-01-09 19:05:19,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-01-09 19:05:19,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#17 [2025-01-09 19:05:19,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#18 [2025-01-09 19:05:19,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#19 [2025-01-09 19:05:19,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#20 [2025-01-09 19:05:19,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#21 [2025-01-09 19:05:19,114 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-01-09 19:05:19,114 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-01-09 19:05:19,114 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2025-01-09 19:05:19,116 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2025-01-09 19:05:19,116 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_wdm_mutex [2025-01-09 19:05:19,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_wdm_mutex [2025-01-09 19:05:19,116 INFO L130 BoogieDeclarations]: Found specification of procedure recover_from_urb_loss [2025-01-09 19:05:19,116 INFO L138 BoogieDeclarations]: Found implementation of procedure recover_from_urb_loss [2025-01-09 19:05:19,116 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_control_urb [2025-01-09 19:05:19,116 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_control_urb [2025-01-09 19:05:19,116 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-01-09 19:05:19,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-01-09 19:05:19,116 INFO L130 BoogieDeclarations]: Found specification of procedure activate_work_1 [2025-01-09 19:05:19,116 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_work_1 [2025-01-09 19:05:19,116 INFO L130 BoogieDeclarations]: Found specification of procedure __might_sleep [2025-01-09 19:05:19,116 INFO L138 BoogieDeclarations]: Found implementation of procedure __might_sleep [2025-01-09 19:05:19,116 INFO L130 BoogieDeclarations]: Found specification of procedure usb_autopm_get_interface [2025-01-09 19:05:19,117 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_autopm_get_interface [2025-01-09 19:05:19,117 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_create [2025-01-09 19:05:19,117 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_create [2025-01-09 19:05:19,117 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2025-01-09 19:05:19,117 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2025-01-09 19:05:19,117 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-01-09 19:05:19,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-01-09 19:05:19,117 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_poll [2025-01-09 19:05:19,117 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_poll [2025-01-09 19:05:19,117 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2025-01-09 19:05:19,117 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2025-01-09 19:05:19,117 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 19:05:19,117 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 19:05:19,117 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2025-01-09 19:05:19,117 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2025-01-09 19:05:19,117 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2025-01-09 19:05:19,117 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2025-01-09 19:05:19,117 INFO L130 BoogieDeclarations]: Found specification of procedure clear_wdm_read_flag [2025-01-09 19:05:19,117 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_wdm_read_flag [2025-01-09 19:05:19,117 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_cancel_work_sync_39 [2025-01-09 19:05:19,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_cancel_work_sync_39 [2025-01-09 19:05:19,117 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_write [2025-01-09 19:05:19,117 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_write [2025-01-09 19:05:19,117 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 19:05:19,117 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2025-01-09 19:05:19,117 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2025-01-09 19:05:19,117 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_ioctl [2025-01-09 19:05:19,117 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_ioctl [2025-01-09 19:05:19,117 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_disconnect [2025-01-09 19:05:19,117 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_disconnect [2025-01-09 19:05:19,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 19:05:19,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 19:05:19,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 19:05:19,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-09 19:05:19,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-01-09 19:05:19,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-01-09 19:05:19,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-01-09 19:05:19,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-01-09 19:05:19,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-01-09 19:05:19,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-01-09 19:05:19,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-01-09 19:05:19,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-01-09 19:05:19,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-01-09 19:05:19,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-01-09 19:05:19,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-01-09 19:05:19,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-01-09 19:05:19,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-01-09 19:05:19,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-01-09 19:05:19,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-01-09 19:05:19,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2025-01-09 19:05:19,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#20 [2025-01-09 19:05:19,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#21 [2025-01-09 19:05:19,118 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_rlock_of_wdm_device [2025-01-09 19:05:19,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_rlock_of_wdm_device [2025-01-09 19:05:19,118 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2025-01-09 19:05:19,118 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2025-01-09 19:05:19,118 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_interruptible [2025-01-09 19:05:19,118 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_interruptible [2025-01-09 19:05:19,118 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_rxwork [2025-01-09 19:05:19,118 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_rxwork [2025-01-09 19:05:19,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 19:05:19,121 INFO L130 BoogieDeclarations]: Found specification of procedure disable_work_1 [2025-01-09 19:05:19,121 INFO L138 BoogieDeclarations]: Found implementation of procedure disable_work_1 [2025-01-09 19:05:19,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 19:05:19,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 19:05:19,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-09 19:05:19,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-01-09 19:05:19,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-01-09 19:05:19,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-01-09 19:05:19,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-01-09 19:05:19,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-01-09 19:05:19,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-01-09 19:05:19,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-01-09 19:05:19,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-01-09 19:05:19,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-01-09 19:05:19,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-01-09 19:05:19,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-01-09 19:05:19,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-01-09 19:05:19,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-01-09 19:05:19,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-01-09 19:05:19,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-01-09 19:05:19,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2025-01-09 19:05:19,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2025-01-09 19:05:19,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#20 [2025-01-09 19:05:19,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#21 [2025-01-09 19:05:19,122 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2025-01-09 19:05:19,122 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2025-01-09 19:05:19,122 INFO L130 BoogieDeclarations]: Found specification of procedure cancel_work_sync [2025-01-09 19:05:19,122 INFO L138 BoogieDeclarations]: Found implementation of procedure cancel_work_sync [2025-01-09 19:05:19,122 INFO L130 BoogieDeclarations]: Found specification of procedure __might_fault [2025-01-09 19:05:19,122 INFO L138 BoogieDeclarations]: Found implementation of procedure __might_fault [2025-01-09 19:05:19,122 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2025-01-09 19:05:19,122 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2025-01-09 19:05:19,122 INFO L130 BoogieDeclarations]: Found specification of procedure __mutex_init [2025-01-09 19:05:19,123 INFO L138 BoogieDeclarations]: Found implementation of procedure __mutex_init [2025-01-09 19:05:19,123 INFO L130 BoogieDeclarations]: Found specification of procedure queue_work_on [2025-01-09 19:05:19,123 INFO L138 BoogieDeclarations]: Found implementation of procedure queue_work_on [2025-01-09 19:05:19,123 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2025-01-09 19:05:19,123 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2025-01-09 19:05:19,123 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irqsave [2025-01-09 19:05:19,123 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irqsave [2025-01-09 19:05:19,123 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_wdm_mutex [2025-01-09 19:05:19,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_wdm_mutex [2025-01-09 19:05:19,123 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_wlock_of_wdm_device [2025-01-09 19:05:19,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_wlock_of_wdm_device [2025-01-09 19:05:19,123 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2025-01-09 19:05:19,123 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2025-01-09 19:05:19,123 INFO L130 BoogieDeclarations]: Found specification of procedure schedule [2025-01-09 19:05:19,123 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule [2025-01-09 19:05:19,123 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2025-01-09 19:05:19,123 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2025-01-09 19:05:19,123 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_flush [2025-01-09 19:05:19,123 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_flush [2025-01-09 19:05:19,123 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_wlock_of_wdm_device [2025-01-09 19:05:19,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_wlock_of_wdm_device [2025-01-09 19:05:19,123 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~TO~int [2025-01-09 19:05:19,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~TO~int [2025-01-09 19:05:19,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-01-09 19:05:19,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-01-09 19:05:19,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-01-09 19:05:19,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-01-09 19:05:19,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-01-09 19:05:19,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-01-09 19:05:19,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-01-09 19:05:19,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-01-09 19:05:19,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-01-09 19:05:19,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-01-09 19:05:19,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-01-09 19:05:19,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-01-09 19:05:19,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-01-09 19:05:19,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-01-09 19:05:19,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-01-09 19:05:19,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-01-09 19:05:19,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-01-09 19:05:19,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-01-09 19:05:19,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-01-09 19:05:19,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#19 [2025-01-09 19:05:19,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#20 [2025-01-09 19:05:19,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#21 [2025-01-09 19:05:19,124 INFO L130 BoogieDeclarations]: Found specification of procedure usb_autopm_put_interface [2025-01-09 19:05:19,124 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_autopm_put_interface [2025-01-09 19:05:19,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 19:05:19,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 19:05:19,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 19:05:19,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 19:05:19,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 19:05:19,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 19:05:19,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-09 19:05:19,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-01-09 19:05:19,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-01-09 19:05:19,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-01-09 19:05:19,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-01-09 19:05:19,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-01-09 19:05:19,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-01-09 19:05:19,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-01-09 19:05:19,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-01-09 19:05:19,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-01-09 19:05:19,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-01-09 19:05:19,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-01-09 19:05:19,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-01-09 19:05:19,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-01-09 19:05:19,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#20 [2025-01-09 19:05:19,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#21 [2025-01-09 19:05:19,128 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2025-01-09 19:05:19,128 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2025-01-09 19:05:19,128 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2025-01-09 19:05:19,128 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2025-01-09 19:05:19,128 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2025-01-09 19:05:19,128 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2025-01-09 19:05:19,128 INFO L130 BoogieDeclarations]: Found specification of procedure kill_urbs [2025-01-09 19:05:19,128 INFO L138 BoogieDeclarations]: Found implementation of procedure kill_urbs [2025-01-09 19:05:19,128 INFO L130 BoogieDeclarations]: Found specification of procedure prepare_to_wait_event [2025-01-09 19:05:19,128 INFO L138 BoogieDeclarations]: Found implementation of procedure prepare_to_wait_event [2025-01-09 19:05:19,128 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-01-09 19:05:19,128 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-01-09 19:05:19,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 19:05:19,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 19:05:19,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 19:05:19,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 19:05:19,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 19:05:19,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 19:05:19,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-09 19:05:19,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-01-09 19:05:19,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-01-09 19:05:19,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-01-09 19:05:19,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-01-09 19:05:19,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-01-09 19:05:19,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-01-09 19:05:19,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-01-09 19:05:19,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-01-09 19:05:19,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-01-09 19:05:19,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-01-09 19:05:19,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-01-09 19:05:19,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-01-09 19:05:19,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-01-09 19:05:19,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#20 [2025-01-09 19:05:19,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#21 [2025-01-09 19:05:19,129 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2025-01-09 19:05:19,129 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2025-01-09 19:05:19,129 INFO L130 BoogieDeclarations]: Found specification of procedure __dynamic_dev_dbg [2025-01-09 19:05:19,129 INFO L138 BoogieDeclarations]: Found implementation of procedure __dynamic_dev_dbg [2025-01-09 19:05:19,129 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irq [2025-01-09 19:05:19,129 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irq [2025-01-09 19:05:19,129 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-01-09 19:05:19,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-01-09 19:05:19,129 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2025-01-09 19:05:19,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2025-01-09 19:05:19,129 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_resume [2025-01-09 19:05:19,129 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_resume [2025-01-09 19:05:19,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 19:05:19,129 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_set_bit [2025-01-09 19:05:19,129 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_set_bit [2025-01-09 19:05:19,129 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2025-01-09 19:05:19,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2025-01-09 19:05:19,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 19:05:19,129 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2025-01-09 19:05:19,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2025-01-09 19:05:19,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 19:05:19,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 19:05:19,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 19:05:19,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-09 19:05:19,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-01-09 19:05:19,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-01-09 19:05:19,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-01-09 19:05:19,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-01-09 19:05:19,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-01-09 19:05:19,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-01-09 19:05:19,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-01-09 19:05:19,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-01-09 19:05:19,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-01-09 19:05:19,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-01-09 19:05:19,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-01-09 19:05:19,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-01-09 19:05:19,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-01-09 19:05:19,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-01-09 19:05:19,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-01-09 19:05:19,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2025-01-09 19:05:19,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#20 [2025-01-09 19:05:19,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#21 [2025-01-09 19:05:19,130 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_irq [2025-01-09 19:05:19,130 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_irq [2025-01-09 19:05:19,130 INFO L130 BoogieDeclarations]: Found specification of procedure __wake_up [2025-01-09 19:05:19,130 INFO L138 BoogieDeclarations]: Found implementation of procedure __wake_up [2025-01-09 19:05:19,130 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2025-01-09 19:05:19,132 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2025-01-09 19:05:19,132 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-01-09 19:05:19,132 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-01-09 19:05:19,132 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_rlock_of_wdm_device [2025-01-09 19:05:19,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_rlock_of_wdm_device [2025-01-09 19:05:19,133 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_work [2025-01-09 19:05:19,133 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule_work [2025-01-09 19:05:19,133 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_find_device [2025-01-09 19:05:19,133 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_find_device [2025-01-09 19:05:19,133 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2025-01-09 19:05:19,133 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2025-01-09 19:05:19,133 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2025-01-09 19:05:19,133 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2025-01-09 19:05:19,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 19:05:19,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 19:05:19,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 19:05:19,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 19:05:19,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 19:05:19,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 19:05:19,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 19:05:19,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 19:05:19,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 19:05:19,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 19:05:19,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-09 19:05:19,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-09 19:05:19,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-01-09 19:05:19,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-01-09 19:05:19,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-01-09 19:05:19,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-01-09 19:05:19,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-01-09 19:05:19,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-01-09 19:05:19,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-01-09 19:05:19,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-01-09 19:05:19,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#20 [2025-01-09 19:05:19,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#21 [2025-01-09 19:05:19,133 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2025-01-09 19:05:19,133 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2025-01-09 19:05:19,133 INFO L130 BoogieDeclarations]: Found specification of procedure finish_wait [2025-01-09 19:05:19,134 INFO L138 BoogieDeclarations]: Found implementation of procedure finish_wait [2025-01-09 19:05:19,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 19:05:19,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 19:05:19,611 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 19:05:19,614 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 19:05:19,665 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-01-09 19:05:27,073 INFO L? ?]: Removed 1104 outVars from TransFormulas that were not future-live. [2025-01-09 19:05:27,073 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 19:05:27,095 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 19:05:27,095 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 19:05:27,096 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 07:05:27 BoogieIcfgContainer [2025-01-09 19:05:27,096 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 19:05:27,097 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 19:05:27,097 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 19:05:27,100 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 19:05:27,101 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 07:05:16" (1/3) ... [2025-01-09 19:05:27,101 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@118d8833 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 07:05:27, skipping insertion in model container [2025-01-09 19:05:27,101 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:05:18" (2/3) ... [2025-01-09 19:05:27,101 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@118d8833 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 07:05:27, skipping insertion in model container [2025-01-09 19:05:27,101 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 07:05:27" (3/3) ... [2025-01-09 19:05:27,102 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-32_7a-drivers--usb--class--cdc-wdm.ko-entry_point.cil.out.i [2025-01-09 19:05:27,112 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 19:05:27,115 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linux-4.2-rc1.tar.xz-32_7a-drivers--usb--class--cdc-wdm.ko-entry_point.cil.out.i that has 74 procedures, 1133 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 19:05:27,167 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 19:05:27,175 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;@14ddc41a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 19:05:27,175 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 19:05:27,181 INFO L276 IsEmpty]: Start isEmpty. Operand has 1132 states, 742 states have (on average 1.3099730458221024) internal successors, (972), 779 states have internal predecessors, (972), 316 states have call successors, (316), 73 states have call predecessors, (316), 72 states have return successors, (311), 308 states have call predecessors, (311), 311 states have call successors, (311) [2025-01-09 19:05:27,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-01-09 19:05:27,192 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 19:05:27,192 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 19:05:27,193 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 19:05:27,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 19:05:27,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1853318001, now seen corresponding path program 1 times [2025-01-09 19:05:27,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 19:05:27,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860349039] [2025-01-09 19:05:27,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 19:05:27,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 19:05:28,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-01-09 19:05:28,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-01-09 19:05:28,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 19:05:28,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 19:05:29,038 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2025-01-09 19:05:29,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 19:05:29,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860349039] [2025-01-09 19:05:29,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860349039] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 19:05:29,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122054146] [2025-01-09 19:05:29,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 19:05:29,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 19:05:29,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 19:05:29,042 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-01-09 19:05:29,044 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-01-09 19:05:30,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-01-09 19:05:30,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-01-09 19:05:30,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 19:05:30,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 19:05:30,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 3146 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 19:05:30,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 19:05:30,619 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 19:05:30,620 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 19:05:30,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122054146] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 19:05:30,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 19:05:30,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 19:05:30,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063873058] [2025-01-09 19:05:30,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 19:05:30,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 19:05:30,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 19:05:30,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 19:05:30,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 19:05:30,638 INFO L87 Difference]: Start difference. First operand has 1132 states, 742 states have (on average 1.3099730458221024) internal successors, (972), 779 states have internal predecessors, (972), 316 states have call successors, (316), 73 states have call predecessors, (316), 72 states have return successors, (311), 308 states have call predecessors, (311), 311 states have call successors, (311) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 19:05:30,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 19:05:30,761 INFO L93 Difference]: Finished difference Result 2259 states and 3245 transitions. [2025-01-09 19:05:30,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 19:05:30,763 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 192 [2025-01-09 19:05:30,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 19:05:30,782 INFO L225 Difference]: With dead ends: 2259 [2025-01-09 19:05:30,782 INFO L226 Difference]: Without dead ends: 1120 [2025-01-09 19:05:30,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 19:05:30,792 INFO L435 NwaCegarLoop]: 1577 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1577 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 19:05:30,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1577 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 19:05:30,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2025-01-09 19:05:30,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 1120. [2025-01-09 19:05:30,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1120 states, 737 states have (on average 1.294436906377205) internal successors, (954), 767 states have internal predecessors, (954), 311 states have call successors, (311), 72 states have call predecessors, (311), 71 states have return successors, (297), 294 states have call predecessors, (297), 297 states have call successors, (297) [2025-01-09 19:05:30,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1120 states to 1120 states and 1562 transitions. [2025-01-09 19:05:30,896 INFO L78 Accepts]: Start accepts. Automaton has 1120 states and 1562 transitions. Word has length 192 [2025-01-09 19:05:30,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 19:05:30,896 INFO L471 AbstractCegarLoop]: Abstraction has 1120 states and 1562 transitions. [2025-01-09 19:05:30,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 19:05:30,896 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states and 1562 transitions. [2025-01-09 19:05:30,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-01-09 19:05:30,904 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 19:05:30,904 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 19:05:30,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 19:05:31,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 19:05:31,105 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 19:05:31,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 19:05:31,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1284361343, now seen corresponding path program 1 times [2025-01-09 19:05:31,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 19:05:31,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075789762] [2025-01-09 19:05:31,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 19:05:31,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 19:05:32,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-01-09 19:05:32,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-01-09 19:05:32,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 19:05:32,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 19:05:32,541 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 474 trivial. 0 not checked. [2025-01-09 19:05:32,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 19:05:32,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075789762] [2025-01-09 19:05:32,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075789762] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 19:05:32,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 19:05:32,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 19:05:32,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809662114] [2025-01-09 19:05:32,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 19:05:32,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 19:05:32,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 19:05:32,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 19:05:32,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 19:05:32,545 INFO L87 Difference]: Start difference. First operand 1120 states and 1562 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 19:05:36,575 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-01-09 19:05:36,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 19:05:36,773 INFO L93 Difference]: Finished difference Result 3250 states and 4535 transitions. [2025-01-09 19:05:36,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 19:05:36,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 192 [2025-01-09 19:05:36,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 19:05:36,786 INFO L225 Difference]: With dead ends: 3250 [2025-01-09 19:05:36,786 INFO L226 Difference]: Without dead ends: 2171 [2025-01-09 19:05:36,790 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-01-09 19:05:36,791 INFO L435 NwaCegarLoop]: 1572 mSDtfsCounter, 1467 mSDsluCounter, 1543 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1467 SdHoareTripleChecker+Valid, 3115 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-01-09 19:05:36,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1467 Valid, 3115 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-01-09 19:05:36,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2171 states. [2025-01-09 19:05:36,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2171 to 2161. [2025-01-09 19:05:36,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2161 states, 1430 states have (on average 1.2965034965034965) internal successors, (1854), 1477 states have internal predecessors, (1854), 589 states have call successors, (589), 142 states have call predecessors, (589), 141 states have return successors, (575), 569 states have call predecessors, (575), 575 states have call successors, (575) [2025-01-09 19:05:36,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2161 states to 2161 states and 3018 transitions. [2025-01-09 19:05:36,891 INFO L78 Accepts]: Start accepts. Automaton has 2161 states and 3018 transitions. Word has length 192 [2025-01-09 19:05:36,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 19:05:36,892 INFO L471 AbstractCegarLoop]: Abstraction has 2161 states and 3018 transitions. [2025-01-09 19:05:36,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 19:05:36,892 INFO L276 IsEmpty]: Start isEmpty. Operand 2161 states and 3018 transitions. [2025-01-09 19:05:36,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-01-09 19:05:36,896 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 19:05:36,896 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 19:05:36,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 19:05:36,896 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 19:05:36,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 19:05:36,897 INFO L85 PathProgramCache]: Analyzing trace with hash -395241132, now seen corresponding path program 1 times [2025-01-09 19:05:36,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 19:05:36,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142932381] [2025-01-09 19:05:36,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 19:05:36,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 19:05:37,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-01-09 19:05:37,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-01-09 19:05:37,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 19:05:37,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 19:05:37,909 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 474 trivial. 0 not checked. [2025-01-09 19:05:37,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 19:05:37,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142932381] [2025-01-09 19:05:37,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142932381] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 19:05:37,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 19:05:37,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 19:05:37,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107139285] [2025-01-09 19:05:37,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 19:05:37,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 19:05:37,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 19:05:37,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 19:05:37,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 19:05:37,910 INFO L87 Difference]: Start difference. First operand 2161 states and 3018 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 19:05:38,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 19:05:38,225 INFO L93 Difference]: Finished difference Result 5457 states and 7531 transitions. [2025-01-09 19:05:38,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 19:05:38,227 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 195 [2025-01-09 19:05:38,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 19:05:38,246 INFO L225 Difference]: With dead ends: 5457 [2025-01-09 19:05:38,247 INFO L226 Difference]: Without dead ends: 3337 [2025-01-09 19:05:38,255 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-01-09 19:05:38,255 INFO L435 NwaCegarLoop]: 1591 mSDtfsCounter, 846 mSDsluCounter, 1466 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 846 SdHoareTripleChecker+Valid, 3057 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 19:05:38,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [846 Valid, 3057 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 19:05:38,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3337 states. [2025-01-09 19:05:38,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3337 to 3313. [2025-01-09 19:05:38,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3313 states, 2203 states have (on average 1.2846118928733545) internal successors, (2830), 2262 states have internal predecessors, (2830), 862 states have call successors, (862), 248 states have call predecessors, (862), 247 states have return successors, (848), 836 states have call predecessors, (848), 848 states have call successors, (848) [2025-01-09 19:05:38,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3313 states to 3313 states and 4540 transitions. [2025-01-09 19:05:38,350 INFO L78 Accepts]: Start accepts. Automaton has 3313 states and 4540 transitions. Word has length 195 [2025-01-09 19:05:38,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 19:05:38,351 INFO L471 AbstractCegarLoop]: Abstraction has 3313 states and 4540 transitions. [2025-01-09 19:05:38,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 19:05:38,351 INFO L276 IsEmpty]: Start isEmpty. Operand 3313 states and 4540 transitions. [2025-01-09 19:05:38,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-01-09 19:05:38,353 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 19:05:38,353 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 19:05:38,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 19:05:38,353 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 19:05:38,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 19:05:38,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1679970968, now seen corresponding path program 1 times [2025-01-09 19:05:38,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 19:05:38,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937157341] [2025-01-09 19:05:38,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 19:05:38,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 19:05:39,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-01-09 19:05:39,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-01-09 19:05:39,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 19:05:39,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 19:05:39,348 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 474 trivial. 0 not checked. [2025-01-09 19:05:39,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 19:05:39,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937157341] [2025-01-09 19:05:39,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937157341] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 19:05:39,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 19:05:39,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 19:05:39,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754167205] [2025-01-09 19:05:39,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 19:05:39,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 19:05:39,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 19:05:39,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 19:05:39,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 19:05:39,350 INFO L87 Difference]: Start difference. First operand 3313 states and 4540 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 19:05:39,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 19:05:39,632 INFO L93 Difference]: Finished difference Result 8236 states and 11269 transitions. [2025-01-09 19:05:39,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 19:05:39,632 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 217 [2025-01-09 19:05:39,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 19:05:39,656 INFO L225 Difference]: With dead ends: 8236 [2025-01-09 19:05:39,657 INFO L226 Difference]: Without dead ends: 4974 [2025-01-09 19:05:39,669 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-01-09 19:05:39,670 INFO L435 NwaCegarLoop]: 2153 mSDtfsCounter, 1057 mSDsluCounter, 1481 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1057 SdHoareTripleChecker+Valid, 3634 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 19:05:39,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1057 Valid, 3634 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 19:05:39,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4974 states. [2025-01-09 19:05:39,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4974 to 4947. [2025-01-09 19:05:39,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4947 states, 3316 states have (on average 1.2892038600723763) internal successors, (4275), 3405 states have internal predecessors, (4275), 1250 states have call successors, (1250), 381 states have call predecessors, (1250), 380 states have return successors, (1236), 1220 states have call predecessors, (1236), 1236 states have call successors, (1236) [2025-01-09 19:05:39,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4947 states to 4947 states and 6761 transitions. [2025-01-09 19:05:39,843 INFO L78 Accepts]: Start accepts. Automaton has 4947 states and 6761 transitions. Word has length 217 [2025-01-09 19:05:39,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 19:05:39,843 INFO L471 AbstractCegarLoop]: Abstraction has 4947 states and 6761 transitions. [2025-01-09 19:05:39,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 19:05:39,843 INFO L276 IsEmpty]: Start isEmpty. Operand 4947 states and 6761 transitions. [2025-01-09 19:05:39,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-01-09 19:05:39,846 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 19:05:39,846 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 19:05:39,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 19:05:39,846 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 19:05:39,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 19:05:39,847 INFO L85 PathProgramCache]: Analyzing trace with hash 499138021, now seen corresponding path program 1 times [2025-01-09 19:05:39,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 19:05:39,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190560082] [2025-01-09 19:05:39,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 19:05:39,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 19:05:40,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-01-09 19:05:40,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-01-09 19:05:40,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 19:05:40,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 19:05:40,847 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 572 trivial. 0 not checked. [2025-01-09 19:05:40,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 19:05:40,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190560082] [2025-01-09 19:05:40,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190560082] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 19:05:40,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 19:05:40,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 19:05:40,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079934165] [2025-01-09 19:05:40,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 19:05:40,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 19:05:40,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 19:05:40,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 19:05:40,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 19:05:40,848 INFO L87 Difference]: Start difference. First operand 4947 states and 6761 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 19:05:40,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 19:05:40,923 INFO L93 Difference]: Finished difference Result 4949 states and 6762 transitions. [2025-01-09 19:05:40,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 19:05:40,924 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 212 [2025-01-09 19:05:40,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 19:05:40,946 INFO L225 Difference]: With dead ends: 4949 [2025-01-09 19:05:40,946 INFO L226 Difference]: Without dead ends: 4946 [2025-01-09 19:05:40,951 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-01-09 19:05:40,952 INFO L435 NwaCegarLoop]: 1559 mSDtfsCounter, 1508 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1508 SdHoareTripleChecker+Valid, 1559 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 19:05:40,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1508 Valid, 1559 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 19:05:40,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4946 states. [2025-01-09 19:05:41,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4946 to 4946. [2025-01-09 19:05:41,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4946 states, 3316 states have (on average 1.2889022919179736) internal successors, (4274), 3404 states have internal predecessors, (4274), 1249 states have call successors, (1249), 381 states have call predecessors, (1249), 380 states have return successors, (1236), 1220 states have call predecessors, (1236), 1236 states have call successors, (1236) [2025-01-09 19:05:41,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4946 states to 4946 states and 6759 transitions. [2025-01-09 19:05:41,108 INFO L78 Accepts]: Start accepts. Automaton has 4946 states and 6759 transitions. Word has length 212 [2025-01-09 19:05:41,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 19:05:41,109 INFO L471 AbstractCegarLoop]: Abstraction has 4946 states and 6759 transitions. [2025-01-09 19:05:41,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 19:05:41,109 INFO L276 IsEmpty]: Start isEmpty. Operand 4946 states and 6759 transitions. [2025-01-09 19:05:41,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-01-09 19:05:41,111 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 19:05:41,111 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 19:05:41,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 19:05:41,111 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 19:05:41,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 19:05:41,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1707055152, now seen corresponding path program 1 times [2025-01-09 19:05:41,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 19:05:41,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881523613] [2025-01-09 19:05:41,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 19:05:41,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 19:05:41,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-01-09 19:05:41,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-01-09 19:05:41,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 19:05:41,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 19:05:42,107 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 572 trivial. 0 not checked. [2025-01-09 19:05:42,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 19:05:42,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881523613] [2025-01-09 19:05:42,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881523613] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 19:05:42,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 19:05:42,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 19:05:42,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265223721] [2025-01-09 19:05:42,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 19:05:42,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 19:05:42,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 19:05:42,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 19:05:42,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 19:05:42,108 INFO L87 Difference]: Start difference. First operand 4946 states and 6759 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 19:05:42,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 19:05:42,196 INFO L93 Difference]: Finished difference Result 4948 states and 6760 transitions. [2025-01-09 19:05:42,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 19:05:42,200 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), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 213 [2025-01-09 19:05:42,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 19:05:42,226 INFO L225 Difference]: With dead ends: 4948 [2025-01-09 19:05:42,226 INFO L226 Difference]: Without dead ends: 4945 [2025-01-09 19:05:42,230 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-01-09 19:05:42,231 INFO L435 NwaCegarLoop]: 1557 mSDtfsCounter, 1505 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1505 SdHoareTripleChecker+Valid, 1557 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 19:05:42,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1505 Valid, 1557 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 19:05:42,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4945 states. [2025-01-09 19:05:42,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4945 to 4945. [2025-01-09 19:05:42,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4945 states, 3316 states have (on average 1.2886007237635706) internal successors, (4273), 3403 states have internal predecessors, (4273), 1248 states have call successors, (1248), 381 states have call predecessors, (1248), 380 states have return successors, (1236), 1220 states have call predecessors, (1236), 1236 states have call successors, (1236) [2025-01-09 19:05:42,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4945 states to 4945 states and 6757 transitions. [2025-01-09 19:05:42,398 INFO L78 Accepts]: Start accepts. Automaton has 4945 states and 6757 transitions. Word has length 213 [2025-01-09 19:05:42,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 19:05:42,399 INFO L471 AbstractCegarLoop]: Abstraction has 4945 states and 6757 transitions. [2025-01-09 19:05:42,399 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), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 19:05:42,399 INFO L276 IsEmpty]: Start isEmpty. Operand 4945 states and 6757 transitions. [2025-01-09 19:05:42,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-01-09 19:05:42,401 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 19:05:42,402 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 19:05:42,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 19:05:42,402 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 19:05:42,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 19:05:42,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1379561912, now seen corresponding path program 1 times [2025-01-09 19:05:42,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 19:05:42,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058503729] [2025-01-09 19:05:42,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 19:05:42,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 19:05:43,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-01-09 19:05:43,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-01-09 19:05:43,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 19:05:43,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 19:05:43,708 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 572 trivial. 0 not checked. [2025-01-09 19:05:43,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 19:05:43,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058503729] [2025-01-09 19:05:43,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058503729] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 19:05:43,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 19:05:43,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 19:05:43,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646000039] [2025-01-09 19:05:43,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 19:05:43,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 19:05:43,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 19:05:43,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 19:05:43,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 19:05:43,710 INFO L87 Difference]: Start difference. First operand 4945 states and 6757 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 19:05:43,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 19:05:43,806 INFO L93 Difference]: Finished difference Result 4947 states and 6758 transitions. [2025-01-09 19:05:43,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 19:05:43,806 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 214 [2025-01-09 19:05:43,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 19:05:43,830 INFO L225 Difference]: With dead ends: 4947 [2025-01-09 19:05:43,830 INFO L226 Difference]: Without dead ends: 4944 [2025-01-09 19:05:43,835 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-01-09 19:05:43,836 INFO L435 NwaCegarLoop]: 1555 mSDtfsCounter, 1502 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1502 SdHoareTripleChecker+Valid, 1555 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 19:05:43,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1502 Valid, 1555 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 19:05:43,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4944 states. [2025-01-09 19:05:43,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4944 to 4944. [2025-01-09 19:05:43,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4944 states, 3316 states have (on average 1.2882991556091676) internal successors, (4272), 3402 states have internal predecessors, (4272), 1247 states have call successors, (1247), 381 states have call predecessors, (1247), 380 states have return successors, (1236), 1220 states have call predecessors, (1236), 1236 states have call successors, (1236) [2025-01-09 19:05:43,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4944 states to 4944 states and 6755 transitions. [2025-01-09 19:05:44,002 INFO L78 Accepts]: Start accepts. Automaton has 4944 states and 6755 transitions. Word has length 214 [2025-01-09 19:05:44,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 19:05:44,003 INFO L471 AbstractCegarLoop]: Abstraction has 4944 states and 6755 transitions. [2025-01-09 19:05:44,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 19:05:44,004 INFO L276 IsEmpty]: Start isEmpty. Operand 4944 states and 6755 transitions. [2025-01-09 19:05:44,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-01-09 19:05:44,008 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 19:05:44,008 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 19:05:44,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 19:05:44,008 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 19:05:44,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 19:05:44,009 INFO L85 PathProgramCache]: Analyzing trace with hash 182798803, now seen corresponding path program 1 times [2025-01-09 19:05:44,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 19:05:44,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882140801] [2025-01-09 19:05:44,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 19:05:44,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 19:05:44,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-01-09 19:05:44,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-01-09 19:05:44,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 19:05:44,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 19:05:44,919 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 572 trivial. 0 not checked. [2025-01-09 19:05:44,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 19:05:44,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882140801] [2025-01-09 19:05:44,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882140801] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 19:05:44,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 19:05:44,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 19:05:44,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451880895] [2025-01-09 19:05:44,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 19:05:44,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 19:05:44,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 19:05:44,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 19:05:44,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 19:05:44,920 INFO L87 Difference]: Start difference. First operand 4944 states and 6755 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 19:05:45,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 19:05:45,238 INFO L93 Difference]: Finished difference Result 14469 states and 19777 transitions. [2025-01-09 19:05:45,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 19:05:45,239 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), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 215 [2025-01-09 19:05:45,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 19:05:45,282 INFO L225 Difference]: With dead ends: 14469 [2025-01-09 19:05:45,283 INFO L226 Difference]: Without dead ends: 9580 [2025-01-09 19:05:45,300 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-01-09 19:05:45,301 INFO L435 NwaCegarLoop]: 1932 mSDtfsCounter, 1458 mSDsluCounter, 1436 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1458 SdHoareTripleChecker+Valid, 3368 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 19:05:45,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1458 Valid, 3368 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 19:05:45,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9580 states. [2025-01-09 19:05:45,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9580 to 9544. [2025-01-09 19:05:45,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9544 states, 6442 states have (on average 1.2916796026078858) internal successors, (8321), 6618 states have internal predecessors, (8321), 2363 states have call successors, (2363), 748 states have call predecessors, (2363), 738 states have return successors, (2350), 2290 states have call predecessors, (2350), 2350 states have call successors, (2350) [2025-01-09 19:05:45,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9544 states to 9544 states and 13034 transitions. [2025-01-09 19:05:45,602 INFO L78 Accepts]: Start accepts. Automaton has 9544 states and 13034 transitions. Word has length 215 [2025-01-09 19:05:45,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 19:05:45,602 INFO L471 AbstractCegarLoop]: Abstraction has 9544 states and 13034 transitions. [2025-01-09 19:05:45,602 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), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 19:05:45,602 INFO L276 IsEmpty]: Start isEmpty. Operand 9544 states and 13034 transitions. [2025-01-09 19:05:45,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-01-09 19:05:45,604 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 19:05:45,604 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 19:05:45,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 19:05:45,605 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 19:05:45,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 19:05:45,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1371345579, now seen corresponding path program 1 times [2025-01-09 19:05:45,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 19:05:45,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143759216] [2025-01-09 19:05:45,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 19:05:45,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 19:05:46,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-01-09 19:05:46,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-01-09 19:05:46,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 19:05:46,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 19:05:46,502 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 572 trivial. 0 not checked. [2025-01-09 19:05:46,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 19:05:46,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143759216] [2025-01-09 19:05:46,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143759216] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 19:05:46,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 19:05:46,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 19:05:46,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479273090] [2025-01-09 19:05:46,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 19:05:46,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 19:05:46,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 19:05:46,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 19:05:46,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 19:05:46,504 INFO L87 Difference]: Start difference. First operand 9544 states and 13034 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 19:05:46,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 19:05:46,714 INFO L93 Difference]: Finished difference Result 10556 states and 13982 transitions. [2025-01-09 19:05:46,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 19:05:46,715 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 216 [2025-01-09 19:05:46,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 19:05:46,745 INFO L225 Difference]: With dead ends: 10556 [2025-01-09 19:05:46,745 INFO L226 Difference]: Without dead ends: 10552 [2025-01-09 19:05:46,749 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-01-09 19:05:46,750 INFO L435 NwaCegarLoop]: 1585 mSDtfsCounter, 1288 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1288 SdHoareTripleChecker+Valid, 1935 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 19:05:46,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1288 Valid, 1935 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 19:05:46,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10552 states. [2025-01-09 19:05:47,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10552 to 10546. [2025-01-09 19:05:47,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10546 states, 7154 states have (on average 1.2728543472183393) internal successors, (9106), 7324 states have internal predecessors, (9106), 2433 states have call successors, (2433), 972 states have call predecessors, (2433), 958 states have return successors, (2422), 2362 states have call predecessors, (2422), 2422 states have call successors, (2422) [2025-01-09 19:05:47,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10546 states to 10546 states and 13961 transitions. [2025-01-09 19:05:47,229 INFO L78 Accepts]: Start accepts. Automaton has 10546 states and 13961 transitions. Word has length 216 [2025-01-09 19:05:47,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 19:05:47,230 INFO L471 AbstractCegarLoop]: Abstraction has 10546 states and 13961 transitions. [2025-01-09 19:05:47,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 19:05:47,230 INFO L276 IsEmpty]: Start isEmpty. Operand 10546 states and 13961 transitions. [2025-01-09 19:05:47,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-01-09 19:05:47,232 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 19:05:47,232 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 19:05:47,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 19:05:47,233 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 19:05:47,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 19:05:47,235 INFO L85 PathProgramCache]: Analyzing trace with hash -438405162, now seen corresponding path program 1 times [2025-01-09 19:05:47,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 19:05:47,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714069882] [2025-01-09 19:05:47,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 19:05:47,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 19:05:48,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-01-09 19:05:48,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-01-09 19:05:48,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 19:05:48,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 19:05:48,201 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 572 trivial. 0 not checked. [2025-01-09 19:05:48,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 19:05:48,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714069882] [2025-01-09 19:05:48,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714069882] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 19:05:48,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 19:05:48,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 19:05:48,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345417780] [2025-01-09 19:05:48,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 19:05:48,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 19:05:48,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 19:05:48,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 19:05:48,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 19:05:48,204 INFO L87 Difference]: Start difference. First operand 10546 states and 13961 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 19:05:48,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 19:05:48,727 INFO L93 Difference]: Finished difference Result 29889 states and 39798 transitions. [2025-01-09 19:05:48,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 19:05:48,727 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 217 [2025-01-09 19:05:48,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 19:05:48,792 INFO L225 Difference]: With dead ends: 29889 [2025-01-09 19:05:48,792 INFO L226 Difference]: Without dead ends: 19388 [2025-01-09 19:05:48,825 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-01-09 19:05:48,825 INFO L435 NwaCegarLoop]: 1696 mSDtfsCounter, 1445 mSDsluCounter, 1357 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1445 SdHoareTripleChecker+Valid, 3053 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 19:05:48,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1445 Valid, 3053 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 19:05:48,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19388 states. [2025-01-09 19:05:49,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19388 to 19247. [2025-01-09 19:05:49,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19247 states, 13151 states have (on average 1.2818797049654018) internal successors, (16858), 13491 states have internal predecessors, (16858), 4388 states have call successors, (4388), 1752 states have call predecessors, (4388), 1707 states have return successors, (4406), 4201 states have call predecessors, (4406), 4374 states have call successors, (4406) [2025-01-09 19:05:49,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19247 states to 19247 states and 25652 transitions. [2025-01-09 19:05:49,516 INFO L78 Accepts]: Start accepts. Automaton has 19247 states and 25652 transitions. Word has length 217 [2025-01-09 19:05:49,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 19:05:49,516 INFO L471 AbstractCegarLoop]: Abstraction has 19247 states and 25652 transitions. [2025-01-09 19:05:49,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 19:05:49,516 INFO L276 IsEmpty]: Start isEmpty. Operand 19247 states and 25652 transitions. [2025-01-09 19:05:49,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2025-01-09 19:05:49,522 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 19:05:49,523 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 19:05:49,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 19:05:49,523 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 19:05:49,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 19:05:49,524 INFO L85 PathProgramCache]: Analyzing trace with hash -2125931412, now seen corresponding path program 1 times [2025-01-09 19:05:49,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 19:05:49,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933550811] [2025-01-09 19:05:49,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 19:05:49,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 19:05:50,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 279 statements into 1 equivalence classes. [2025-01-09 19:05:50,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 279 of 279 statements. [2025-01-09 19:05:50,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 19:05:50,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 19:05:50,666 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 810 trivial. 0 not checked. [2025-01-09 19:05:50,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 19:05:50,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933550811] [2025-01-09 19:05:50,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933550811] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 19:05:50,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 19:05:50,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 19:05:50,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102019480] [2025-01-09 19:05:50,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 19:05:50,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 19:05:50,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 19:05:50,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 19:05:50,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 19:05:50,668 INFO L87 Difference]: Start difference. First operand 19247 states and 25652 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2025-01-09 19:05:54,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 19:05:56,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 19:05:56,145 INFO L93 Difference]: Finished difference Result 48146 states and 63991 transitions. [2025-01-09 19:05:56,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 19:05:56,146 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 279 [2025-01-09 19:05:56,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 19:05:56,259 INFO L225 Difference]: With dead ends: 48146 [2025-01-09 19:05:56,259 INFO L226 Difference]: Without dead ends: 28954 [2025-01-09 19:05:56,306 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-01-09 19:05:56,307 INFO L435 NwaCegarLoop]: 2288 mSDtfsCounter, 1188 mSDsluCounter, 1424 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 20 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1188 SdHoareTripleChecker+Valid, 3712 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-01-09 19:05:56,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1188 Valid, 3712 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 44 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2025-01-09 19:05:56,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28954 states. [2025-01-09 19:05:57,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28954 to 28879. [2025-01-09 19:05:57,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28879 states, 19875 states have (on average 1.2768805031446542) internal successors, (25378), 20379 states have internal predecessors, (25378), 6363 states have call successors, (6363), 2709 states have call predecessors, (6363), 2640 states have return successors, (6381), 6094 states have call predecessors, (6381), 6349 states have call successors, (6381) [2025-01-09 19:05:57,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28879 states to 28879 states and 38122 transitions. [2025-01-09 19:05:57,361 INFO L78 Accepts]: Start accepts. Automaton has 28879 states and 38122 transitions. Word has length 279 [2025-01-09 19:05:57,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 19:05:57,361 INFO L471 AbstractCegarLoop]: Abstraction has 28879 states and 38122 transitions. [2025-01-09 19:05:57,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2025-01-09 19:05:57,362 INFO L276 IsEmpty]: Start isEmpty. Operand 28879 states and 38122 transitions. [2025-01-09 19:05:57,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-01-09 19:05:57,366 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 19:05:57,367 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 19:05:57,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 19:05:57,367 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 19:05:57,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 19:05:57,367 INFO L85 PathProgramCache]: Analyzing trace with hash -866913899, now seen corresponding path program 1 times [2025-01-09 19:05:57,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 19:05:57,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227320728] [2025-01-09 19:05:57,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 19:05:57,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 19:05:58,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-01-09 19:05:58,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-01-09 19:05:58,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 19:05:58,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 19:05:58,683 INFO L134 CoverageAnalysis]: Checked inductivity of 575 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 572 trivial. 0 not checked. [2025-01-09 19:05:58,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 19:05:58,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227320728] [2025-01-09 19:05:58,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227320728] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 19:05:58,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 19:05:58,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 19:05:58,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807343029] [2025-01-09 19:05:58,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 19:05:58,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 19:05:58,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 19:05:58,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 19:05:58,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 19:05:58,685 INFO L87 Difference]: Start difference. First operand 28879 states and 38122 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-01-09 19:06:02,710 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-01-09 19:06:03,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 19:06:03,452 INFO L93 Difference]: Finished difference Result 43649 states and 57582 transitions. [2025-01-09 19:06:03,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 19:06:03,452 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 274 [2025-01-09 19:06:03,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 19:06:03,509 INFO L225 Difference]: With dead ends: 43649 [2025-01-09 19:06:03,509 INFO L226 Difference]: Without dead ends: 14822 [2025-01-09 19:06:03,559 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-01-09 19:06:03,560 INFO L435 NwaCegarLoop]: 1562 mSDtfsCounter, 12 mSDsluCounter, 1546 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 3108 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-01-09 19:06:03,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 3108 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-01-09 19:06:03,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14822 states. [2025-01-09 19:06:03,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14822 to 14627. [2025-01-09 19:06:03,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14627 states, 10068 states have (on average 1.2785061581247517) internal successors, (12872), 10325 states have internal predecessors, (12872), 3220 states have call successors, (3220), 1374 states have call predecessors, (3220), 1338 states have return successors, (3222), 3081 states have call predecessors, (3222), 3206 states have call successors, (3222) [2025-01-09 19:06:03,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14627 states to 14627 states and 19314 transitions. [2025-01-09 19:06:04,007 INFO L78 Accepts]: Start accepts. Automaton has 14627 states and 19314 transitions. Word has length 274 [2025-01-09 19:06:04,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 19:06:04,008 INFO L471 AbstractCegarLoop]: Abstraction has 14627 states and 19314 transitions. [2025-01-09 19:06:04,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-01-09 19:06:04,008 INFO L276 IsEmpty]: Start isEmpty. Operand 14627 states and 19314 transitions. [2025-01-09 19:06:04,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2025-01-09 19:06:04,011 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 19:06:04,012 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 19:06:04,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 19:06:04,012 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 19:06:04,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 19:06:04,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1635185326, now seen corresponding path program 1 times [2025-01-09 19:06:04,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 19:06:04,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81893727] [2025-01-09 19:06:04,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 19:06:04,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 19:06:05,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-01-09 19:06:05,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-01-09 19:06:05,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 19:06:05,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 19:06:05,305 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 813 trivial. 0 not checked. [2025-01-09 19:06:05,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 19:06:05,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81893727] [2025-01-09 19:06:05,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81893727] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 19:06:05,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 19:06:05,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 19:06:05,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726360934] [2025-01-09 19:06:05,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 19:06:05,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 19:06:05,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 19:06:05,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 19:06:05,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 19:06:05,307 INFO L87 Difference]: Start difference. First operand 14627 states and 19314 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-01-09 19:06:09,330 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-01-09 19:06:09,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 19:06:09,791 INFO L93 Difference]: Finished difference Result 14635 states and 19320 transitions. [2025-01-09 19:06:09,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 19:06:09,792 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 286 [2025-01-09 19:06:09,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 19:06:09,836 INFO L225 Difference]: With dead ends: 14635 [2025-01-09 19:06:09,836 INFO L226 Difference]: Without dead ends: 14632 [2025-01-09 19:06:09,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-01-09 19:06:09,841 INFO L435 NwaCegarLoop]: 1632 mSDtfsCounter, 336 mSDsluCounter, 1341 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 2973 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-01-09 19:06:09,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 2973 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-01-09 19:06:09,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14632 states. [2025-01-09 19:06:10,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14632 to 14626. [2025-01-09 19:06:10,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14626 states, 10068 states have (on average 1.2772149384187526) internal successors, (12859), 10324 states have internal predecessors, (12859), 3219 states have call successors, (3219), 1374 states have call predecessors, (3219), 1338 states have return successors, (3222), 3081 states have call predecessors, (3222), 3206 states have call successors, (3222) [2025-01-09 19:06:10,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14626 states to 14626 states and 19300 transitions. [2025-01-09 19:06:10,257 INFO L78 Accepts]: Start accepts. Automaton has 14626 states and 19300 transitions. Word has length 286 [2025-01-09 19:06:10,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 19:06:10,257 INFO L471 AbstractCegarLoop]: Abstraction has 14626 states and 19300 transitions. [2025-01-09 19:06:10,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-01-09 19:06:10,257 INFO L276 IsEmpty]: Start isEmpty. Operand 14626 states and 19300 transitions. [2025-01-09 19:06:10,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-01-09 19:06:10,261 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 19:06:10,261 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 19:06:10,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 19:06:10,262 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 19:06:10,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 19:06:10,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1973743778, now seen corresponding path program 1 times [2025-01-09 19:06:10,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 19:06:10,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201452120] [2025-01-09 19:06:10,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 19:06:10,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 19:06:11,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-01-09 19:06:11,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-01-09 19:06:11,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 19:06:11,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 19:06:11,597 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 810 trivial. 0 not checked. [2025-01-09 19:06:11,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 19:06:11,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201452120] [2025-01-09 19:06:11,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201452120] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 19:06:11,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 19:06:11,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 19:06:11,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037438981] [2025-01-09 19:06:11,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 19:06:11,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 19:06:11,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 19:06:11,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 19:06:11,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 19:06:11,600 INFO L87 Difference]: Start difference. First operand 14626 states and 19300 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 3 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) [2025-01-09 19:06:15,624 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-01-09 19:06:16,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 19:06:16,689 INFO L93 Difference]: Finished difference Result 34197 states and 45108 transitions. [2025-01-09 19:06:16,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 19:06:16,690 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 3 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) Word has length 307 [2025-01-09 19:06:16,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 19:06:16,771 INFO L225 Difference]: With dead ends: 34197 [2025-01-09 19:06:16,771 INFO L226 Difference]: Without dead ends: 19735 [2025-01-09 19:06:16,811 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-01-09 19:06:16,812 INFO L435 NwaCegarLoop]: 1993 mSDtfsCounter, 1197 mSDsluCounter, 1322 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1197 SdHoareTripleChecker+Valid, 3315 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-01-09 19:06:16,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1197 Valid, 3315 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 26 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-01-09 19:06:16,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19735 states. [2025-01-09 19:06:17,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19735 to 19680. [2025-01-09 19:06:17,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19680 states, 13654 states have (on average 1.2797714955324446) internal successors, (17474), 14008 states have internal predecessors, (17474), 4197 states have call successors, (4197), 1868 states have call predecessors, (4197), 1828 states have return successors, (4208), 4025 states have call predecessors, (4208), 4184 states have call successors, (4208) [2025-01-09 19:06:17,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19680 states to 19680 states and 25879 transitions. [2025-01-09 19:06:17,655 INFO L78 Accepts]: Start accepts. Automaton has 19680 states and 25879 transitions. Word has length 307 [2025-01-09 19:06:17,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 19:06:17,656 INFO L471 AbstractCegarLoop]: Abstraction has 19680 states and 25879 transitions. [2025-01-09 19:06:17,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 3 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) [2025-01-09 19:06:17,656 INFO L276 IsEmpty]: Start isEmpty. Operand 19680 states and 25879 transitions. [2025-01-09 19:06:17,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2025-01-09 19:06:17,661 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 19:06:17,661 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 19:06:17,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 19:06:17,661 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 19:06:17,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 19:06:17,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1345043305, now seen corresponding path program 1 times [2025-01-09 19:06:17,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 19:06:17,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144799997] [2025-01-09 19:06:17,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 19:06:17,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 19:06:18,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-01-09 19:06:18,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-01-09 19:06:18,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 19:06:18,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 19:06:18,708 INFO L134 CoverageAnalysis]: Checked inductivity of 816 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 816 trivial. 0 not checked. [2025-01-09 19:06:18,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 19:06:18,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144799997] [2025-01-09 19:06:18,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144799997] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 19:06:18,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 19:06:18,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 19:06:18,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895099430] [2025-01-09 19:06:18,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 19:06:18,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 19:06:18,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 19:06:18,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 19:06:18,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 19:06:18,713 INFO L87 Difference]: Start difference. First operand 19680 states and 25879 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 3 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-01-09 19:06:22,735 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-01-09 19:06:23,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 19:06:23,308 INFO L93 Difference]: Finished difference Result 39208 states and 51570 transitions. [2025-01-09 19:06:23,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 19:06:23,309 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 3 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 312 [2025-01-09 19:06:23,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 19:06:23,387 INFO L225 Difference]: With dead ends: 39208 [2025-01-09 19:06:23,388 INFO L226 Difference]: Without dead ends: 19692 [2025-01-09 19:06:23,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-01-09 19:06:23,431 INFO L435 NwaCegarLoop]: 2632 mSDtfsCounter, 1349 mSDsluCounter, 1490 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1349 SdHoareTripleChecker+Valid, 4122 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-01-09 19:06:23,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1349 Valid, 4122 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-01-09 19:06:23,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19692 states. [2025-01-09 19:06:24,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19692 to 19585. [2025-01-09 19:06:24,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19585 states, 13583 states have (on average 1.2771847161893544) internal successors, (17348), 13953 states have internal predecessors, (17348), 4178 states have call successors, (4178), 1848 states have call predecessors, (4178), 1823 states have return successors, (4161), 4005 states have call predecessors, (4161), 4149 states have call successors, (4161) [2025-01-09 19:06:24,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19585 states to 19585 states and 25687 transitions. [2025-01-09 19:06:24,127 INFO L78 Accepts]: Start accepts. Automaton has 19585 states and 25687 transitions. Word has length 312 [2025-01-09 19:06:24,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 19:06:24,127 INFO L471 AbstractCegarLoop]: Abstraction has 19585 states and 25687 transitions. [2025-01-09 19:06:24,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 3 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-01-09 19:06:24,128 INFO L276 IsEmpty]: Start isEmpty. Operand 19585 states and 25687 transitions. [2025-01-09 19:06:24,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2025-01-09 19:06:24,132 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 19:06:24,132 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 19:06:24,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 19:06:24,133 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 19:06:24,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 19:06:24,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1242140226, now seen corresponding path program 1 times [2025-01-09 19:06:24,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 19:06:24,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055801875] [2025-01-09 19:06:24,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 19:06:24,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 19:06:24,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 319 statements into 1 equivalence classes. [2025-01-09 19:06:24,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 319 of 319 statements. [2025-01-09 19:06:24,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 19:06:24,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 19:06:25,486 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 813 trivial. 0 not checked. [2025-01-09 19:06:25,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 19:06:25,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055801875] [2025-01-09 19:06:25,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055801875] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 19:06:25,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 19:06:25,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 19:06:25,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95674585] [2025-01-09 19:06:25,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 19:06:25,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 19:06:25,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 19:06:25,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 19:06:25,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 19:06:25,488 INFO L87 Difference]: Start difference. First operand 19585 states and 25687 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-01-09 19:06:26,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 19:06:26,079 INFO L93 Difference]: Finished difference Result 20380 states and 26467 transitions. [2025-01-09 19:06:26,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 19:06:26,079 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 319 [2025-01-09 19:06:26,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 19:06:26,149 INFO L225 Difference]: With dead ends: 20380 [2025-01-09 19:06:26,150 INFO L226 Difference]: Without dead ends: 18903 [2025-01-09 19:06:26,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 19:06:26,161 INFO L435 NwaCegarLoop]: 1560 mSDtfsCounter, 7 mSDsluCounter, 4651 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 6211 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 19:06:26,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 6211 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 19:06:26,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18903 states. [2025-01-09 19:06:26,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18903 to 18759. [2025-01-09 19:06:26,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18759 states, 13074 states have (on average 1.2739788893988069) internal successors, (16656), 13396 states have internal predecessors, (16656), 3899 states have call successors, (3899), 1810 states have call predecessors, (3899), 1785 states have return successors, (3884), 3761 states have call predecessors, (3884), 3872 states have call successors, (3884) [2025-01-09 19:06:26,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18759 states to 18759 states and 24439 transitions. [2025-01-09 19:06:26,738 INFO L78 Accepts]: Start accepts. Automaton has 18759 states and 24439 transitions. Word has length 319 [2025-01-09 19:06:26,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 19:06:26,738 INFO L471 AbstractCegarLoop]: Abstraction has 18759 states and 24439 transitions. [2025-01-09 19:06:26,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-01-09 19:06:26,739 INFO L276 IsEmpty]: Start isEmpty. Operand 18759 states and 24439 transitions. [2025-01-09 19:06:26,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2025-01-09 19:06:26,744 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 19:06:26,745 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 19:06:26,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 19:06:26,745 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 19:06:26,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 19:06:26,746 INFO L85 PathProgramCache]: Analyzing trace with hash 326160760, now seen corresponding path program 1 times [2025-01-09 19:06:26,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 19:06:26,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403080025] [2025-01-09 19:06:26,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 19:06:26,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 19:06:27,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 319 statements into 1 equivalence classes. [2025-01-09 19:06:27,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 319 of 319 statements. [2025-01-09 19:06:27,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 19:06:27,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 19:06:27,689 INFO L134 CoverageAnalysis]: Checked inductivity of 823 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 823 trivial. 0 not checked. [2025-01-09 19:06:27,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 19:06:27,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403080025] [2025-01-09 19:06:27,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403080025] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 19:06:27,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 19:06:27,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 19:06:27,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971172186] [2025-01-09 19:06:27,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 19:06:27,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 19:06:27,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 19:06:27,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 19:06:27,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 19:06:27,690 INFO L87 Difference]: Start difference. First operand 18759 states and 24439 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-01-09 19:06:28,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 19:06:28,160 INFO L93 Difference]: Finished difference Result 37366 states and 48691 transitions. [2025-01-09 19:06:28,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 19:06:28,160 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 319 [2025-01-09 19:06:28,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 19:06:28,233 INFO L225 Difference]: With dead ends: 37366 [2025-01-09 19:06:28,233 INFO L226 Difference]: Without dead ends: 18771 [2025-01-09 19:06:28,270 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-01-09 19:06:28,270 INFO L435 NwaCegarLoop]: 1549 mSDtfsCounter, 0 mSDsluCounter, 1543 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3092 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 19:06:28,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3092 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 19:06:28,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18771 states. [2025-01-09 19:06:28,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18771 to 18771. [2025-01-09 19:06:28,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18771 states, 13086 states have (on average 1.2737276478679505) internal successors, (16668), 13408 states have internal predecessors, (16668), 3899 states have call successors, (3899), 1810 states have call predecessors, (3899), 1785 states have return successors, (3884), 3761 states have call predecessors, (3884), 3872 states have call successors, (3884) [2025-01-09 19:06:28,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18771 states to 18771 states and 24451 transitions. [2025-01-09 19:06:28,841 INFO L78 Accepts]: Start accepts. Automaton has 18771 states and 24451 transitions. Word has length 319 [2025-01-09 19:06:28,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 19:06:28,841 INFO L471 AbstractCegarLoop]: Abstraction has 18771 states and 24451 transitions. [2025-01-09 19:06:28,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-01-09 19:06:28,842 INFO L276 IsEmpty]: Start isEmpty. Operand 18771 states and 24451 transitions. [2025-01-09 19:06:28,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2025-01-09 19:06:28,846 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 19:06:28,847 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 19:06:28,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 19:06:28,847 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 19:06:28,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 19:06:28,847 INFO L85 PathProgramCache]: Analyzing trace with hash 270720334, now seen corresponding path program 1 times [2025-01-09 19:06:28,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 19:06:28,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346659516] [2025-01-09 19:06:28,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 19:06:28,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 19:06:29,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 320 statements into 1 equivalence classes. [2025-01-09 19:06:29,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 320 of 320 statements. [2025-01-09 19:06:29,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 19:06:29,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 19:06:29,930 INFO L134 CoverageAnalysis]: Checked inductivity of 823 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 823 trivial. 0 not checked. [2025-01-09 19:06:29,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 19:06:29,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346659516] [2025-01-09 19:06:29,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346659516] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 19:06:29,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 19:06:29,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 19:06:29,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452156976] [2025-01-09 19:06:29,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 19:06:29,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 19:06:29,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 19:06:29,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 19:06:29,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 19:06:29,932 INFO L87 Difference]: Start difference. First operand 18771 states and 24451 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 3 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) [2025-01-09 19:06:31,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 19:06:31,018 INFO L93 Difference]: Finished difference Result 37491 states and 48882 transitions. [2025-01-09 19:06:31,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 19:06:31,019 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 3 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) Word has length 320 [2025-01-09 19:06:31,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 19:06:31,091 INFO L225 Difference]: With dead ends: 37491 [2025-01-09 19:06:31,092 INFO L226 Difference]: Without dead ends: 18884 [2025-01-09 19:06:31,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 19:06:31,128 INFO L435 NwaCegarLoop]: 1590 mSDtfsCounter, 25 mSDsluCounter, 4662 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 6252 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 19:06:31,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 6252 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 19:06:31,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18884 states. [2025-01-09 19:06:31,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18884 to 18801. [2025-01-09 19:06:31,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18801 states, 13098 states have (on average 1.2727897388914338) internal successors, (16671), 13423 states have internal predecessors, (16671), 3917 states have call successors, (3917), 1810 states have call predecessors, (3917), 1785 states have return successors, (3902), 3776 states have call predecessors, (3902), 3890 states have call successors, (3902) [2025-01-09 19:06:31,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18801 states to 18801 states and 24490 transitions. [2025-01-09 19:06:31,827 INFO L78 Accepts]: Start accepts. Automaton has 18801 states and 24490 transitions. Word has length 320 [2025-01-09 19:06:31,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 19:06:31,827 INFO L471 AbstractCegarLoop]: Abstraction has 18801 states and 24490 transitions. [2025-01-09 19:06:31,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 3 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) [2025-01-09 19:06:31,828 INFO L276 IsEmpty]: Start isEmpty. Operand 18801 states and 24490 transitions. [2025-01-09 19:06:31,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2025-01-09 19:06:31,832 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 19:06:31,833 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 19:06:31,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 19:06:31,833 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 19:06:31,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 19:06:31,833 INFO L85 PathProgramCache]: Analyzing trace with hash -142780654, now seen corresponding path program 1 times [2025-01-09 19:06:31,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 19:06:31,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363863913] [2025-01-09 19:06:31,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 19:06:31,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 19:06:32,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 321 statements into 1 equivalence classes. [2025-01-09 19:06:32,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 321 of 321 statements. [2025-01-09 19:06:32,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 19:06:32,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 19:06:32,895 INFO L134 CoverageAnalysis]: Checked inductivity of 823 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 823 trivial. 0 not checked. [2025-01-09 19:06:32,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 19:06:32,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363863913] [2025-01-09 19:06:32,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363863913] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 19:06:32,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 19:06:32,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 19:06:32,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787931996] [2025-01-09 19:06:32,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 19:06:32,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 19:06:32,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 19:06:32,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 19:06:32,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 19:06:32,897 INFO L87 Difference]: Start difference. First operand 18801 states and 24490 transitions. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 3 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-01-09 19:06:34,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 19:06:34,009 INFO L93 Difference]: Finished difference Result 37524 states and 48915 transitions. [2025-01-09 19:06:34,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 19:06:34,009 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 3 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 321 [2025-01-09 19:06:34,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 19:06:34,088 INFO L225 Difference]: With dead ends: 37524 [2025-01-09 19:06:34,088 INFO L226 Difference]: Without dead ends: 18887 [2025-01-09 19:06:34,121 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 19:06:34,122 INFO L435 NwaCegarLoop]: 1594 mSDtfsCounter, 18 mSDsluCounter, 4672 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 6266 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 19:06:34,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 6266 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 19:06:34,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18887 states. [2025-01-09 19:06:34,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18887 to 18876. [2025-01-09 19:06:34,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18876 states, 13137 states have (on average 1.2722082667275634) internal successors, (16713), 13462 states have internal predecessors, (16713), 3953 states have call successors, (3953), 1810 states have call predecessors, (3953), 1785 states have return successors, (3938), 3812 states have call predecessors, (3938), 3926 states have call successors, (3938) [2025-01-09 19:06:34,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18876 states to 18876 states and 24604 transitions. [2025-01-09 19:06:34,682 INFO L78 Accepts]: Start accepts. Automaton has 18876 states and 24604 transitions. Word has length 321 [2025-01-09 19:06:34,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 19:06:34,683 INFO L471 AbstractCegarLoop]: Abstraction has 18876 states and 24604 transitions. [2025-01-09 19:06:34,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 3 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-01-09 19:06:34,683 INFO L276 IsEmpty]: Start isEmpty. Operand 18876 states and 24604 transitions. [2025-01-09 19:06:34,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2025-01-09 19:06:34,688 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 19:06:34,688 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 19:06:34,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 19:06:34,688 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 19:06:34,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 19:06:34,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1162938262, now seen corresponding path program 1 times [2025-01-09 19:06:34,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 19:06:34,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777937035] [2025-01-09 19:06:34,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 19:06:34,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 19:06:35,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 322 statements into 1 equivalence classes. [2025-01-09 19:06:35,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 322 of 322 statements. [2025-01-09 19:06:35,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 19:06:35,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 19:06:35,849 INFO L134 CoverageAnalysis]: Checked inductivity of 823 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 823 trivial. 0 not checked. [2025-01-09 19:06:35,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 19:06:35,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777937035] [2025-01-09 19:06:35,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777937035] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 19:06:35,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 19:06:35,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 19:06:35,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321893864] [2025-01-09 19:06:35,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 19:06:35,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 19:06:35,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 19:06:35,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 19:06:35,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 19:06:35,853 INFO L87 Difference]: Start difference. First operand 18876 states and 24604 transitions. Second operand has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 3 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28)