./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-consumption/linux-3.8-rc1-32_7a-drivers--media--usb--ttusb-dec--ttusb_dec.ko-ldv_main0.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-consumption/linux-3.8-rc1-32_7a-drivers--media--usb--ttusb-dec--ttusb_dec.ko-ldv_main0.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 106df4f5c2a241158f9b42d6bacea5fef4152f7015c080096ac6f687357e10b4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 18:25:21,537 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 18:25:21,609 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-01-09 18:25:21,614 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 18:25:21,619 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 18:25:21,643 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 18:25:21,644 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 18:25:21,644 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 18:25:21,644 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 18:25:21,644 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 18:25:21,644 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 18:25:21,645 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 18:25:21,645 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 18:25:21,645 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 18:25:21,645 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 18:25:21,645 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 18:25:21,645 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 18:25:21,645 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 18:25:21,645 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 18:25:21,646 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 18:25:21,646 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 18:25:21,646 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 18:25:21,646 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 18:25:21,646 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 18:25:21,646 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 18:25:21,646 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 18:25:21,646 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 18:25:21,646 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 18:25:21,646 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 18:25:21,646 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 18:25:21,647 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 18:25:21,647 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 18:25:21,647 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 18:25:21,647 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 18:25:21,647 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 18:25:21,647 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 18:25:21,647 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 18:25:21,647 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 18:25:21,647 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 18:25:21,647 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 18:25:21,647 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 18:25:21,647 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 18:25:21,647 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 18:25:21,648 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 18:25:21,648 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 18:25:21,648 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 -> 106df4f5c2a241158f9b42d6bacea5fef4152f7015c080096ac6f687357e10b4 [2025-01-09 18:25:21,901 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 18:25:21,908 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 18:25:21,910 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 18:25:21,911 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 18:25:21,912 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 18:25:21,913 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-consumption/linux-3.8-rc1-32_7a-drivers--media--usb--ttusb-dec--ttusb_dec.ko-ldv_main0.cil.out.i [2025-01-09 18:25:23,147 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/660cc077f/e3b40eaafb3545f0ada96b852e488e97/FLAG44628f1ec [2025-01-09 18:25:23,733 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 18:25:23,734 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-consumption/linux-3.8-rc1-32_7a-drivers--media--usb--ttusb-dec--ttusb_dec.ko-ldv_main0.cil.out.i [2025-01-09 18:25:23,780 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/660cc077f/e3b40eaafb3545f0ada96b852e488e97/FLAG44628f1ec [2025-01-09 18:25:24,238 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/660cc077f/e3b40eaafb3545f0ada96b852e488e97 [2025-01-09 18:25:24,240 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 18:25:24,241 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 18:25:24,242 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 18:25:24,242 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 18:25:24,250 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 18:25:24,251 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:25:24" (1/1) ... [2025-01-09 18:25:24,251 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12158f00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:25:24, skipping insertion in model container [2025-01-09 18:25:24,251 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:25:24" (1/1) ... [2025-01-09 18:25:24,320 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 18:25:25,800 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-consumption/linux-3.8-rc1-32_7a-drivers--media--usb--ttusb-dec--ttusb_dec.ko-ldv_main0.cil.out.i[247200,247213] [2025-01-09 18:25:25,895 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 18:25:25,909 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 18:25:26,029 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"); [6103] [2025-01-09 18:25:26,032 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,%1\n\tsbb %0,%0": "=r" (oldbit), "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [6111-6112] [2025-01-09 18:25:26,033 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("bswapl %0": "=r" (val): "0" (val)); [6119] [2025-01-09 18:25:26,035 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"/work/ldvuser/exper_fp/inst/current/envs/linux-3.10-rc1.tar/linux-3.10-rc1/arch/x86/include/asm/paravirt.h"), "i" (824), "i" (12UL)); [6179-6180] [2025-01-09 18:25:26,035 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("771:\n\tcall *%c2;\n772:\n.pushsection .parainstructions,\"a\"\n .balign 8 \n .quad 771b\n .byte %c1\n .byte 772b-771b\n .short %c3\n.popsection\n": "=a" (__eax): [paravirt_typenum] "i" (44UL), [paravirt_opptr] "i" (& pv_irq_ops.save_fl.func), [paravirt_clobber] "i" (1): "memory", "cc"); [6185-6187] [2025-01-09 18:25:26,181 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-consumption/linux-3.8-rc1-32_7a-drivers--media--usb--ttusb-dec--ttusb_dec.ko-ldv_main0.cil.out.i[247200,247213] [2025-01-09 18:25:26,190 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 18:25:26,226 INFO L204 MainTranslator]: Completed translation [2025-01-09 18:25:26,227 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:25:26 WrapperNode [2025-01-09 18:25:26,227 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 18:25:26,228 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 18:25:26,228 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 18:25:26,228 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 18:25:26,233 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:25:26" (1/1) ... [2025-01-09 18:25:26,289 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:25:26" (1/1) ... [2025-01-09 18:25:26,404 INFO L138 Inliner]: procedures = 216, calls = 1507, calls flagged for inlining = 108, calls inlined = 97, statements flattened = 3386 [2025-01-09 18:25:26,405 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 18:25:26,406 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 18:25:26,406 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 18:25:26,406 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 18:25:26,414 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:25:26" (1/1) ... [2025-01-09 18:25:26,414 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:25:26" (1/1) ... [2025-01-09 18:25:26,441 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:25:26" (1/1) ... [2025-01-09 18:25:26,869 INFO L175 MemorySlicer]: Split 587 memory accesses to 18 slices as follows [2, 3, 1, 8, 4, 415, 1, 8, 3, 110, 2, 1, 8, 5, 8, 1, 2, 5]. 71 percent of accesses are in the largest equivalence class. The 129 initializations are split as follows [2, 0, 0, 0, 0, 0, 0, 8, 0, 110, 0, 1, 8, 0, 0, 0, 0, 0]. The 239 writes are split as follows [0, 1, 0, 1, 2, 231, 0, 0, 2, 0, 0, 0, 0, 0, 2, 0, 0, 0]. [2025-01-09 18:25:26,869 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:25:26" (1/1) ... [2025-01-09 18:25:26,870 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:25:26" (1/1) ... [2025-01-09 18:25:26,965 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:25:26" (1/1) ... [2025-01-09 18:25:26,975 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:25:26" (1/1) ... [2025-01-09 18:25:26,992 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:25:26" (1/1) ... [2025-01-09 18:25:27,012 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:25:26" (1/1) ... [2025-01-09 18:25:27,025 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:25:26" (1/1) ... [2025-01-09 18:25:27,057 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 18:25:27,058 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 18:25:27,058 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 18:25:27,058 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 18:25:27,059 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:25:26" (1/1) ... [2025-01-09 18:25:27,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 18:25:27,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:25:27,094 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 18:25:27,100 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 18:25:27,121 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab32 [2025-01-09 18:25:27,122 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab32 [2025-01-09 18:25:27,122 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_free_iso_urbs [2025-01-09 18:25:27,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_free_iso_urbs [2025-01-09 18:25:27,122 INFO L130 BoogieDeclarations]: Found specification of procedure usb_submit_urb [2025-01-09 18:25:27,122 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_submit_urb [2025-01-09 18:25:27,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-01-09 18:25:27,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-01-09 18:25:27,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-01-09 18:25:27,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-01-09 18:25:27,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-01-09 18:25:27,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-01-09 18:25:27,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-01-09 18:25:27,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-01-09 18:25:27,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2025-01-09 18:25:27,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2025-01-09 18:25:27,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#10 [2025-01-09 18:25:27,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#11 [2025-01-09 18:25:27,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#12 [2025-01-09 18:25:27,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#13 [2025-01-09 18:25:27,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#14 [2025-01-09 18:25:27,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#15 [2025-01-09 18:25:27,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#16 [2025-01-09 18:25:27,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#17 [2025-01-09 18:25:27,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-01-09 18:25:27,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-01-09 18:25:27,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-01-09 18:25:27,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-01-09 18:25:27,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-01-09 18:25:27,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-01-09 18:25:27,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-01-09 18:25:27,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-01-09 18:25:27,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-01-09 18:25:27,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-01-09 18:25:27,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-01-09 18:25:27,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-01-09 18:25:27,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-01-09 18:25:27,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-01-09 18:25:27,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-01-09 18:25:27,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-01-09 18:25:27,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-01-09 18:25:27,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#17 [2025-01-09 18:25:27,127 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_interface [2025-01-09 18:25:27,127 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_interface [2025-01-09 18:25:27,127 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_unregister_adapter [2025-01-09 18:25:27,127 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_unregister_adapter [2025-01-09 18:25:27,127 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-01-09 18:25:27,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-01-09 18:25:27,127 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_iso_mutex_of_ttusb_dec [2025-01-09 18:25:27,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_iso_mutex_of_ttusb_dec [2025-01-09 18:25:27,127 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_start_iso_xfer [2025-01-09 18:25:27,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_start_iso_xfer [2025-01-09 18:25:27,127 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2025-01-09 18:25:27,127 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2025-01-09 18:25:27,127 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-01-09 18:25:27,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-01-09 18:25:27,127 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_usb_mutex_of_ttusb_dec [2025-01-09 18:25:27,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_usb_mutex_of_ttusb_dec [2025-01-09 18:25:27,127 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_dmx_release [2025-01-09 18:25:27,127 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_dmx_release [2025-01-09 18:25:27,127 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2025-01-09 18:25:27,127 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2025-01-09 18:25:27,127 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 18:25:27,127 INFO L130 BoogieDeclarations]: Found specification of procedure input_event [2025-01-09 18:25:27,127 INFO L138 BoogieDeclarations]: Found implementation of procedure input_event [2025-01-09 18:25:27,127 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2025-01-09 18:25:27,127 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2025-01-09 18:25:27,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 18:25:27,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 18:25:27,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 18:25:27,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-09 18:25:27,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-01-09 18:25:27,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-01-09 18:25:27,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-01-09 18:25:27,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-01-09 18:25:27,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-01-09 18:25:27,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-01-09 18:25:27,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-01-09 18:25:27,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-01-09 18:25:27,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-01-09 18:25:27,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-01-09 18:25:27,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-01-09 18:25:27,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-01-09 18:25:27,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-01-09 18:25:27,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-01-09 18:25:27,128 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2025-01-09 18:25:27,128 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2025-01-09 18:25:27,128 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_interruptible [2025-01-09 18:25:27,128 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_interruptible [2025-01-09 18:25:27,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 18:25:27,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 18:25:27,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 18:25:27,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-09 18:25:27,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-01-09 18:25:27,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-01-09 18:25:27,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-01-09 18:25:27,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-01-09 18:25:27,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-01-09 18:25:27,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-01-09 18:25:27,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-01-09 18:25:27,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-01-09 18:25:27,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-01-09 18:25:27,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-01-09 18:25:27,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-01-09 18:25:27,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-01-09 18:25:27,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-01-09 18:25:27,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-01-09 18:25:27,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-01-09 18:25:27,131 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-01-09 18:25:27,131 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-01-09 18:25:27,131 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2025-01-09 18:25:27,131 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2025-01-09 18:25:27,131 INFO L130 BoogieDeclarations]: Found specification of procedure __mutex_init [2025-01-09 18:25:27,131 INFO L138 BoogieDeclarations]: Found implementation of procedure __mutex_init [2025-01-09 18:25:27,131 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2025-01-09 18:25:27,131 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2025-01-09 18:25:27,131 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2025-01-09 18:25:27,131 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2025-01-09 18:25:27,131 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2025-01-09 18:25:27,131 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2025-01-09 18:25:27,131 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irqsave [2025-01-09 18:25:27,131 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irqsave [2025-01-09 18:25:27,131 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2025-01-09 18:25:27,131 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2025-01-09 18:25:27,131 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_set_model [2025-01-09 18:25:27,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_set_model [2025-01-09 18:25:27,131 INFO L130 BoogieDeclarations]: Found specification of procedure release_firmware [2025-01-09 18:25:27,131 INFO L138 BoogieDeclarations]: Found implementation of procedure release_firmware [2025-01-09 18:25:27,131 INFO L130 BoogieDeclarations]: Found specification of procedure input_report_key [2025-01-09 18:25:27,131 INFO L138 BoogieDeclarations]: Found implementation of procedure input_report_key [2025-01-09 18:25:27,131 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_stop_iso_xfer [2025-01-09 18:25:27,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_stop_iso_xfer [2025-01-09 18:25:27,131 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2025-01-09 18:25:27,131 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2025-01-09 18:25:27,131 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_filter_pes2ts_init [2025-01-09 18:25:27,131 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_filter_pes2ts_init [2025-01-09 18:25:27,131 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-01-09 18:25:27,131 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-01-09 18:25:27,131 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-01-09 18:25:27,131 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-01-09 18:25:27,131 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-01-09 18:25:27,131 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-01-09 18:25:27,131 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-01-09 18:25:27,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-01-09 18:25:27,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2025-01-09 18:25:27,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2025-01-09 18:25:27,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#10 [2025-01-09 18:25:27,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#11 [2025-01-09 18:25:27,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#12 [2025-01-09 18:25:27,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#13 [2025-01-09 18:25:27,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#14 [2025-01-09 18:25:27,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#15 [2025-01-09 18:25:27,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#16 [2025-01-09 18:25:27,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#17 [2025-01-09 18:25:27,132 INFO L130 BoogieDeclarations]: Found specification of procedure get_dma_ops [2025-01-09 18:25:27,132 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dma_ops [2025-01-09 18:25:27,132 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2025-01-09 18:25:27,132 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2025-01-09 18:25:27,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-01-09 18:25:27,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-01-09 18:25:27,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-01-09 18:25:27,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-01-09 18:25:27,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-01-09 18:25:27,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-01-09 18:25:27,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-01-09 18:25:27,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-01-09 18:25:27,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-01-09 18:25:27,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-01-09 18:25:27,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-01-09 18:25:27,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-01-09 18:25:27,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-01-09 18:25:27,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-01-09 18:25:27,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-01-09 18:25:27,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-01-09 18:25:27,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-01-09 18:25:27,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-01-09 18:25:27,132 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~X~$Pointer$~X~int~X~$Pointer$~X~int~TO~int [2025-01-09 18:25:27,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~X~$Pointer$~X~int~X~$Pointer$~X~int~TO~int [2025-01-09 18:25:27,132 INFO L130 BoogieDeclarations]: Found specification of procedure usb_bulk_msg [2025-01-09 18:25:27,132 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_bulk_msg [2025-01-09 18:25:27,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 18:25:27,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 18:25:27,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 18:25:27,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 18:25:27,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 18:25:27,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 18:25:27,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-09 18:25:27,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-01-09 18:25:27,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-01-09 18:25:27,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-01-09 18:25:27,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-01-09 18:25:27,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-01-09 18:25:27,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-01-09 18:25:27,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-01-09 18:25:27,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-01-09 18:25:27,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-01-09 18:25:27,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-01-09 18:25:27,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-01-09 18:25:27,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#0 [2025-01-09 18:25:27,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#1 [2025-01-09 18:25:27,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#2 [2025-01-09 18:25:27,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#3 [2025-01-09 18:25:27,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#4 [2025-01-09 18:25:27,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#5 [2025-01-09 18:25:27,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#6 [2025-01-09 18:25:27,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#7 [2025-01-09 18:25:27,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#8 [2025-01-09 18:25:27,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#9 [2025-01-09 18:25:27,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#10 [2025-01-09 18:25:27,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#11 [2025-01-09 18:25:27,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#12 [2025-01-09 18:25:27,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#13 [2025-01-09 18:25:27,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#14 [2025-01-09 18:25:27,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#15 [2025-01-09 18:25:27,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#16 [2025-01-09 18:25:27,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#17 [2025-01-09 18:25:27,133 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#0 [2025-01-09 18:25:27,133 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#1 [2025-01-09 18:25:27,133 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#2 [2025-01-09 18:25:27,133 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#3 [2025-01-09 18:25:27,133 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#4 [2025-01-09 18:25:27,133 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#5 [2025-01-09 18:25:27,133 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#6 [2025-01-09 18:25:27,133 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#7 [2025-01-09 18:25:27,133 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#8 [2025-01-09 18:25:27,133 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#9 [2025-01-09 18:25:27,133 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#10 [2025-01-09 18:25:27,133 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#11 [2025-01-09 18:25:27,133 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#12 [2025-01-09 18:25:27,133 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#13 [2025-01-09 18:25:27,135 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#14 [2025-01-09 18:25:27,135 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#15 [2025-01-09 18:25:27,135 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#16 [2025-01-09 18:25:27,136 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#17 [2025-01-09 18:25:27,136 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2025-01-09 18:25:27,136 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2025-01-09 18:25:27,136 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2025-01-09 18:25:27,136 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2025-01-09 18:25:27,136 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-01-09 18:25:27,136 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-01-09 18:25:27,136 INFO L130 BoogieDeclarations]: Found specification of procedure list_add_tail [2025-01-09 18:25:27,136 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add_tail [2025-01-09 18:25:27,136 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_send_command [2025-01-09 18:25:27,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_send_command [2025-01-09 18:25:27,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 18:25:27,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 18:25:27,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 18:25:27,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 18:25:27,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 18:25:27,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 18:25:27,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-09 18:25:27,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-01-09 18:25:27,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-01-09 18:25:27,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-01-09 18:25:27,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-01-09 18:25:27,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-01-09 18:25:27,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-01-09 18:25:27,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-01-09 18:25:27,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-01-09 18:25:27,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-01-09 18:25:27,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-01-09 18:25:27,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-01-09 18:25:27,138 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_setup_urbs [2025-01-09 18:25:27,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_setup_urbs [2025-01-09 18:25:27,138 INFO L130 BoogieDeclarations]: Found specification of procedure input_sync [2025-01-09 18:25:27,138 INFO L138 BoogieDeclarations]: Found implementation of procedure input_sync [2025-01-09 18:25:27,138 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-01-09 18:25:27,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-01-09 18:25:27,138 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_set_pids [2025-01-09 18:25:27,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_set_pids [2025-01-09 18:25:27,138 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_exit_usb [2025-01-09 18:25:27,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_exit_usb [2025-01-09 18:25:27,138 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 18:25:27,138 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 18:25:27,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 18:25:27,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 18:25:27,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 18:25:27,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-09 18:25:27,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-01-09 18:25:27,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-01-09 18:25:27,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-01-09 18:25:27,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-01-09 18:25:27,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-01-09 18:25:27,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-01-09 18:25:27,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-01-09 18:25:27,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-01-09 18:25:27,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-01-09 18:25:27,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-01-09 18:25:27,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-01-09 18:25:27,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-01-09 18:25:27,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-01-09 18:25:27,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-01-09 18:25:27,139 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_iso_mutex_of_ttusb_dec [2025-01-09 18:25:27,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_iso_mutex_of_ttusb_dec [2025-01-09 18:25:27,139 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2025-01-09 18:25:27,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2025-01-09 18:25:27,139 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2025-01-09 18:25:27,139 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2025-01-09 18:25:27,139 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_dmxdev_release [2025-01-09 18:25:27,139 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_dmxdev_release [2025-01-09 18:25:27,139 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2025-01-09 18:25:27,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2025-01-09 18:25:27,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 18:25:27,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 18:25:27,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 18:25:27,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 18:25:27,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 18:25:27,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 18:25:27,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 18:25:27,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 18:25:27,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 18:25:27,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 18:25:27,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-09 18:25:27,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-09 18:25:27,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-01-09 18:25:27,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-01-09 18:25:27,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-01-09 18:25:27,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-01-09 18:25:27,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-01-09 18:25:27,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-01-09 18:25:27,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 18:25:27,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 18:25:27,787 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 18:25:27,791 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 18:25:37,386 INFO L? ?]: Removed 1615 outVars from TransFormulas that were not future-live. [2025-01-09 18:25:37,386 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 18:25:37,420 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 18:25:37,425 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 18:25:37,425 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:25:37 BoogieIcfgContainer [2025-01-09 18:25:37,425 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 18:25:37,427 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 18:25:37,427 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 18:25:37,430 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 18:25:37,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 06:25:24" (1/3) ... [2025-01-09 18:25:37,432 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78696a68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:25:37, skipping insertion in model container [2025-01-09 18:25:37,432 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:25:26" (2/3) ... [2025-01-09 18:25:37,432 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78696a68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:25:37, skipping insertion in model container [2025-01-09 18:25:37,432 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:25:37" (3/3) ... [2025-01-09 18:25:37,433 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-3.8-rc1-32_7a-drivers--media--usb--ttusb-dec--ttusb_dec.ko-ldv_main0.cil.out.i [2025-01-09 18:25:37,444 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 18:25:37,446 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linux-3.8-rc1-32_7a-drivers--media--usb--ttusb-dec--ttusb_dec.ko-ldv_main0.cil.out.i that has 69 procedures, 1229 locations, 1 initial locations, 38 loop locations, and 1 error locations. [2025-01-09 18:25:37,558 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 18:25:37,566 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;@5737d80c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 18:25:37,566 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 18:25:37,571 INFO L276 IsEmpty]: Start isEmpty. Operand has 1144 states, 820 states have (on average 1.3158536585365854) internal successors, (1079), 840 states have internal predecessors, (1079), 271 states have call successors, (271), 51 states have call predecessors, (271), 51 states have return successors, (271), 265 states have call predecessors, (271), 271 states have call successors, (271) [2025-01-09 18:25:37,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-09 18:25:37,575 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:25:37,575 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:25:37,576 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:25:37,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:25:37,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1635582944, now seen corresponding path program 1 times [2025-01-09 18:25:37,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:25:37,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015984028] [2025-01-09 18:25:37,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:25:37,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:25:37,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 18:25:37,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 18:25:37,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:25:37,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:25:38,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 18:25:38,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:25:38,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015984028] [2025-01-09 18:25:38,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015984028] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:25:38,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:25:38,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:25:38,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382113711] [2025-01-09 18:25:38,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:25:38,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:25:38,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:25:38,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:25:38,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:25:38,148 INFO L87 Difference]: Start difference. First operand has 1144 states, 820 states have (on average 1.3158536585365854) internal successors, (1079), 840 states have internal predecessors, (1079), 271 states have call successors, (271), 51 states have call predecessors, (271), 51 states have return successors, (271), 265 states have call predecessors, (271), 271 states have call successors, (271) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 18:25:40,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 18:25:40,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:25:40,765 INFO L93 Difference]: Finished difference Result 3399 states and 4915 transitions. [2025-01-09 18:25:40,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:25:40,767 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-09 18:25:40,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:25:40,822 INFO L225 Difference]: With dead ends: 3399 [2025-01-09 18:25:40,824 INFO L226 Difference]: Without dead ends: 2252 [2025-01-09 18:25:40,836 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 18:25:40,840 INFO L435 NwaCegarLoop]: 1694 mSDtfsCounter, 1597 mSDsluCounter, 1566 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1597 SdHoareTripleChecker+Valid, 3260 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-09 18:25:40,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1597 Valid, 3260 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-09 18:25:40,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2252 states. [2025-01-09 18:25:41,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2252 to 2247. [2025-01-09 18:25:41,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2247 states, 1616 states have (on average 1.3044554455445545) internal successors, (2108), 1647 states have internal predecessors, (2108), 531 states have call successors, (531), 101 states have call predecessors, (531), 99 states have return successors, (532), 508 states have call predecessors, (532), 520 states have call successors, (532) [2025-01-09 18:25:41,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2247 states to 2247 states and 3171 transitions. [2025-01-09 18:25:41,051 INFO L78 Accepts]: Start accepts. Automaton has 2247 states and 3171 transitions. Word has length 9 [2025-01-09 18:25:41,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:25:41,052 INFO L471 AbstractCegarLoop]: Abstraction has 2247 states and 3171 transitions. [2025-01-09 18:25:41,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 18:25:41,052 INFO L276 IsEmpty]: Start isEmpty. Operand 2247 states and 3171 transitions. [2025-01-09 18:25:41,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-09 18:25:41,052 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:25:41,052 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:25:41,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 18:25:41,053 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:25:41,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:25:41,053 INFO L85 PathProgramCache]: Analyzing trace with hash -837040308, now seen corresponding path program 1 times [2025-01-09 18:25:41,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:25:41,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932281093] [2025-01-09 18:25:41,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:25:41,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:25:41,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-09 18:25:41,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-09 18:25:41,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:25:41,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:25:41,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 18:25:41,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:25:41,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932281093] [2025-01-09 18:25:41,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932281093] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:25:41,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:25:41,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:25:41,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59120986] [2025-01-09 18:25:41,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:25:41,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:25:41,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:25:41,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:25:41,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:25:41,292 INFO L87 Difference]: Start difference. First operand 2247 states and 3171 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 18:25:45,306 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 18:25:45,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:25:45,380 INFO L93 Difference]: Finished difference Result 2249 states and 3172 transitions. [2025-01-09 18:25:45,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:25:45,380 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-01-09 18:25:45,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:25:45,393 INFO L225 Difference]: With dead ends: 2249 [2025-01-09 18:25:45,393 INFO L226 Difference]: Without dead ends: 2246 [2025-01-09 18:25:45,396 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 18:25:45,396 INFO L435 NwaCegarLoop]: 1595 mSDtfsCounter, 1589 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1589 SdHoareTripleChecker+Valid, 1595 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:25:45,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1589 Valid, 1595 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2025-01-09 18:25:45,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2246 states. [2025-01-09 18:25:45,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2246 to 2246. [2025-01-09 18:25:45,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2246 states, 1616 states have (on average 1.3038366336633664) internal successors, (2107), 1646 states have internal predecessors, (2107), 530 states have call successors, (530), 101 states have call predecessors, (530), 99 states have return successors, (532), 508 states have call predecessors, (532), 520 states have call successors, (532) [2025-01-09 18:25:45,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2246 states to 2246 states and 3169 transitions. [2025-01-09 18:25:45,513 INFO L78 Accepts]: Start accepts. Automaton has 2246 states and 3169 transitions. Word has length 10 [2025-01-09 18:25:45,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:25:45,513 INFO L471 AbstractCegarLoop]: Abstraction has 2246 states and 3169 transitions. [2025-01-09 18:25:45,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 18:25:45,514 INFO L276 IsEmpty]: Start isEmpty. Operand 2246 states and 3169 transitions. [2025-01-09 18:25:45,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-09 18:25:45,515 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:25:45,515 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:25:45,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 18:25:45,515 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:25:45,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:25:45,515 INFO L85 PathProgramCache]: Analyzing trace with hash -178944925, now seen corresponding path program 1 times [2025-01-09 18:25:45,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:25:45,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241406449] [2025-01-09 18:25:45,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:25:45,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:25:45,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 18:25:45,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 18:25:45,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:25:45,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:25:45,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 18:25:45,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:25:45,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241406449] [2025-01-09 18:25:45,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241406449] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:25:45,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:25:45,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:25:45,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742752719] [2025-01-09 18:25:45,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:25:45,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:25:45,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:25:45,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:25:45,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:25:45,798 INFO L87 Difference]: Start difference. First operand 2246 states and 3169 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 18:25:49,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 18:25:49,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:25:49,612 INFO L93 Difference]: Finished difference Result 2248 states and 3170 transitions. [2025-01-09 18:25:49,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:25:49,616 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-01-09 18:25:49,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:25:49,636 INFO L225 Difference]: With dead ends: 2248 [2025-01-09 18:25:49,636 INFO L226 Difference]: Without dead ends: 2245 [2025-01-09 18:25:49,638 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 18:25:49,638 INFO L435 NwaCegarLoop]: 1593 mSDtfsCounter, 1586 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1586 SdHoareTripleChecker+Valid, 1593 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-01-09 18:25:49,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1586 Valid, 1593 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-01-09 18:25:49,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2245 states. [2025-01-09 18:25:49,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2245 to 2245. [2025-01-09 18:25:49,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2245 states, 1616 states have (on average 1.3032178217821782) internal successors, (2106), 1645 states have internal predecessors, (2106), 529 states have call successors, (529), 101 states have call predecessors, (529), 99 states have return successors, (532), 508 states have call predecessors, (532), 520 states have call successors, (532) [2025-01-09 18:25:49,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2245 states to 2245 states and 3167 transitions. [2025-01-09 18:25:49,746 INFO L78 Accepts]: Start accepts. Automaton has 2245 states and 3167 transitions. Word has length 11 [2025-01-09 18:25:49,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:25:49,746 INFO L471 AbstractCegarLoop]: Abstraction has 2245 states and 3167 transitions. [2025-01-09 18:25:49,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 18:25:49,747 INFO L276 IsEmpty]: Start isEmpty. Operand 2245 states and 3167 transitions. [2025-01-09 18:25:49,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-09 18:25:49,747 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:25:49,748 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:25:49,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 18:25:49,748 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:25:49,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:25:49,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1252819665, now seen corresponding path program 1 times [2025-01-09 18:25:49,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:25:49,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101914797] [2025-01-09 18:25:49,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:25:49,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:25:49,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-09 18:25:49,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 18:25:49,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:25:49,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:25:50,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 18:25:50,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:25:50,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101914797] [2025-01-09 18:25:50,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101914797] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:25:50,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:25:50,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:25:50,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890329091] [2025-01-09 18:25:50,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:25:50,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:25:50,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:25:50,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:25:50,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:25:50,008 INFO L87 Difference]: Start difference. First operand 2245 states and 3167 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 18:25:53,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 18:25:54,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:25:54,053 INFO L93 Difference]: Finished difference Result 6690 states and 9549 transitions. [2025-01-09 18:25:54,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:25:54,054 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-01-09 18:25:54,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:25:54,076 INFO L225 Difference]: With dead ends: 6690 [2025-01-09 18:25:54,076 INFO L226 Difference]: Without dead ends: 4443 [2025-01-09 18:25:54,087 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 18:25:54,088 INFO L435 NwaCegarLoop]: 1650 mSDtfsCounter, 1591 mSDsluCounter, 1562 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1591 SdHoareTripleChecker+Valid, 3212 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-01-09 18:25:54,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1591 Valid, 3212 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-01-09 18:25:54,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4443 states. [2025-01-09 18:25:54,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4443 to 4421. [2025-01-09 18:25:54,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4421 states, 3191 states have (on average 1.3042933249764963) internal successors, (4162), 3247 states have internal predecessors, (4162), 1034 states have call successors, (1034), 198 states have call predecessors, (1034), 195 states have return successors, (1098), 995 states have call predecessors, (1098), 1022 states have call successors, (1098) [2025-01-09 18:25:54,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4421 states to 4421 states and 6294 transitions. [2025-01-09 18:25:54,277 INFO L78 Accepts]: Start accepts. Automaton has 4421 states and 6294 transitions. Word has length 12 [2025-01-09 18:25:54,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:25:54,278 INFO L471 AbstractCegarLoop]: Abstraction has 4421 states and 6294 transitions. [2025-01-09 18:25:54,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 18:25:54,278 INFO L276 IsEmpty]: Start isEmpty. Operand 4421 states and 6294 transitions. [2025-01-09 18:25:54,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-01-09 18:25:54,289 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:25:54,290 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 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] [2025-01-09 18:25:54,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 18:25:54,290 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:25:54,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:25:54,291 INFO L85 PathProgramCache]: Analyzing trace with hash 992819855, now seen corresponding path program 1 times [2025-01-09 18:25:54,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:25:54,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590363138] [2025-01-09 18:25:54,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:25:54,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:25:54,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-01-09 18:25:54,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-01-09 18:25:54,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:25:54,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:25:54,819 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-09 18:25:54,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:25:54,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590363138] [2025-01-09 18:25:54,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590363138] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:25:54,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:25:54,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:25:54,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124890869] [2025-01-09 18:25:54,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:25:54,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:25:54,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:25:54,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:25:54,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:25:54,822 INFO L87 Difference]: Start difference. First operand 4421 states and 6294 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 18:25:54,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:25:55,000 INFO L93 Difference]: Finished difference Result 8886 states and 12656 transitions. [2025-01-09 18:25:55,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:25:55,000 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 138 [2025-01-09 18:25:55,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:25:55,025 INFO L225 Difference]: With dead ends: 8886 [2025-01-09 18:25:55,025 INFO L226 Difference]: Without dead ends: 4468 [2025-01-09 18:25:55,074 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 18:25:55,075 INFO L435 NwaCegarLoop]: 1597 mSDtfsCounter, 430 mSDsluCounter, 1060 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 539 SdHoareTripleChecker+Valid, 2657 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:25:55,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [539 Valid, 2657 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:25:55,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4468 states. [2025-01-09 18:25:55,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4468 to 4457. [2025-01-09 18:25:55,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4457 states, 3227 states have (on average 1.305546947629377) internal successors, (4213), 3283 states have internal predecessors, (4213), 1034 states have call successors, (1034), 198 states have call predecessors, (1034), 195 states have return successors, (1098), 995 states have call predecessors, (1098), 1022 states have call successors, (1098) [2025-01-09 18:25:55,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4457 states to 4457 states and 6345 transitions. [2025-01-09 18:25:55,315 INFO L78 Accepts]: Start accepts. Automaton has 4457 states and 6345 transitions. Word has length 138 [2025-01-09 18:25:55,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:25:55,315 INFO L471 AbstractCegarLoop]: Abstraction has 4457 states and 6345 transitions. [2025-01-09 18:25:55,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 18:25:55,316 INFO L276 IsEmpty]: Start isEmpty. Operand 4457 states and 6345 transitions. [2025-01-09 18:25:55,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-01-09 18:25:55,321 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:25:55,321 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:25:55,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 18:25:55,321 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:25:55,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:25:55,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1226770008, now seen corresponding path program 1 times [2025-01-09 18:25:55,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:25:55,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689278327] [2025-01-09 18:25:55,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:25:55,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:25:55,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-01-09 18:25:55,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-01-09 18:25:55,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:25:55,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:25:55,762 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2025-01-09 18:25:55,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:25:55,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689278327] [2025-01-09 18:25:55,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689278327] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:25:55,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:25:55,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:25:55,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989904523] [2025-01-09 18:25:55,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:25:55,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:25:55,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:25:55,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:25:55,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:25:55,764 INFO L87 Difference]: Start difference. First operand 4457 states and 6345 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-01-09 18:25:55,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:25:55,993 INFO L93 Difference]: Finished difference Result 8691 states and 12367 transitions. [2025-01-09 18:25:55,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:25:55,993 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 156 [2025-01-09 18:25:55,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:25:56,020 INFO L225 Difference]: With dead ends: 8691 [2025-01-09 18:25:56,021 INFO L226 Difference]: Without dead ends: 4237 [2025-01-09 18:25:56,039 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 18:25:56,041 INFO L435 NwaCegarLoop]: 1509 mSDtfsCounter, 1471 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1471 SdHoareTripleChecker+Valid, 1509 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:25:56,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1471 Valid, 1509 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:25:56,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4237 states. [2025-01-09 18:25:56,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4237 to 4237. [2025-01-09 18:25:56,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4237 states, 3047 states have (on average 1.3012799474893337) internal successors, (3965), 3103 states have internal predecessors, (3965), 994 states have call successors, (994), 198 states have call predecessors, (994), 195 states have return successors, (1054), 955 states have call predecessors, (1054), 982 states have call successors, (1054) [2025-01-09 18:25:56,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4237 states to 4237 states and 6013 transitions. [2025-01-09 18:25:56,270 INFO L78 Accepts]: Start accepts. Automaton has 4237 states and 6013 transitions. Word has length 156 [2025-01-09 18:25:56,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:25:56,272 INFO L471 AbstractCegarLoop]: Abstraction has 4237 states and 6013 transitions. [2025-01-09 18:25:56,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-01-09 18:25:56,272 INFO L276 IsEmpty]: Start isEmpty. Operand 4237 states and 6013 transitions. [2025-01-09 18:25:56,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-01-09 18:25:56,277 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:25:56,277 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:25:56,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 18:25:56,278 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:25:56,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:25:56,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1855127077, now seen corresponding path program 1 times [2025-01-09 18:25:56,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:25:56,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153699198] [2025-01-09 18:25:56,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:25:56,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:25:56,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-01-09 18:25:56,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-01-09 18:25:56,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:25:56,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:25:56,621 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-01-09 18:25:56,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:25:56,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153699198] [2025-01-09 18:25:56,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153699198] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:25:56,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:25:56,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 18:25:56,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014792272] [2025-01-09 18:25:56,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:25:56,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 18:25:56,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:25:56,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 18:25:56,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 18:25:56,623 INFO L87 Difference]: Start difference. First operand 4237 states and 6013 transitions. Second operand has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 18:25:56,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:25:56,820 INFO L93 Difference]: Finished difference Result 8487 states and 12042 transitions. [2025-01-09 18:25:56,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 18:25:56,821 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 174 [2025-01-09 18:25:56,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:25:56,839 INFO L225 Difference]: With dead ends: 8487 [2025-01-09 18:25:56,840 INFO L226 Difference]: Without dead ends: 4247 [2025-01-09 18:25:56,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 18:25:56,852 INFO L435 NwaCegarLoop]: 1510 mSDtfsCounter, 0 mSDsluCounter, 3012 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4522 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:25:56,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4522 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:25:56,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4247 states. [2025-01-09 18:25:56,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4247 to 4247. [2025-01-09 18:25:56,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4247 states, 3058 states have (on average 1.2998691955526487) internal successors, (3975), 3114 states have internal predecessors, (3975), 993 states have call successors, (993), 198 states have call predecessors, (993), 195 states have return successors, (1053), 954 states have call predecessors, (1053), 981 states have call successors, (1053) [2025-01-09 18:25:57,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4247 states to 4247 states and 6021 transitions. [2025-01-09 18:25:57,013 INFO L78 Accepts]: Start accepts. Automaton has 4247 states and 6021 transitions. Word has length 174 [2025-01-09 18:25:57,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:25:57,014 INFO L471 AbstractCegarLoop]: Abstraction has 4247 states and 6021 transitions. [2025-01-09 18:25:57,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 18:25:57,014 INFO L276 IsEmpty]: Start isEmpty. Operand 4247 states and 6021 transitions. [2025-01-09 18:25:57,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-01-09 18:25:57,016 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:25:57,016 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:25:57,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 18:25:57,017 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:25:57,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:25:57,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1377083653, now seen corresponding path program 1 times [2025-01-09 18:25:57,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:25:57,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802677921] [2025-01-09 18:25:57,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:25:57,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:25:57,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 18:25:57,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 18:25:57,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:25:57,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:25:57,412 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-01-09 18:25:57,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:25:57,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802677921] [2025-01-09 18:25:57,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802677921] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:25:57,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:25:57,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:25:57,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590182314] [2025-01-09 18:25:57,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:25:57,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:25:57,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:25:57,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:25:57,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:25:57,415 INFO L87 Difference]: Start difference. First operand 4247 states and 6021 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 18:26:00,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 18:26:01,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:26:01,186 INFO L93 Difference]: Finished difference Result 8503 states and 12074 transitions. [2025-01-09 18:26:01,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:26:01,192 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 171 [2025-01-09 18:26:01,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:26:01,232 INFO L225 Difference]: With dead ends: 8503 [2025-01-09 18:26:01,233 INFO L226 Difference]: Without dead ends: 4259 [2025-01-09 18:26:01,254 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 18:26:01,255 INFO L435 NwaCegarLoop]: 2865 mSDtfsCounter, 1477 mSDsluCounter, 1498 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1477 SdHoareTripleChecker+Valid, 4363 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-01-09 18:26:01,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1477 Valid, 4363 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-01-09 18:26:01,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4259 states. [2025-01-09 18:26:01,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4259 to 4245. [2025-01-09 18:26:01,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4245 states, 3056 states have (on average 1.298756544502618) internal successors, (3969), 3113 states have internal predecessors, (3969), 993 states have call successors, (993), 198 states have call predecessors, (993), 195 states have return successors, (1029), 953 states have call predecessors, (1029), 981 states have call successors, (1029) [2025-01-09 18:26:01,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4245 states to 4245 states and 5991 transitions. [2025-01-09 18:26:01,488 INFO L78 Accepts]: Start accepts. Automaton has 4245 states and 5991 transitions. Word has length 171 [2025-01-09 18:26:01,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:26:01,489 INFO L471 AbstractCegarLoop]: Abstraction has 4245 states and 5991 transitions. [2025-01-09 18:26:01,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 18:26:01,489 INFO L276 IsEmpty]: Start isEmpty. Operand 4245 states and 5991 transitions. [2025-01-09 18:26:01,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-01-09 18:26:01,492 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:26:01,492 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:26:01,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 18:26:01,493 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:26:01,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:26:01,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1112445309, now seen corresponding path program 1 times [2025-01-09 18:26:01,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:26:01,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703438302] [2025-01-09 18:26:01,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:26:01,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:26:01,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 18:26:01,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 18:26:01,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:26:01,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:26:01,972 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-01-09 18:26:01,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:26:01,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703438302] [2025-01-09 18:26:01,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703438302] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:26:01,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:26:01,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 18:26:01,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369791540] [2025-01-09 18:26:01,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:26:01,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 18:26:01,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:26:01,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 18:26:01,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 18:26:01,975 INFO L87 Difference]: Start difference. First operand 4245 states and 5991 transitions. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 18:26:02,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:26:02,213 INFO L93 Difference]: Finished difference Result 8499 states and 11995 transitions. [2025-01-09 18:26:02,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 18:26:02,213 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 171 [2025-01-09 18:26:02,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:26:02,243 INFO L225 Difference]: With dead ends: 8499 [2025-01-09 18:26:02,243 INFO L226 Difference]: Without dead ends: 4257 [2025-01-09 18:26:02,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 18:26:02,262 INFO L435 NwaCegarLoop]: 1509 mSDtfsCounter, 0 mSDsluCounter, 4519 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6028 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:26:02,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6028 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:26:02,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4257 states. [2025-01-09 18:26:02,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4257 to 4257. [2025-01-09 18:26:02,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4257 states, 3068 states have (on average 1.2975880052151239) internal successors, (3981), 3125 states have internal predecessors, (3981), 993 states have call successors, (993), 198 states have call predecessors, (993), 195 states have return successors, (1029), 953 states have call predecessors, (1029), 981 states have call successors, (1029) [2025-01-09 18:26:02,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4257 states to 4257 states and 6003 transitions. [2025-01-09 18:26:02,466 INFO L78 Accepts]: Start accepts. Automaton has 4257 states and 6003 transitions. Word has length 171 [2025-01-09 18:26:02,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:26:02,467 INFO L471 AbstractCegarLoop]: Abstraction has 4257 states and 6003 transitions. [2025-01-09 18:26:02,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 18:26:02,467 INFO L276 IsEmpty]: Start isEmpty. Operand 4257 states and 6003 transitions. [2025-01-09 18:26:02,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-01-09 18:26:02,470 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:26:02,470 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:26:02,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 18:26:02,471 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:26:02,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:26:02,472 INFO L85 PathProgramCache]: Analyzing trace with hash -606693910, now seen corresponding path program 1 times [2025-01-09 18:26:02,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:26:02,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180608354] [2025-01-09 18:26:02,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:26:02,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:26:02,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-09 18:26:02,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-09 18:26:02,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:26:02,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:26:02,884 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-01-09 18:26:02,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:26:02,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180608354] [2025-01-09 18:26:02,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180608354] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:26:02,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:26:02,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:26:02,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401778501] [2025-01-09 18:26:02,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:26:02,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:26:02,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:26:02,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:26:02,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:26:02,886 INFO L87 Difference]: Start difference. First operand 4257 states and 6003 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 18:26:03,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:26:03,077 INFO L93 Difference]: Finished difference Result 8539 states and 12047 transitions. [2025-01-09 18:26:03,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:26:03,078 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 180 [2025-01-09 18:26:03,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:26:03,099 INFO L225 Difference]: With dead ends: 8539 [2025-01-09 18:26:03,100 INFO L226 Difference]: Without dead ends: 4285 [2025-01-09 18:26:03,111 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 18:26:03,112 INFO L435 NwaCegarLoop]: 1511 mSDtfsCounter, 4 mSDsluCounter, 1506 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3017 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:26:03,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3017 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:26:03,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4285 states. [2025-01-09 18:26:03,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4285 to 4261. [2025-01-09 18:26:03,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4261 states, 3072 states have (on average 1.2972005208333333) internal successors, (3985), 3129 states have internal predecessors, (3985), 993 states have call successors, (993), 198 states have call predecessors, (993), 195 states have return successors, (1029), 953 states have call predecessors, (1029), 981 states have call successors, (1029) [2025-01-09 18:26:03,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4261 states to 4261 states and 6007 transitions. [2025-01-09 18:26:03,261 INFO L78 Accepts]: Start accepts. Automaton has 4261 states and 6007 transitions. Word has length 180 [2025-01-09 18:26:03,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:26:03,261 INFO L471 AbstractCegarLoop]: Abstraction has 4261 states and 6007 transitions. [2025-01-09 18:26:03,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 18:26:03,261 INFO L276 IsEmpty]: Start isEmpty. Operand 4261 states and 6007 transitions. [2025-01-09 18:26:03,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-01-09 18:26:03,263 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:26:03,264 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:26:03,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 18:26:03,264 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:26:03,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:26:03,264 INFO L85 PathProgramCache]: Analyzing trace with hash -659483579, now seen corresponding path program 1 times [2025-01-09 18:26:03,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:26:03,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087514465] [2025-01-09 18:26:03,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:26:03,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:26:03,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-01-09 18:26:03,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-01-09 18:26:03,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:26:03,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:26:03,638 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2025-01-09 18:26:03,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:26:03,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087514465] [2025-01-09 18:26:03,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087514465] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 18:26:03,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [680657153] [2025-01-09 18:26:03,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:26:03,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:26:03,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:26:03,642 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 18:26:03,644 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 18:26:04,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-01-09 18:26:04,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-01-09 18:26:04,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:26:04,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:26:04,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 2492 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 18:26:04,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 18:26:04,637 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-01-09 18:26:04,637 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 18:26:04,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [680657153] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:26:04,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 18:26:04,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-01-09 18:26:04,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412540837] [2025-01-09 18:26:04,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:26:04,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:26:04,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:26:04,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:26:04,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 18:26:04,638 INFO L87 Difference]: Start difference. First operand 4261 states and 6007 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 18:26:05,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:26:05,012 INFO L93 Difference]: Finished difference Result 8535 states and 12051 transitions. [2025-01-09 18:26:05,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:26:05,016 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 193 [2025-01-09 18:26:05,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:26:05,038 INFO L225 Difference]: With dead ends: 8535 [2025-01-09 18:26:05,038 INFO L226 Difference]: Without dead ends: 4277 [2025-01-09 18:26:05,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 18:26:05,052 INFO L435 NwaCegarLoop]: 1509 mSDtfsCounter, 4 mSDsluCounter, 1506 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3015 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 18:26:05,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3015 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 18:26:05,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4277 states. [2025-01-09 18:26:05,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4277 to 4265. [2025-01-09 18:26:05,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4265 states, 3076 states have (on average 1.296814044213264) internal successors, (3989), 3133 states have internal predecessors, (3989), 993 states have call successors, (993), 198 states have call predecessors, (993), 195 states have return successors, (1029), 953 states have call predecessors, (1029), 981 states have call successors, (1029) [2025-01-09 18:26:05,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4265 states to 4265 states and 6011 transitions. [2025-01-09 18:26:05,199 INFO L78 Accepts]: Start accepts. Automaton has 4265 states and 6011 transitions. Word has length 193 [2025-01-09 18:26:05,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:26:05,200 INFO L471 AbstractCegarLoop]: Abstraction has 4265 states and 6011 transitions. [2025-01-09 18:26:05,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 18:26:05,200 INFO L276 IsEmpty]: Start isEmpty. Operand 4265 states and 6011 transitions. [2025-01-09 18:26:05,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-01-09 18:26:05,202 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:26:05,202 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:26:05,215 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 18:26:05,403 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,SelfDestructingSolverStorable10 [2025-01-09 18:26:05,403 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:26:05,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:26:05,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1474101268, now seen corresponding path program 1 times [2025-01-09 18:26:05,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:26:05,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952177240] [2025-01-09 18:26:05,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:26:05,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:26:05,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-01-09 18:26:05,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-01-09 18:26:05,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:26:05,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:26:05,795 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-01-09 18:26:05,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:26:05,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952177240] [2025-01-09 18:26:05,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952177240] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 18:26:05,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425674593] [2025-01-09 18:26:05,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:26:05,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:26:05,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:26:05,803 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 18:26:05,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 18:26:06,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-01-09 18:26:06,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-01-09 18:26:06,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:26:06,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:26:06,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 2592 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 18:26:06,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 18:26:06,768 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-01-09 18:26:06,768 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 18:26:06,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1425674593] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:26:06,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 18:26:06,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-01-09 18:26:06,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368064949] [2025-01-09 18:26:06,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:26:06,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:26:06,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:26:06,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:26:06,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 18:26:06,774 INFO L87 Difference]: Start difference. First operand 4265 states and 6011 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 18:26:06,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:26:06,887 INFO L93 Difference]: Finished difference Result 8535 states and 12047 transitions. [2025-01-09 18:26:06,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:26:06,887 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 196 [2025-01-09 18:26:06,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:26:06,909 INFO L225 Difference]: With dead ends: 8535 [2025-01-09 18:26:06,909 INFO L226 Difference]: Without dead ends: 4273 [2025-01-09 18:26:06,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 18:26:06,921 INFO L435 NwaCegarLoop]: 1510 mSDtfsCounter, 1 mSDsluCounter, 1507 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 3017 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:26:06,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 3017 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:26:06,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4273 states. [2025-01-09 18:26:07,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4273 to 4269. [2025-01-09 18:26:07,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4269 states, 3080 states have (on average 1.2964285714285715) internal successors, (3993), 3137 states have internal predecessors, (3993), 993 states have call successors, (993), 198 states have call predecessors, (993), 195 states have return successors, (1029), 953 states have call predecessors, (1029), 981 states have call successors, (1029) [2025-01-09 18:26:07,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4269 states to 4269 states and 6015 transitions. [2025-01-09 18:26:07,129 INFO L78 Accepts]: Start accepts. Automaton has 4269 states and 6015 transitions. Word has length 196 [2025-01-09 18:26:07,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:26:07,130 INFO L471 AbstractCegarLoop]: Abstraction has 4269 states and 6015 transitions. [2025-01-09 18:26:07,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 18:26:07,130 INFO L276 IsEmpty]: Start isEmpty. Operand 4269 states and 6015 transitions. [2025-01-09 18:26:07,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-01-09 18:26:07,133 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:26:07,133 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:26:07,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 18:26:07,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:26:07,338 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:26:07,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:26:07,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1658924368, now seen corresponding path program 1 times [2025-01-09 18:26:07,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:26:07,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027826769] [2025-01-09 18:26:07,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:26:07,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:26:07,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-01-09 18:26:07,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-01-09 18:26:07,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:26:07,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:26:07,805 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2025-01-09 18:26:07,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:26:07,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027826769] [2025-01-09 18:26:07,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027826769] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 18:26:07,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594070941] [2025-01-09 18:26:07,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:26:07,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:26:07,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:26:07,807 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 18:26:07,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 18:26:08,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-01-09 18:26:08,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-01-09 18:26:08,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:26:08,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:26:08,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 2619 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 18:26:08,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 18:26:08,830 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-01-09 18:26:08,833 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 18:26:09,023 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2025-01-09 18:26:09,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [594070941] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 18:26:09,024 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 18:26:09,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-09 18:26:09,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264673546] [2025-01-09 18:26:09,025 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 18:26:09,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 18:26:09,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:26:09,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 18:26:09,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 18:26:09,028 INFO L87 Difference]: Start difference. First operand 4269 states and 6015 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 7 states have internal predecessors, (157), 5 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (28), 5 states have call predecessors, (28), 5 states have call successors, (28) [2025-01-09 18:26:09,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:26:09,235 INFO L93 Difference]: Finished difference Result 8623 states and 12163 transitions. [2025-01-09 18:26:09,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 18:26:09,236 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 7 states have internal predecessors, (157), 5 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (28), 5 states have call predecessors, (28), 5 states have call successors, (28) Word has length 198 [2025-01-09 18:26:09,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:26:09,258 INFO L225 Difference]: With dead ends: 8623 [2025-01-09 18:26:09,259 INFO L226 Difference]: Without dead ends: 4357 [2025-01-09 18:26:09,270 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 393 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 18:26:09,270 INFO L435 NwaCegarLoop]: 1511 mSDtfsCounter, 12 mSDsluCounter, 6016 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 7527 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:26:09,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 7527 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 18:26:09,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4357 states. [2025-01-09 18:26:09,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4357 to 4317. [2025-01-09 18:26:09,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4317 states, 3116 states have (on average 1.2968549422336328) internal successors, (4041), 3173 states have internal predecessors, (4041), 1005 states have call successors, (1005), 198 states have call predecessors, (1005), 195 states have return successors, (1041), 965 states have call predecessors, (1041), 993 states have call successors, (1041) [2025-01-09 18:26:09,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4317 states to 4317 states and 6087 transitions. [2025-01-09 18:26:09,467 INFO L78 Accepts]: Start accepts. Automaton has 4317 states and 6087 transitions. Word has length 198 [2025-01-09 18:26:09,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:26:09,467 INFO L471 AbstractCegarLoop]: Abstraction has 4317 states and 6087 transitions. [2025-01-09 18:26:09,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 7 states have internal predecessors, (157), 5 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (28), 5 states have call predecessors, (28), 5 states have call successors, (28) [2025-01-09 18:26:09,467 INFO L276 IsEmpty]: Start isEmpty. Operand 4317 states and 6087 transitions. [2025-01-09 18:26:09,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2025-01-09 18:26:09,471 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:26:09,472 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:26:09,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 18:26:09,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:26:09,676 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:26:09,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:26:09,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1512047371, now seen corresponding path program 2 times [2025-01-09 18:26:09,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:26:09,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043352144] [2025-01-09 18:26:09,677 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 18:26:09,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:26:09,840 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 237 statements into 2 equivalence classes. [2025-01-09 18:26:09,858 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 57 of 237 statements. [2025-01-09 18:26:09,859 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 18:26:09,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:26:09,969 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2025-01-09 18:26:09,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:26:09,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043352144] [2025-01-09 18:26:09,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043352144] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:26:09,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:26:09,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 18:26:09,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253493229] [2025-01-09 18:26:09,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:26:09,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 18:26:09,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:26:09,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 18:26:09,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 18:26:09,971 INFO L87 Difference]: Start difference. First operand 4317 states and 6087 transitions. Second operand has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 18:26:10,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:26:10,123 INFO L93 Difference]: Finished difference Result 4341 states and 6108 transitions. [2025-01-09 18:26:10,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 18:26:10,123 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 237 [2025-01-09 18:26:10,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:26:10,145 INFO L225 Difference]: With dead ends: 4341 [2025-01-09 18:26:10,145 INFO L226 Difference]: Without dead ends: 4235 [2025-01-09 18:26:10,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 18:26:10,149 INFO L435 NwaCegarLoop]: 1514 mSDtfsCounter, 1 mSDsluCounter, 4520 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 6034 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:26:10,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 6034 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 18:26:10,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4235 states. [2025-01-09 18:26:10,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4235 to 4235. [2025-01-09 18:26:10,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4235 states, 3062 states have (on average 1.2949052906596996) internal successors, (3965), 3113 states have internal predecessors, (3965), 977 states have call successors, (977), 197 states have call predecessors, (977), 195 states have return successors, (1017), 944 states have call predecessors, (1017), 969 states have call successors, (1017) [2025-01-09 18:26:10,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4235 states to 4235 states and 5959 transitions. [2025-01-09 18:26:10,303 INFO L78 Accepts]: Start accepts. Automaton has 4235 states and 5959 transitions. Word has length 237 [2025-01-09 18:26:10,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:26:10,303 INFO L471 AbstractCegarLoop]: Abstraction has 4235 states and 5959 transitions. [2025-01-09 18:26:10,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 18:26:10,304 INFO L276 IsEmpty]: Start isEmpty. Operand 4235 states and 5959 transitions. [2025-01-09 18:26:10,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2025-01-09 18:26:10,308 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:26:10,309 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:26:10,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 18:26:10,309 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:26:10,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:26:10,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1894592903, now seen corresponding path program 1 times [2025-01-09 18:26:10,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:26:10,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683570783] [2025-01-09 18:26:10,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:26:10,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:26:10,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes. [2025-01-09 18:26:10,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements. [2025-01-09 18:26:10,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:26:10,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:26:10,666 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-01-09 18:26:10,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:26:10,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683570783] [2025-01-09 18:26:10,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683570783] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:26:10,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:26:10,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:26:10,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448478057] [2025-01-09 18:26:10,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:26:10,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:26:10,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:26:10,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:26:10,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:26:10,668 INFO L87 Difference]: Start difference. First operand 4235 states and 5959 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-01-09 18:26:10,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:26:10,790 INFO L93 Difference]: Finished difference Result 8483 states and 11947 transitions. [2025-01-09 18:26:10,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:26:10,791 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 261 [2025-01-09 18:26:10,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:26:10,814 INFO L225 Difference]: With dead ends: 8483 [2025-01-09 18:26:10,815 INFO L226 Difference]: Without dead ends: 4251 [2025-01-09 18:26:10,826 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 18:26:10,826 INFO L435 NwaCegarLoop]: 1507 mSDtfsCounter, 2 mSDsluCounter, 1504 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 3011 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:26:10,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 3011 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:26:10,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4251 states. [2025-01-09 18:26:10,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4251 to 4239. [2025-01-09 18:26:10,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4239 states, 3066 states have (on average 1.2945205479452055) internal successors, (3969), 3117 states have internal predecessors, (3969), 977 states have call successors, (977), 197 states have call predecessors, (977), 195 states have return successors, (1017), 944 states have call predecessors, (1017), 969 states have call successors, (1017) [2025-01-09 18:26:10,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4239 states to 4239 states and 5963 transitions. [2025-01-09 18:26:10,973 INFO L78 Accepts]: Start accepts. Automaton has 4239 states and 5963 transitions. Word has length 261 [2025-01-09 18:26:10,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:26:10,973 INFO L471 AbstractCegarLoop]: Abstraction has 4239 states and 5963 transitions. [2025-01-09 18:26:10,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-01-09 18:26:10,974 INFO L276 IsEmpty]: Start isEmpty. Operand 4239 states and 5963 transitions. [2025-01-09 18:26:10,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2025-01-09 18:26:10,978 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:26:10,979 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:26:10,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 18:26:10,979 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:26:10,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:26:10,979 INFO L85 PathProgramCache]: Analyzing trace with hash -2046623659, now seen corresponding path program 1 times [2025-01-09 18:26:10,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:26:10,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645724211] [2025-01-09 18:26:10,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:26:10,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:26:11,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-01-09 18:26:11,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-01-09 18:26:11,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:26:11,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:26:11,311 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-01-09 18:26:11,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:26:11,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645724211] [2025-01-09 18:26:11,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645724211] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 18:26:11,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318190290] [2025-01-09 18:26:11,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:26:11,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:26:11,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:26:11,314 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 18:26:11,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 18:26:12,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-01-09 18:26:12,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-01-09 18:26:12,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:26:12,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:26:12,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 2762 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 18:26:12,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 18:26:12,469 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-09 18:26:12,471 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 18:26:12,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318190290] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:26:12,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 18:26:12,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-01-09 18:26:12,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225819322] [2025-01-09 18:26:12,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:26:12,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:26:12,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:26:12,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:26:12,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 18:26:12,473 INFO L87 Difference]: Start difference. First operand 4239 states and 5963 transitions. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-01-09 18:26:12,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:26:12,617 INFO L93 Difference]: Finished difference Result 8491 states and 11963 transitions. [2025-01-09 18:26:12,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:26:12,617 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 268 [2025-01-09 18:26:12,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:26:12,639 INFO L225 Difference]: With dead ends: 8491 [2025-01-09 18:26:12,639 INFO L226 Difference]: Without dead ends: 4255 [2025-01-09 18:26:12,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 18:26:12,651 INFO L435 NwaCegarLoop]: 1507 mSDtfsCounter, 2 mSDsluCounter, 1504 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 3011 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:26:12,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 3011 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:26:12,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4255 states. [2025-01-09 18:26:12,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4255 to 4243. [2025-01-09 18:26:12,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4243 states, 3070 states have (on average 1.2941368078175897) internal successors, (3973), 3121 states have internal predecessors, (3973), 977 states have call successors, (977), 197 states have call predecessors, (977), 195 states have return successors, (1017), 944 states have call predecessors, (1017), 969 states have call successors, (1017) [2025-01-09 18:26:12,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4243 states to 4243 states and 5967 transitions. [2025-01-09 18:26:12,826 INFO L78 Accepts]: Start accepts. Automaton has 4243 states and 5967 transitions. Word has length 268 [2025-01-09 18:26:12,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:26:12,827 INFO L471 AbstractCegarLoop]: Abstraction has 4243 states and 5967 transitions. [2025-01-09 18:26:12,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-01-09 18:26:12,828 INFO L276 IsEmpty]: Start isEmpty. Operand 4243 states and 5967 transitions. [2025-01-09 18:26:12,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-01-09 18:26:12,835 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:26:12,835 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:26:12,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 18:26:13,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-09 18:26:13,036 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:26:13,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:26:13,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1479997244, now seen corresponding path program 1 times [2025-01-09 18:26:13,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:26:13,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032958150] [2025-01-09 18:26:13,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:26:13,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:26:13,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-01-09 18:26:13,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-01-09 18:26:13,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:26:13,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:26:13,437 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2025-01-09 18:26:13,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:26:13,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032958150] [2025-01-09 18:26:13,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032958150] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 18:26:13,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868886474] [2025-01-09 18:26:13,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:26:13,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:26:13,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:26:13,441 INFO L229 MonitoredProcess]: Starting monitored process 6 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 18:26:13,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 18:26:14,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-01-09 18:26:14,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-01-09 18:26:14,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:26:14,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:26:14,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 2781 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 18:26:14,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 18:26:14,588 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 33 proven. 1 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-09 18:26:14,588 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 18:26:14,813 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2025-01-09 18:26:14,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868886474] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 18:26:14,813 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 18:26:14,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-09 18:26:14,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629323331] [2025-01-09 18:26:14,813 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 18:26:14,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 18:26:14,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:26:14,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 18:26:14,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 18:26:14,815 INFO L87 Difference]: Start difference. First operand 4243 states and 5967 transitions. Second operand has 7 states, 7 states have (on average 32.285714285714285) internal successors, (226), 7 states have internal predecessors, (226), 5 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (41), 5 states have call predecessors, (41), 5 states have call successors, (41) [2025-01-09 18:26:14,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:26:14,988 INFO L93 Difference]: Finished difference Result 8531 states and 12011 transitions. [2025-01-09 18:26:14,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 18:26:14,989 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 32.285714285714285) internal successors, (226), 7 states have internal predecessors, (226), 5 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (41), 5 states have call predecessors, (41), 5 states have call successors, (41) Word has length 275 [2025-01-09 18:26:14,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:26:15,016 INFO L225 Difference]: With dead ends: 8531 [2025-01-09 18:26:15,016 INFO L226 Difference]: Without dead ends: 4291 [2025-01-09 18:26:15,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 552 GetRequests, 547 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 18:26:15,030 INFO L435 NwaCegarLoop]: 1507 mSDtfsCounter, 4 mSDsluCounter, 1503 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3010 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:26:15,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3010 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:26:15,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4291 states. [2025-01-09 18:26:15,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4291 to 4291. [2025-01-09 18:26:15,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4291 states, 3106 states have (on average 1.290727623953638) internal successors, (4009), 3157 states have internal predecessors, (4009), 989 states have call successors, (989), 197 states have call predecessors, (989), 195 states have return successors, (1029), 956 states have call predecessors, (1029), 981 states have call successors, (1029) [2025-01-09 18:26:15,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4291 states to 4291 states and 6027 transitions. [2025-01-09 18:26:15,183 INFO L78 Accepts]: Start accepts. Automaton has 4291 states and 6027 transitions. Word has length 275 [2025-01-09 18:26:15,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:26:15,183 INFO L471 AbstractCegarLoop]: Abstraction has 4291 states and 6027 transitions. [2025-01-09 18:26:15,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 32.285714285714285) internal successors, (226), 7 states have internal predecessors, (226), 5 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (41), 5 states have call predecessors, (41), 5 states have call successors, (41) [2025-01-09 18:26:15,184 INFO L276 IsEmpty]: Start isEmpty. Operand 4291 states and 6027 transitions. [2025-01-09 18:26:15,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2025-01-09 18:26:15,191 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:26:15,191 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:26:15,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 18:26:15,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-09 18:26:15,391 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:26:15,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:26:15,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1547722030, now seen corresponding path program 2 times [2025-01-09 18:26:15,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:26:15,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671365466] [2025-01-09 18:26:15,394 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 18:26:15,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:26:15,534 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 296 statements into 2 equivalence classes. [2025-01-09 18:26:15,547 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 50 of 296 statements. [2025-01-09 18:26:15,548 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 18:26:15,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:26:15,647 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2025-01-09 18:26:15,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:26:15,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671365466] [2025-01-09 18:26:15,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671365466] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:26:15,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:26:15,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:26:15,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754791923] [2025-01-09 18:26:15,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:26:15,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:26:15,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:26:15,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:26:15,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:26:15,649 INFO L87 Difference]: Start difference. First operand 4291 states and 6027 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 3 states have call successors, (30), 3 states have call predecessors, (30), 2 states have return successors, (27), 2 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 18:26:19,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 18:26:19,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:26:19,460 INFO L93 Difference]: Finished difference Result 8584 states and 12055 transitions. [2025-01-09 18:26:19,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:26:19,461 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 3 states have call successors, (30), 3 states have call predecessors, (30), 2 states have return successors, (27), 2 states have call predecessors, (27), 1 states have call successors, (27) Word has length 296 [2025-01-09 18:26:19,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:26:19,481 INFO L225 Difference]: With dead ends: 8584 [2025-01-09 18:26:19,481 INFO L226 Difference]: Without dead ends: 4296 [2025-01-09 18:26:19,491 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 18:26:19,491 INFO L435 NwaCegarLoop]: 2912 mSDtfsCounter, 1473 mSDsluCounter, 1498 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1473 SdHoareTripleChecker+Valid, 4410 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-01-09 18:26:19,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1473 Valid, 4410 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-01-09 18:26:19,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4296 states. [2025-01-09 18:26:19,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4296 to 4278. [2025-01-09 18:26:19,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4278 states, 3095 states have (on average 1.290145395799677) internal successors, (3993), 3148 states have internal predecessors, (3993), 987 states have call successors, (987), 196 states have call predecessors, (987), 195 states have return successors, (1005), 953 states have call predecessors, (1005), 969 states have call successors, (1005) [2025-01-09 18:26:19,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4278 states to 4278 states and 5985 transitions. [2025-01-09 18:26:19,640 INFO L78 Accepts]: Start accepts. Automaton has 4278 states and 5985 transitions. Word has length 296 [2025-01-09 18:26:19,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:26:19,641 INFO L471 AbstractCegarLoop]: Abstraction has 4278 states and 5985 transitions. [2025-01-09 18:26:19,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 3 states have call successors, (30), 3 states have call predecessors, (30), 2 states have return successors, (27), 2 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 18:26:19,641 INFO L276 IsEmpty]: Start isEmpty. Operand 4278 states and 5985 transitions. [2025-01-09 18:26:19,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2025-01-09 18:26:19,647 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:26:19,647 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:26:19,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 18:26:19,648 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:26:19,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:26:19,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1841125037, now seen corresponding path program 1 times [2025-01-09 18:26:19,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:26:19,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079961979] [2025-01-09 18:26:19,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:26:19,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:26:19,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-01-09 18:26:19,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-01-09 18:26:19,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:26:19,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:26:20,014 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-01-09 18:26:20,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:26:20,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079961979] [2025-01-09 18:26:20,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079961979] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 18:26:20,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611468342] [2025-01-09 18:26:20,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:26:20,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:26:20,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:26:20,017 INFO L229 MonitoredProcess]: Starting monitored process 7 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 18:26:20,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 18:26:20,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-01-09 18:26:21,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-01-09 18:26:21,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:26:21,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:26:21,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 2837 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 18:26:21,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 18:26:21,140 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 33 proven. 1 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2025-01-09 18:26:21,140 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 18:26:21,359 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-01-09 18:26:21,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1611468342] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 18:26:21,360 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 18:26:21,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-09 18:26:21,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404441646] [2025-01-09 18:26:21,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 18:26:21,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 18:26:21,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:26:21,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 18:26:21,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 18:26:21,361 INFO L87 Difference]: Start difference. First operand 4278 states and 5985 transitions. Second operand has 7 states, 7 states have (on average 28.857142857142858) internal successors, (202), 7 states have internal predecessors, (202), 5 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (39), 5 states have call predecessors, (39), 5 states have call successors, (39) [2025-01-09 18:26:21,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:26:21,517 INFO L93 Difference]: Finished difference Result 8601 states and 12055 transitions. [2025-01-09 18:26:21,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 18:26:21,518 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 28.857142857142858) internal successors, (202), 7 states have internal predecessors, (202), 5 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (39), 5 states have call predecessors, (39), 5 states have call successors, (39) Word has length 296 [2025-01-09 18:26:21,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:26:21,544 INFO L225 Difference]: With dead ends: 8601 [2025-01-09 18:26:21,544 INFO L226 Difference]: Without dead ends: 4326 [2025-01-09 18:26:21,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 594 GetRequests, 589 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 18:26:21,557 INFO L435 NwaCegarLoop]: 1507 mSDtfsCounter, 4 mSDsluCounter, 6012 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 7519 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:26:21,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 7519 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:26:21,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4326 states. [2025-01-09 18:26:21,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4326 to 4326. [2025-01-09 18:26:21,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4326 states, 3131 states have (on average 1.2868093260938998) internal successors, (4029), 3184 states have internal predecessors, (4029), 999 states have call successors, (999), 196 states have call predecessors, (999), 195 states have return successors, (1017), 965 states have call predecessors, (1017), 981 states have call successors, (1017) [2025-01-09 18:26:21,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4326 states to 4326 states and 6045 transitions. [2025-01-09 18:26:21,747 INFO L78 Accepts]: Start accepts. Automaton has 4326 states and 6045 transitions. Word has length 296 [2025-01-09 18:26:21,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:26:21,748 INFO L471 AbstractCegarLoop]: Abstraction has 4326 states and 6045 transitions. [2025-01-09 18:26:21,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 28.857142857142858) internal successors, (202), 7 states have internal predecessors, (202), 5 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (39), 5 states have call predecessors, (39), 5 states have call successors, (39) [2025-01-09 18:26:21,748 INFO L276 IsEmpty]: Start isEmpty. Operand 4326 states and 6045 transitions. [2025-01-09 18:26:21,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2025-01-09 18:26:21,753 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:26:21,753 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:26:21,768 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 18:26:21,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:26:21,955 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:26:21,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:26:21,955 INFO L85 PathProgramCache]: Analyzing trace with hash -575450168, now seen corresponding path program 2 times [2025-01-09 18:26:21,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:26:21,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970865251] [2025-01-09 18:26:21,955 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 18:26:21,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:26:22,091 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 317 statements into 2 equivalence classes. [2025-01-09 18:26:22,103 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 50 of 317 statements. [2025-01-09 18:26:22,103 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 18:26:22,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:26:22,300 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2025-01-09 18:26:22,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:26:22,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970865251] [2025-01-09 18:26:22,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970865251] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:26:22,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:26:22,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 18:26:22,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335984368] [2025-01-09 18:26:22,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:26:22,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 18:26:22,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:26:22,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 18:26:22,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 18:26:22,303 INFO L87 Difference]: Start difference. First operand 4326 states and 6045 transitions. Second operand has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 5 states have internal predecessors, (167), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (27), 2 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 18:26:22,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:26:22,448 INFO L93 Difference]: Finished difference Result 4337 states and 6053 transitions. [2025-01-09 18:26:22,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 18:26:22,448 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 5 states have internal predecessors, (167), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (27), 2 states have call predecessors, (27), 1 states have call successors, (27) Word has length 317 [2025-01-09 18:26:22,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:26:22,474 INFO L225 Difference]: With dead ends: 4337 [2025-01-09 18:26:22,475 INFO L226 Difference]: Without dead ends: 4314 [2025-01-09 18:26:22,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 18:26:22,478 INFO L435 NwaCegarLoop]: 1513 mSDtfsCounter, 0 mSDsluCounter, 6038 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7551 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:26:22,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7551 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:26:22,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4314 states. [2025-01-09 18:26:22,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4314 to 4314. [2025-01-09 18:26:22,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4314 states, 3122 states have (on average 1.2857142857142858) internal successors, (4014), 3174 states have internal predecessors, (4014), 996 states have call successors, (996), 196 states have call predecessors, (996), 195 states have return successors, (1015), 963 states have call predecessors, (1015), 979 states have call successors, (1015) [2025-01-09 18:26:22,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4314 states to 4314 states and 6025 transitions. [2025-01-09 18:26:22,657 INFO L78 Accepts]: Start accepts. Automaton has 4314 states and 6025 transitions. Word has length 317 [2025-01-09 18:26:22,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:26:22,659 INFO L471 AbstractCegarLoop]: Abstraction has 4314 states and 6025 transitions. [2025-01-09 18:26:22,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 5 states have internal predecessors, (167), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (27), 2 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 18:26:22,659 INFO L276 IsEmpty]: Start isEmpty. Operand 4314 states and 6025 transitions. [2025-01-09 18:26:22,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-01-09 18:26:22,666 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:26:22,666 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:26:22,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 18:26:22,666 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:26:22,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:26:22,667 INFO L85 PathProgramCache]: Analyzing trace with hash 408110048, now seen corresponding path program 1 times [2025-01-09 18:26:22,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:26:22,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643645223] [2025-01-09 18:26:22,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:26:22,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:26:22,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-01-09 18:26:22,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-01-09 18:26:22,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:26:22,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:26:23,138 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2025-01-09 18:26:23,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:26:23,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643645223] [2025-01-09 18:26:23,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643645223] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 18:26:23,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427855718] [2025-01-09 18:26:23,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:26:23,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:26:23,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:26:23,141 INFO L229 MonitoredProcess]: Starting monitored process 8 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 18:26:23,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 18:26:24,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-01-09 18:26:24,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-01-09 18:26:24,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:26:24,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:26:24,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 3234 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 18:26:24,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 18:26:24,313 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2025-01-09 18:26:24,313 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 18:26:24,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [427855718] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:26:24,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 18:26:24,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-01-09 18:26:24,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731358479] [2025-01-09 18:26:24,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:26:24,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:26:24,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:26:24,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:26:24,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 18:26:24,314 INFO L87 Difference]: Start difference. First operand 4314 states and 6025 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-01-09 18:26:24,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:26:24,460 INFO L93 Difference]: Finished difference Result 8633 states and 12059 transitions. [2025-01-09 18:26:24,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:26:24,460 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 305 [2025-01-09 18:26:24,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:26:24,486 INFO L225 Difference]: With dead ends: 8633 [2025-01-09 18:26:24,486 INFO L226 Difference]: Without dead ends: 4322 [2025-01-09 18:26:24,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 18:26:24,498 INFO L435 NwaCegarLoop]: 1508 mSDtfsCounter, 0 mSDsluCounter, 1499 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3007 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:26:24,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3007 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:26:24,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4322 states. [2025-01-09 18:26:24,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4322 to 4322. [2025-01-09 18:26:24,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4322 states, 3130 states have (on average 1.2849840255591054) internal successors, (4022), 3182 states have internal predecessors, (4022), 996 states have call successors, (996), 196 states have call predecessors, (996), 195 states have return successors, (1015), 963 states have call predecessors, (1015), 979 states have call successors, (1015) [2025-01-09 18:26:24,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4322 states to 4322 states and 6033 transitions. [2025-01-09 18:26:24,644 INFO L78 Accepts]: Start accepts. Automaton has 4322 states and 6033 transitions. Word has length 305 [2025-01-09 18:26:24,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:26:24,645 INFO L471 AbstractCegarLoop]: Abstraction has 4322 states and 6033 transitions. [2025-01-09 18:26:24,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-01-09 18:26:24,646 INFO L276 IsEmpty]: Start isEmpty. Operand 4322 states and 6033 transitions. [2025-01-09 18:26:24,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-01-09 18:26:24,651 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:26:24,652 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:26:24,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-09 18:26:24,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:26:24,853 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:26:24,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:26:24,853 INFO L85 PathProgramCache]: Analyzing trace with hash 968809826, now seen corresponding path program 1 times [2025-01-09 18:26:24,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:26:24,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018747887] [2025-01-09 18:26:24,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:26:24,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:26:25,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-01-09 18:26:25,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-01-09 18:26:25,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:26:25,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:26:25,296 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2025-01-09 18:26:25,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:26:25,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018747887] [2025-01-09 18:26:25,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018747887] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 18:26:25,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748421935] [2025-01-09 18:26:25,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:26:25,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:26:25,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:26:25,299 INFO L229 MonitoredProcess]: Starting monitored process 9 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 18:26:25,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 18:26:26,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-01-09 18:26:26,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-01-09 18:26:26,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:26:26,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:26:26,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 3234 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 18:26:26,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 18:26:26,492 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 27 proven. 1 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2025-01-09 18:26:26,492 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 18:26:26,682 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2025-01-09 18:26:26,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748421935] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 18:26:26,682 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 18:26:26,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-09 18:26:26,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704049026] [2025-01-09 18:26:26,683 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 18:26:26,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 18:26:26,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:26:26,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 18:26:26,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 18:26:26,684 INFO L87 Difference]: Start difference. First operand 4322 states and 6033 transitions. Second operand has 7 states, 7 states have (on average 30.0) internal successors, (210), 7 states have internal predecessors, (210), 2 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2025-01-09 18:26:26,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:26:26,831 INFO L93 Difference]: Finished difference Result 8665 states and 12111 transitions. [2025-01-09 18:26:26,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 18:26:26,832 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 30.0) internal successors, (210), 7 states have internal predecessors, (210), 2 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) Word has length 305 [2025-01-09 18:26:26,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:26:26,861 INFO L225 Difference]: With dead ends: 8665 [2025-01-09 18:26:26,861 INFO L226 Difference]: Without dead ends: 4346 [2025-01-09 18:26:26,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 612 GetRequests, 607 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 18:26:26,874 INFO L435 NwaCegarLoop]: 1508 mSDtfsCounter, 2 mSDsluCounter, 4515 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 6023 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:26:26,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 6023 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:26:26,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4346 states. [2025-01-09 18:26:26,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4346 to 4346. [2025-01-09 18:26:27,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4346 states, 3154 states have (on average 1.2828154724159797) internal successors, (4046), 3206 states have internal predecessors, (4046), 996 states have call successors, (996), 196 states have call predecessors, (996), 195 states have return successors, (1015), 963 states have call predecessors, (1015), 979 states have call successors, (1015) [2025-01-09 18:26:27,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4346 states to 4346 states and 6057 transitions. [2025-01-09 18:26:27,027 INFO L78 Accepts]: Start accepts. Automaton has 4346 states and 6057 transitions. Word has length 305 [2025-01-09 18:26:27,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:26:27,028 INFO L471 AbstractCegarLoop]: Abstraction has 4346 states and 6057 transitions. [2025-01-09 18:26:27,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 30.0) internal successors, (210), 7 states have internal predecessors, (210), 2 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2025-01-09 18:26:27,028 INFO L276 IsEmpty]: Start isEmpty. Operand 4346 states and 6057 transitions. [2025-01-09 18:26:27,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2025-01-09 18:26:27,034 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:26:27,034 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:26:27,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-09 18:26:27,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:26:27,235 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:26:27,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:26:27,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1850932914, now seen corresponding path program 2 times [2025-01-09 18:26:27,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:26:27,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045935801] [2025-01-09 18:26:27,236 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 18:26:27,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:26:27,449 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 311 statements into 2 equivalence classes. [2025-01-09 18:26:27,465 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 84 of 311 statements. [2025-01-09 18:26:27,466 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 18:26:27,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:26:27,601 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2025-01-09 18:26:27,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:26:27,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045935801] [2025-01-09 18:26:27,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045935801] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:26:27,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:26:27,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 18:26:27,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515687335] [2025-01-09 18:26:27,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:26:27,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 18:26:27,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:26:27,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 18:26:27,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 18:26:27,603 INFO L87 Difference]: Start difference. First operand 4346 states and 6057 transitions. Second operand has 4 states, 4 states have (on average 42.75) internal successors, (171), 4 states have internal predecessors, (171), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 18:26:27,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:26:27,778 INFO L93 Difference]: Finished difference Result 4357 states and 6067 transitions. [2025-01-09 18:26:27,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 18:26:27,779 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.75) internal successors, (171), 4 states have internal predecessors, (171), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 311 [2025-01-09 18:26:27,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:26:27,810 INFO L225 Difference]: With dead ends: 4357 [2025-01-09 18:26:27,810 INFO L226 Difference]: Without dead ends: 4346 [2025-01-09 18:26:27,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 18:26:27,814 INFO L435 NwaCegarLoop]: 1507 mSDtfsCounter, 0 mSDsluCounter, 3007 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4514 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:26:27,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4514 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:26:27,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4346 states. [2025-01-09 18:26:28,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4346 to 4346. [2025-01-09 18:26:28,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4346 states, 3154 states have (on average 1.2818642993024731) internal successors, (4043), 3206 states have internal predecessors, (4043), 996 states have call successors, (996), 196 states have call predecessors, (996), 195 states have return successors, (1015), 963 states have call predecessors, (1015), 979 states have call successors, (1015) [2025-01-09 18:26:28,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4346 states to 4346 states and 6054 transitions. [2025-01-09 18:26:28,037 INFO L78 Accepts]: Start accepts. Automaton has 4346 states and 6054 transitions. Word has length 311 [2025-01-09 18:26:28,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:26:28,038 INFO L471 AbstractCegarLoop]: Abstraction has 4346 states and 6054 transitions. [2025-01-09 18:26:28,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.75) internal successors, (171), 4 states have internal predecessors, (171), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 18:26:28,038 INFO L276 IsEmpty]: Start isEmpty. Operand 4346 states and 6054 transitions. [2025-01-09 18:26:28,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2025-01-09 18:26:28,045 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:26:28,045 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:26:28,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 18:26:28,045 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:26:28,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:26:28,046 INFO L85 PathProgramCache]: Analyzing trace with hash -2094861369, now seen corresponding path program 1 times [2025-01-09 18:26:28,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:26:28,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800716559] [2025-01-09 18:26:28,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:26:28,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:26:28,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 313 statements into 1 equivalence classes. [2025-01-09 18:26:28,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 313 of 313 statements. [2025-01-09 18:26:28,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:26:28,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:26:28,455 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2025-01-09 18:26:28,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:26:28,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800716559] [2025-01-09 18:26:28,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800716559] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 18:26:28,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439069607] [2025-01-09 18:26:28,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:26:28,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:26:28,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:26:28,458 INFO L229 MonitoredProcess]: Starting monitored process 10 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 18:26:28,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-09 18:26:29,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 313 statements into 1 equivalence classes. [2025-01-09 18:26:29,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 313 of 313 statements. [2025-01-09 18:26:29,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:26:29,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:26:29,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 3326 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 18:26:29,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 18:26:29,733 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 28 proven. 1 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2025-01-09 18:26:29,733 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 18:26:29,953 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2025-01-09 18:26:29,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439069607] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 18:26:29,953 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 18:26:29,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-09 18:26:29,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290478446] [2025-01-09 18:26:29,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 18:26:29,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 18:26:29,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:26:29,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 18:26:29,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 18:26:29,955 INFO L87 Difference]: Start difference. First operand 4346 states and 6054 transitions. Second operand has 7 states, 7 states have (on average 31.142857142857142) internal successors, (218), 7 states have internal predecessors, (218), 2 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2025-01-09 18:26:31,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:26:31,106 INFO L93 Difference]: Finished difference Result 8821 states and 12273 transitions. [2025-01-09 18:26:31,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 18:26:31,107 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 31.142857142857142) internal successors, (218), 7 states have internal predecessors, (218), 2 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) Word has length 313 [2025-01-09 18:26:31,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:26:31,131 INFO L225 Difference]: With dead ends: 8821 [2025-01-09 18:26:31,132 INFO L226 Difference]: Without dead ends: 4478 [2025-01-09 18:26:31,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 628 GetRequests, 623 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 18:26:31,143 INFO L435 NwaCegarLoop]: 1507 mSDtfsCounter, 8 mSDsluCounter, 1510 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3017 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:26:31,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3017 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 18:26:31,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2025-01-09 18:26:31,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 4478. [2025-01-09 18:26:31,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4478 states, 3286 states have (on average 1.2741935483870968) internal successors, (4187), 3338 states have internal predecessors, (4187), 996 states have call successors, (996), 196 states have call predecessors, (996), 195 states have return successors, (1015), 963 states have call predecessors, (1015), 979 states have call successors, (1015) [2025-01-09 18:26:31,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4478 states to 4478 states and 6198 transitions. [2025-01-09 18:26:31,284 INFO L78 Accepts]: Start accepts. Automaton has 4478 states and 6198 transitions. Word has length 313 [2025-01-09 18:26:31,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:26:31,286 INFO L471 AbstractCegarLoop]: Abstraction has 4478 states and 6198 transitions. [2025-01-09 18:26:31,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 31.142857142857142) internal successors, (218), 7 states have internal predecessors, (218), 2 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2025-01-09 18:26:31,286 INFO L276 IsEmpty]: Start isEmpty. Operand 4478 states and 6198 transitions. [2025-01-09 18:26:31,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2025-01-09 18:26:31,291 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:26:31,291 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:26:31,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-09 18:26:31,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:26:31,492 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:26:31,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:26:31,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1575773927, now seen corresponding path program 1 times [2025-01-09 18:26:31,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:26:31,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502813436] [2025-01-09 18:26:31,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:26:31,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:26:31,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 340 statements into 1 equivalence classes. [2025-01-09 18:26:31,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 340 of 340 statements. [2025-01-09 18:26:31,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:26:31,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:26:31,762 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2025-01-09 18:26:31,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:26:31,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502813436] [2025-01-09 18:26:31,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502813436] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:26:31,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:26:31,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:26:31,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072799899] [2025-01-09 18:26:31,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:26:31,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:26:31,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:26:31,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:26:31,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:26:31,764 INFO L87 Difference]: Start difference. First operand 4478 states and 6198 transitions. Second operand has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-01-09 18:26:31,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:26:31,884 INFO L93 Difference]: Finished difference Result 8949 states and 12389 transitions. [2025-01-09 18:26:31,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:26:31,885 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 340 [2025-01-09 18:26:31,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:26:31,912 INFO L225 Difference]: With dead ends: 8949 [2025-01-09 18:26:31,913 INFO L226 Difference]: Without dead ends: 4474 [2025-01-09 18:26:31,924 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 18:26:31,924 INFO L435 NwaCegarLoop]: 1507 mSDtfsCounter, 0 mSDsluCounter, 1494 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3001 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:26:31,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3001 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:26:31,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4474 states. [2025-01-09 18:26:32,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4474 to 4474. [2025-01-09 18:26:32,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4474 states, 3282 states have (on average 1.273308957952468) internal successors, (4179), 3330 states have internal predecessors, (4179), 996 states have call successors, (996), 196 states have call predecessors, (996), 195 states have return successors, (1015), 963 states have call predecessors, (1015), 979 states have call successors, (1015) [2025-01-09 18:26:32,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4474 states to 4474 states and 6190 transitions. [2025-01-09 18:26:32,066 INFO L78 Accepts]: Start accepts. Automaton has 4474 states and 6190 transitions. Word has length 340 [2025-01-09 18:26:32,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:26:32,067 INFO L471 AbstractCegarLoop]: Abstraction has 4474 states and 6190 transitions. [2025-01-09 18:26:32,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-01-09 18:26:32,067 INFO L276 IsEmpty]: Start isEmpty. Operand 4474 states and 6190 transitions. [2025-01-09 18:26:32,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2025-01-09 18:26:32,072 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:26:32,072 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:26:32,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 18:26:32,073 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:26:32,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:26:32,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1992058218, now seen corresponding path program 1 times [2025-01-09 18:26:32,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:26:32,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128253195] [2025-01-09 18:26:32,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:26:32,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:26:32,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 357 statements into 1 equivalence classes. [2025-01-09 18:26:32,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 357 of 357 statements. [2025-01-09 18:26:32,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:26:32,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:26:32,526 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2025-01-09 18:26:32,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:26:32,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128253195] [2025-01-09 18:26:32,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128253195] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:26:32,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:26:32,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 18:26:32,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231419038] [2025-01-09 18:26:32,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:26:32,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 18:26:32,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:26:32,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 18:26:32,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 18:26:32,529 INFO L87 Difference]: Start difference. First operand 4474 states and 6190 transitions. Second operand has 6 states, 6 states have (on average 32.5) internal successors, (195), 5 states have internal predecessors, (195), 2 states have call successors, (35), 2 states have call predecessors, (35), 3 states have return successors, (34), 3 states have call predecessors, (34), 2 states have call successors, (34) [2025-01-09 18:26:32,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:26:32,651 INFO L93 Difference]: Finished difference Result 6617 states and 9159 transitions. [2025-01-09 18:26:32,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 18:26:32,652 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 32.5) internal successors, (195), 5 states have internal predecessors, (195), 2 states have call successors, (35), 2 states have call predecessors, (35), 3 states have return successors, (34), 3 states have call predecessors, (34), 2 states have call successors, (34) Word has length 357 [2025-01-09 18:26:32,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:26:32,677 INFO L225 Difference]: With dead ends: 6617 [2025-01-09 18:26:32,677 INFO L226 Difference]: Without dead ends: 4462 [2025-01-09 18:26:32,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 18:26:32,685 INFO L435 NwaCegarLoop]: 1505 mSDtfsCounter, 0 mSDsluCounter, 6014 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7519 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:26:32,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7519 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:26:32,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4462 states. [2025-01-09 18:26:32,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4462 to 4462. [2025-01-09 18:26:32,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4462 states, 3272 states have (on average 1.2735330073349633) internal successors, (4167), 3322 states have internal predecessors, (4167), 996 states have call successors, (996), 196 states have call predecessors, (996), 193 states have return successors, (1011), 959 states have call predecessors, (1011), 979 states have call successors, (1011) [2025-01-09 18:26:32,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4462 states to 4462 states and 6174 transitions. [2025-01-09 18:26:32,834 INFO L78 Accepts]: Start accepts. Automaton has 4462 states and 6174 transitions. Word has length 357 [2025-01-09 18:26:32,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:26:32,835 INFO L471 AbstractCegarLoop]: Abstraction has 4462 states and 6174 transitions. [2025-01-09 18:26:32,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 32.5) internal successors, (195), 5 states have internal predecessors, (195), 2 states have call successors, (35), 2 states have call predecessors, (35), 3 states have return successors, (34), 3 states have call predecessors, (34), 2 states have call successors, (34) [2025-01-09 18:26:32,835 INFO L276 IsEmpty]: Start isEmpty. Operand 4462 states and 6174 transitions. [2025-01-09 18:26:32,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2025-01-09 18:26:32,840 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:26:32,840 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:26:32,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 18:26:32,840 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:26:32,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:26:32,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1628180176, now seen corresponding path program 1 times [2025-01-09 18:26:32,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:26:32,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630209027] [2025-01-09 18:26:32,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:26:32,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:26:32,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 380 statements into 1 equivalence classes. [2025-01-09 18:26:33,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 380 of 380 statements. [2025-01-09 18:26:33,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:26:33,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:26:33,211 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2025-01-09 18:26:33,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:26:33,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630209027] [2025-01-09 18:26:33,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630209027] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:26:33,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:26:33,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 18:26:33,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104206015] [2025-01-09 18:26:33,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:26:33,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 18:26:33,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:26:33,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 18:26:33,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 18:26:33,214 INFO L87 Difference]: Start difference. First operand 4462 states and 6174 transitions. Second operand has 5 states, 5 states have (on average 41.6) internal successors, (208), 5 states have internal predecessors, (208), 2 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2025-01-09 18:26:33,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:26:33,340 INFO L93 Difference]: Finished difference Result 4507 states and 6216 transitions. [2025-01-09 18:26:33,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 18:26:33,341 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 41.6) internal successors, (208), 5 states have internal predecessors, (208), 2 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) Word has length 380 [2025-01-09 18:26:33,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:26:33,359 INFO L225 Difference]: With dead ends: 4507 [2025-01-09 18:26:33,359 INFO L226 Difference]: Without dead ends: 2330 [2025-01-09 18:26:33,363 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 18:26:33,363 INFO L435 NwaCegarLoop]: 1498 mSDtfsCounter, 0 mSDsluCounter, 4479 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5977 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:26:33,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5977 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 18:26:33,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2330 states. [2025-01-09 18:26:33,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2330 to 2330. [2025-01-09 18:26:33,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2330 states, 1704 states have (on average 1.2699530516431925) internal successors, (2164), 1728 states have internal predecessors, (2164), 521 states have call successors, (521), 107 states have call predecessors, (521), 104 states have return successors, (514), 502 states have call predecessors, (514), 510 states have call successors, (514) [2025-01-09 18:26:33,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2330 states to 2330 states and 3199 transitions. [2025-01-09 18:26:33,436 INFO L78 Accepts]: Start accepts. Automaton has 2330 states and 3199 transitions. Word has length 380 [2025-01-09 18:26:33,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:26:33,437 INFO L471 AbstractCegarLoop]: Abstraction has 2330 states and 3199 transitions. [2025-01-09 18:26:33,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.6) internal successors, (208), 5 states have internal predecessors, (208), 2 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2025-01-09 18:26:33,437 INFO L276 IsEmpty]: Start isEmpty. Operand 2330 states and 3199 transitions. [2025-01-09 18:26:33,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2025-01-09 18:26:33,441 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:26:33,441 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:26:33,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 18:26:33,441 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:26:33,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:26:33,442 INFO L85 PathProgramCache]: Analyzing trace with hash -30521683, now seen corresponding path program 1 times [2025-01-09 18:26:33,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:26:33,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801870520] [2025-01-09 18:26:33,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:26:33,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:26:33,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 392 statements into 1 equivalence classes. [2025-01-09 18:26:33,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 392 of 392 statements. [2025-01-09 18:26:33,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:26:33,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:26:33,990 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2025-01-09 18:26:33,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:26:33,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801870520] [2025-01-09 18:26:33,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801870520] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:26:33,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:26:33,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 18:26:33,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132476259] [2025-01-09 18:26:33,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:26:33,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 18:26:33,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:26:33,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 18:26:33,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 18:26:33,992 INFO L87 Difference]: Start difference. First operand 2330 states and 3199 transitions. Second operand has 5 states, 5 states have (on average 41.4) internal successors, (207), 4 states have internal predecessors, (207), 2 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (36), 3 states have call predecessors, (36), 2 states have call successors, (36) [2025-01-09 18:26:38,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []