./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--md--dm-raid.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--md--dm-raid.ko-entry_point.cil.out.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 62515c851d4d8c80398352da8857a26e67ae776a292d33d62b0afdc92addb3ad --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 18:55:09,596 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 18:55:09,630 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:55:09,636 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 18:55:09,636 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 18:55:09,654 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 18:55:09,654 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 18:55:09,654 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 18:55:09,654 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 18:55:09,654 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 18:55:09,654 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 18:55:09,655 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 18:55:09,655 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 18:55:09,655 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 18:55:09,655 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 18:55:09,655 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 18:55:09,655 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 18:55:09,655 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 18:55:09,655 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 18:55:09,655 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 18:55:09,656 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 18:55:09,656 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 18:55:09,656 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 18:55:09,656 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 18:55:09,656 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 18:55:09,656 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 18:55:09,656 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 18:55:09,656 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 18:55:09,656 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 18:55:09,656 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 18:55:09,656 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 18:55:09,657 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 18:55:09,657 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 18:55:09,657 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 18:55:09,657 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 18:55:09,657 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 18:55:09,657 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 18:55:09,657 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 18:55:09,657 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 18:55:09,657 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 18:55:09,657 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 18:55:09,657 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 18:55:09,658 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 18:55:09,658 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 18:55:09,658 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 18:55:09,658 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 -> 62515c851d4d8c80398352da8857a26e67ae776a292d33d62b0afdc92addb3ad [2025-01-09 18:55:09,876 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 18:55:09,886 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 18:55:09,888 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 18:55:09,889 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 18:55:09,890 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 18:55:09,891 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--md--dm-raid.ko-entry_point.cil.out.i [2025-01-09 18:55:11,079 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/49c6fc53c/33782c67e1ab4665b137082931c5682a/FLAGe939d0b51 [2025-01-09 18:55:11,513 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 18:55:11,514 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--md--dm-raid.ko-entry_point.cil.out.i [2025-01-09 18:55:11,546 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/49c6fc53c/33782c67e1ab4665b137082931c5682a/FLAGe939d0b51 [2025-01-09 18:55:11,638 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/49c6fc53c/33782c67e1ab4665b137082931c5682a [2025-01-09 18:55:11,640 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 18:55:11,641 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 18:55:11,642 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 18:55:11,643 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 18:55:11,646 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 18:55:11,646 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:55:11" (1/1) ... [2025-01-09 18:55:11,647 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13fc2296 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:55:11, skipping insertion in model container [2025-01-09 18:55:11,647 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:55:11" (1/1) ... [2025-01-09 18:55:11,714 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 18:55:12,877 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--md--dm-raid.ko-entry_point.cil.out.i[217361,217374] [2025-01-09 18:55:13,035 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 18:55:13,061 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 18:55:13,135 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"); [4245] [2025-01-09 18:55:13,137 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; btr %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr)); [4252] [2025-01-09 18:55:13,138 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("bsrl %1,%0": "=r" (r): "rm" (x), "0" (-1)); [4266] [2025-01-09 18:55:13,138 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("661:\n\tcall __sw_hweight32\n662:\n.skip -(((6651f-6641f)-(662b-661b)) > 0) * ((6651f-6641f)-(662b-661b)),0x90\n663:\n.pushsection .altinstructions,\"a\"\n .long 661b - .\n .long 6641f - .\n .word ( 4*32+23)\n .byte 663b-661b\n .byte 6651f-6641f\n .byte 663b-662b\n.popsection\n.pushsection .altinstr_replacement, \"ax\"\n6641:\n\t.byte 0xf3,0x40,0x0f,0xb8,0xc7\n6651:\n\t.popsection": "=a" (res): "D" (w)); [4275] [2025-01-09 18:55:13,192 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/mutilin/launch/work/current--X--drivers/--X--defaultlinux-4.2-rc1.tar.xz--X--32_7a--X--cpachecker/linux-4.2-rc1.tar.xz/csd_deg_dscv/988/dscv_tempdir/dscv/ri/32_7a/drivers/md/dm-raid.c"), "i" (791), "i" (12UL)); [5389-5390] [2025-01-09 18:55:13,344 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--md--dm-raid.ko-entry_point.cil.out.i[217361,217374] [2025-01-09 18:55:13,358 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 18:55:13,445 INFO L204 MainTranslator]: Completed translation [2025-01-09 18:55:13,446 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:55:13 WrapperNode [2025-01-09 18:55:13,447 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 18:55:13,448 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 18:55:13,448 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 18:55:13,448 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 18:55:13,452 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:55:13" (1/1) ... [2025-01-09 18:55:13,511 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:55:13" (1/1) ... [2025-01-09 18:55:13,627 INFO L138 Inliner]: procedures = 222, calls = 1690, calls flagged for inlining = 84, calls inlined = 76, statements flattened = 4895 [2025-01-09 18:55:13,627 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 18:55:13,628 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 18:55:13,628 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 18:55:13,628 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 18:55:13,634 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:55:13" (1/1) ... [2025-01-09 18:55:13,635 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:55:13" (1/1) ... [2025-01-09 18:55:13,657 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:55:13" (1/1) ... [2025-01-09 18:55:13,968 INFO L175 MemorySlicer]: Split 982 memory accesses to 20 slices as follows [2, 2, 32, 1, 2, 6, 33, 31, 36, 5, 1, 5, 48, 55, 16, 5, 689, 4, 2, 7]. 70 percent of accesses are in the largest equivalence class. The 283 initializations are split as follows [2, 2, 0, 0, 2, 6, 0, 0, 0, 5, 0, 5, 48, 55, 16, 5, 126, 4, 0, 7]. The 248 writes are split as follows [0, 0, 1, 0, 0, 0, 30, 14, 3, 0, 0, 0, 0, 0, 0, 0, 199, 0, 1, 0]. [2025-01-09 18:55:13,968 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:55:13" (1/1) ... [2025-01-09 18:55:13,968 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:55:13" (1/1) ... [2025-01-09 18:55:14,063 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:55:13" (1/1) ... [2025-01-09 18:55:14,071 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:55:13" (1/1) ... [2025-01-09 18:55:14,094 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:55:13" (1/1) ... [2025-01-09 18:55:14,128 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:55:13" (1/1) ... [2025-01-09 18:55:14,146 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:55:13" (1/1) ... [2025-01-09 18:55:14,177 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 18:55:14,180 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 18:55:14,180 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 18:55:14,180 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 18:55:14,181 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:55:13" (1/1) ... [2025-01-09 18:55:14,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 18:55:14,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:55:14,205 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:55:14,212 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:55:14,227 INFO L130 BoogieDeclarations]: Found specification of procedure dm_table_get_mode [2025-01-09 18:55:14,227 INFO L138 BoogieDeclarations]: Found implementation of procedure dm_table_get_mode [2025-01-09 18:55:14,227 INFO L130 BoogieDeclarations]: Found specification of procedure bdev_get_queue [2025-01-09 18:55:14,227 INFO L138 BoogieDeclarations]: Found implementation of procedure bdev_get_queue [2025-01-09 18:55:14,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-01-09 18:55:14,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-01-09 18:55:14,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-01-09 18:55:14,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-01-09 18:55:14,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-01-09 18:55:14,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-01-09 18:55:14,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-01-09 18:55:14,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-01-09 18:55:14,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-01-09 18:55:14,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-01-09 18:55:14,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-01-09 18:55:14,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-01-09 18:55:14,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-01-09 18:55:14,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-01-09 18:55:14,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-01-09 18:55:14,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-01-09 18:55:14,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-01-09 18:55:14,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#17 [2025-01-09 18:55:14,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#18 [2025-01-09 18:55:14,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#19 [2025-01-09 18:55:14,229 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-01-09 18:55:14,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-01-09 18:55:14,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2025-01-09 18:55:14,229 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2025-01-09 18:55:14,229 INFO L130 BoogieDeclarations]: Found specification of procedure lowmem_page_address [2025-01-09 18:55:14,229 INFO L138 BoogieDeclarations]: Found implementation of procedure lowmem_page_address [2025-01-09 18:55:14,229 INFO L130 BoogieDeclarations]: Found specification of procedure raid10_md_layout_to_format [2025-01-09 18:55:14,229 INFO L138 BoogieDeclarations]: Found implementation of procedure raid10_md_layout_to_format [2025-01-09 18:55:14,229 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-01-09 18:55:14,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-01-09 18:55:14,229 INFO L130 BoogieDeclarations]: Found specification of procedure raid_io_hints [2025-01-09 18:55:14,229 INFO L138 BoogieDeclarations]: Found implementation of procedure raid_io_hints [2025-01-09 18:55:14,229 INFO L130 BoogieDeclarations]: Found specification of procedure raid_message [2025-01-09 18:55:14,229 INFO L138 BoogieDeclarations]: Found implementation of procedure raid_message [2025-01-09 18:55:14,229 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-01-09 18:55:14,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-01-09 18:55:14,229 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2025-01-09 18:55:14,229 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2025-01-09 18:55:14,231 INFO L130 BoogieDeclarations]: Found specification of procedure raid10_md_layout_to_copies [2025-01-09 18:55:14,231 INFO L138 BoogieDeclarations]: Found implementation of procedure raid10_md_layout_to_copies [2025-01-09 18:55:14,231 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-01-09 18:55:14,231 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-01-09 18:55:14,231 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-01-09 18:55:14,231 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2025-01-09 18:55:14,231 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2025-01-09 18:55:14,231 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#5 [2025-01-09 18:55:14,231 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#6 [2025-01-09 18:55:14,231 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#7 [2025-01-09 18:55:14,231 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#8 [2025-01-09 18:55:14,231 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#9 [2025-01-09 18:55:14,231 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#10 [2025-01-09 18:55:14,232 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#11 [2025-01-09 18:55:14,232 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#12 [2025-01-09 18:55:14,232 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#13 [2025-01-09 18:55:14,232 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#14 [2025-01-09 18:55:14,232 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#15 [2025-01-09 18:55:14,232 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#16 [2025-01-09 18:55:14,232 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#17 [2025-01-09 18:55:14,232 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#18 [2025-01-09 18:55:14,232 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#19 [2025-01-09 18:55:14,232 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-01-09 18:55:14,232 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-01-09 18:55:14,232 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-01-09 18:55:14,232 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2025-01-09 18:55:14,232 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2025-01-09 18:55:14,232 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#5 [2025-01-09 18:55:14,232 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#6 [2025-01-09 18:55:14,232 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#7 [2025-01-09 18:55:14,232 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#8 [2025-01-09 18:55:14,232 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#9 [2025-01-09 18:55:14,232 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#10 [2025-01-09 18:55:14,232 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#11 [2025-01-09 18:55:14,232 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#12 [2025-01-09 18:55:14,232 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#13 [2025-01-09 18:55:14,232 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#14 [2025-01-09 18:55:14,232 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#15 [2025-01-09 18:55:14,232 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#16 [2025-01-09 18:55:14,232 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#17 [2025-01-09 18:55:14,232 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#18 [2025-01-09 18:55:14,232 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#19 [2025-01-09 18:55:14,232 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 18:55:14,232 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 18:55:14,233 INFO L130 BoogieDeclarations]: Found specification of procedure context_free [2025-01-09 18:55:14,233 INFO L138 BoogieDeclarations]: Found implementation of procedure context_free [2025-01-09 18:55:14,233 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2025-01-09 18:55:14,233 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2025-01-09 18:55:14,233 INFO L130 BoogieDeclarations]: Found specification of procedure ERR_PTR [2025-01-09 18:55:14,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ERR_PTR [2025-01-09 18:55:14,233 INFO L130 BoogieDeclarations]: Found specification of procedure super_validate [2025-01-09 18:55:14,233 INFO L138 BoogieDeclarations]: Found implementation of procedure super_validate [2025-01-09 18:55:14,233 INFO L130 BoogieDeclarations]: Found specification of procedure do_table_event [2025-01-09 18:55:14,233 INFO L138 BoogieDeclarations]: Found implementation of procedure do_table_event [2025-01-09 18:55:14,233 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 18:55:14,233 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2025-01-09 18:55:14,233 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2025-01-09 18:55:14,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 18:55:14,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 18:55:14,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 18:55:14,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-09 18:55:14,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-01-09 18:55:14,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-01-09 18:55:14,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-01-09 18:55:14,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-01-09 18:55:14,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-01-09 18:55:14,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-01-09 18:55:14,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-01-09 18:55:14,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-01-09 18:55:14,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-01-09 18:55:14,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-01-09 18:55:14,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-01-09 18:55:14,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-01-09 18:55:14,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-01-09 18:55:14,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-01-09 18:55:14,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-01-09 18:55:14,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2025-01-09 18:55:14,236 INFO L130 BoogieDeclarations]: Found specification of procedure sync_page_io [2025-01-09 18:55:14,236 INFO L138 BoogieDeclarations]: Found implementation of procedure sync_page_io [2025-01-09 18:55:14,237 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2025-01-09 18:55:14,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2025-01-09 18:55:14,237 INFO L130 BoogieDeclarations]: Found specification of procedure to_sector [2025-01-09 18:55:14,237 INFO L138 BoogieDeclarations]: Found implementation of procedure to_sector [2025-01-09 18:55:14,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 18:55:14,237 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-01-09 18:55:14,238 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-01-09 18:55:14,238 INFO L130 BoogieDeclarations]: Found specification of procedure raid_iterate_devices [2025-01-09 18:55:14,238 INFO L138 BoogieDeclarations]: Found implementation of procedure raid_iterate_devices [2025-01-09 18:55:14,238 INFO L130 BoogieDeclarations]: Found specification of procedure dm_put_device [2025-01-09 18:55:14,238 INFO L138 BoogieDeclarations]: Found implementation of procedure dm_put_device [2025-01-09 18:55:14,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-01-09 18:55:14,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-01-09 18:55:14,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-01-09 18:55:14,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-01-09 18:55:14,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-01-09 18:55:14,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-01-09 18:55:14,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-01-09 18:55:14,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-01-09 18:55:14,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-01-09 18:55:14,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-01-09 18:55:14,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-01-09 18:55:14,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-01-09 18:55:14,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-01-09 18:55:14,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-01-09 18:55:14,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-01-09 18:55:14,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-01-09 18:55:14,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-01-09 18:55:14,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-01-09 18:55:14,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-01-09 18:55:14,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#19 [2025-01-09 18:55:14,239 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_reconfig_mutex_of_mddev [2025-01-09 18:55:14,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_reconfig_mutex_of_mddev [2025-01-09 18:55:14,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 18:55:14,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 18:55:14,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 18:55:14,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 18:55:14,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 18:55:14,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 18:55:14,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-09 18:55:14,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-01-09 18:55:14,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-01-09 18:55:14,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-01-09 18:55:14,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-01-09 18:55:14,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-01-09 18:55:14,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-01-09 18:55:14,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-01-09 18:55:14,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-01-09 18:55:14,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-01-09 18:55:14,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-01-09 18:55:14,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-01-09 18:55:14,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-01-09 18:55:14,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-01-09 18:55:14,239 INFO L130 BoogieDeclarations]: Found specification of procedure mddev_suspend [2025-01-09 18:55:14,239 INFO L138 BoogieDeclarations]: Found implementation of procedure mddev_suspend [2025-01-09 18:55:14,239 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2025-01-09 18:55:14,239 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2025-01-09 18:55:14,239 INFO L130 BoogieDeclarations]: Found specification of procedure super_sync [2025-01-09 18:55:14,239 INFO L138 BoogieDeclarations]: Found implementation of procedure super_sync [2025-01-09 18:55:14,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 18:55:14,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 18:55:14,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 18:55:14,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 18:55:14,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 18:55:14,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 18:55:14,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-09 18:55:14,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-01-09 18:55:14,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-01-09 18:55:14,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-01-09 18:55:14,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-01-09 18:55:14,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-01-09 18:55:14,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-01-09 18:55:14,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-01-09 18:55:14,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-01-09 18:55:14,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-01-09 18:55:14,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-01-09 18:55:14,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-01-09 18:55:14,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-01-09 18:55:14,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-01-09 18:55:14,240 INFO L130 BoogieDeclarations]: Found specification of procedure is_power_of_2 [2025-01-09 18:55:14,240 INFO L138 BoogieDeclarations]: Found implementation of procedure is_power_of_2 [2025-01-09 18:55:14,240 INFO L130 BoogieDeclarations]: Found specification of procedure md_wakeup_thread [2025-01-09 18:55:14,240 INFO L138 BoogieDeclarations]: Found implementation of procedure md_wakeup_thread [2025-01-09 18:55:14,240 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2025-01-09 18:55:14,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2025-01-09 18:55:14,240 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 18:55:14,240 INFO L130 BoogieDeclarations]: Found specification of procedure raid_merge [2025-01-09 18:55:14,240 INFO L138 BoogieDeclarations]: Found implementation of procedure raid_merge [2025-01-09 18:55:14,240 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2025-01-09 18:55:14,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2025-01-09 18:55:14,240 INFO L130 BoogieDeclarations]: Found specification of procedure raid_map [2025-01-09 18:55:14,243 INFO L138 BoogieDeclarations]: Found implementation of procedure raid_map [2025-01-09 18:55:14,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 18:55:14,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 18:55:14,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 18:55:14,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 18:55:14,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-09 18:55:14,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-01-09 18:55:14,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-01-09 18:55:14,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-01-09 18:55:14,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-01-09 18:55:14,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-01-09 18:55:14,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-01-09 18:55:14,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-01-09 18:55:14,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-01-09 18:55:14,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-01-09 18:55:14,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-01-09 18:55:14,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-01-09 18:55:14,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-01-09 18:55:14,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-01-09 18:55:14,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-01-09 18:55:14,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-01-09 18:55:14,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2025-01-09 18:55:14,244 INFO L130 BoogieDeclarations]: Found specification of procedure strcasecmp [2025-01-09 18:55:14,244 INFO L138 BoogieDeclarations]: Found implementation of procedure strcasecmp [2025-01-09 18:55:14,244 INFO L130 BoogieDeclarations]: Found specification of procedure scnprintf [2025-01-09 18:55:14,244 INFO L138 BoogieDeclarations]: Found implementation of procedure scnprintf [2025-01-09 18:55:14,244 INFO L130 BoogieDeclarations]: Found specification of procedure md_stop [2025-01-09 18:55:14,244 INFO L138 BoogieDeclarations]: Found implementation of procedure md_stop [2025-01-09 18:55:14,244 INFO L130 BoogieDeclarations]: Found specification of procedure raid_status [2025-01-09 18:55:14,244 INFO L138 BoogieDeclarations]: Found implementation of procedure raid_status [2025-01-09 18:55:14,244 INFO L130 BoogieDeclarations]: Found specification of procedure kstrtoul [2025-01-09 18:55:14,244 INFO L138 BoogieDeclarations]: Found implementation of procedure kstrtoul [2025-01-09 18:55:14,244 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2025-01-09 18:55:14,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2025-01-09 18:55:14,244 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2025-01-09 18:55:14,244 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2025-01-09 18:55:14,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 18:55:14,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 18:55:14,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 18:55:14,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 18:55:14,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 18:55:14,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 18:55:14,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 18:55:14,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 18:55:14,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 18:55:14,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 18:55:14,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-09 18:55:14,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-09 18:55:14,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-01-09 18:55:14,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-01-09 18:55:14,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-01-09 18:55:14,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-01-09 18:55:14,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-01-09 18:55:14,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-01-09 18:55:14,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-01-09 18:55:14,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-01-09 18:55:14,245 INFO L130 BoogieDeclarations]: Found specification of procedure raid_dtr [2025-01-09 18:55:14,245 INFO L138 BoogieDeclarations]: Found implementation of procedure raid_dtr [2025-01-09 18:55:14,245 INFO L130 BoogieDeclarations]: Found specification of procedure dm_get_device [2025-01-09 18:55:14,245 INFO L138 BoogieDeclarations]: Found implementation of procedure dm_get_device [2025-01-09 18:55:14,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 18:55:14,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 18:55:14,247 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2025-01-09 18:55:14,247 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2025-01-09 18:55:14,749 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 18:55:14,751 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 18:55:14,773 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-01-09 18:55:22,981 INFO L? ?]: Removed 1582 outVars from TransFormulas that were not future-live. [2025-01-09 18:55:22,982 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 18:55:23,007 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 18:55:23,008 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 18:55:23,008 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:55:23 BoogieIcfgContainer [2025-01-09 18:55:23,008 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 18:55:23,010 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 18:55:23,010 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 18:55:23,017 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 18:55:23,017 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 06:55:11" (1/3) ... [2025-01-09 18:55:23,018 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28702514 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:55:23, skipping insertion in model container [2025-01-09 18:55:23,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:55:13" (2/3) ... [2025-01-09 18:55:23,018 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28702514 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:55:23, skipping insertion in model container [2025-01-09 18:55:23,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:55:23" (3/3) ... [2025-01-09 18:55:23,019 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-32_7a-drivers--md--dm-raid.ko-entry_point.cil.out.i [2025-01-09 18:55:23,032 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 18:55:23,035 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linux-4.2-rc1.tar.xz-32_7a-drivers--md--dm-raid.ko-entry_point.cil.out.i that has 66 procedures, 1464 locations, 1 initial locations, 20 loop locations, and 1 error locations. [2025-01-09 18:55:23,089 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 18:55:23,097 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;@27199df4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 18:55:23,097 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 18:55:23,102 INFO L276 IsEmpty]: Start isEmpty. Operand has 1391 states, 1076 states have (on average 1.4340148698884758) internal successors, (1543), 1097 states have internal predecessors, (1543), 267 states have call successors, (267), 47 states have call predecessors, (267), 46 states have return successors, (263), 259 states have call predecessors, (263), 263 states have call successors, (263) [2025-01-09 18:55:23,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2025-01-09 18:55:23,111 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:55:23,111 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:55:23,111 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:55:23,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:55:23,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1995562903, now seen corresponding path program 1 times [2025-01-09 18:55:23,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:55:23,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774377139] [2025-01-09 18:55:23,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:55:23,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:55:23,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-01-09 18:55:24,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-01-09 18:55:24,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:55:24,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:55:24,482 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 546 trivial. 0 not checked. [2025-01-09 18:55:24,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:55:24,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774377139] [2025-01-09 18:55:24,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774377139] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 18:55:24,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548575096] [2025-01-09 18:55:24,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:55:24,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:55:24,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:55:24,486 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:55:24,488 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:55:25,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-01-09 18:55:25,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-01-09 18:55:25,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:55:25,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:55:25,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 3230 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 18:55:25,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 18:55:25,859 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 518 trivial. 0 not checked. [2025-01-09 18:55:25,860 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 18:55:25,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548575096] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:55:25,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 18:55:25,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 18:55:25,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374517450] [2025-01-09 18:55:25,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:55:25,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 18:55:25,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:55:25,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 18:55:25,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 18:55:25,884 INFO L87 Difference]: Start difference. First operand has 1391 states, 1076 states have (on average 1.4340148698884758) internal successors, (1543), 1097 states have internal predecessors, (1543), 267 states have call successors, (267), 47 states have call predecessors, (267), 46 states have return successors, (263), 259 states have call predecessors, (263), 263 states have call successors, (263) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 18:55:26,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:55:26,004 INFO L93 Difference]: Finished difference Result 2777 states and 4158 transitions. [2025-01-09 18:55:26,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 18:55:26,006 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 221 [2025-01-09 18:55:26,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:55:26,033 INFO L225 Difference]: With dead ends: 2777 [2025-01-09 18:55:26,033 INFO L226 Difference]: Without dead ends: 1379 [2025-01-09 18:55:26,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 18:55:26,050 INFO L435 NwaCegarLoop]: 2050 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2050 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:55:26,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2050 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:55:26,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2025-01-09 18:55:26,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 1379. [2025-01-09 18:55:26,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1379 states, 1070 states have (on average 1.4149532710280375) internal successors, (1514), 1085 states have internal predecessors, (1514), 263 states have call successors, (263), 46 states have call predecessors, (263), 45 states have return successors, (258), 254 states have call predecessors, (258), 258 states have call successors, (258) [2025-01-09 18:55:26,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1379 states to 1379 states and 2035 transitions. [2025-01-09 18:55:26,166 INFO L78 Accepts]: Start accepts. Automaton has 1379 states and 2035 transitions. Word has length 221 [2025-01-09 18:55:26,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:55:26,166 INFO L471 AbstractCegarLoop]: Abstraction has 1379 states and 2035 transitions. [2025-01-09 18:55:26,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 18:55:26,167 INFO L276 IsEmpty]: Start isEmpty. Operand 1379 states and 2035 transitions. [2025-01-09 18:55:26,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2025-01-09 18:55:26,172 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:55:26,172 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:55:26,183 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:55:26,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 18:55:26,373 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:55:26,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:55:26,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1796451751, now seen corresponding path program 1 times [2025-01-09 18:55:26,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:55:26,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498790107] [2025-01-09 18:55:26,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:55:26,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:55:27,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-01-09 18:55:27,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-01-09 18:55:27,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:55:27,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:55:27,599 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2025-01-09 18:55:27,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:55:27,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498790107] [2025-01-09 18:55:27,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498790107] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:55:27,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:55:27,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:55:27,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242258168] [2025-01-09 18:55:27,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:55:27,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:55:27,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:55:27,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:55:27,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:55:27,605 INFO L87 Difference]: Start difference. First operand 1379 states and 2035 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 18:55:31,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 18:55:31,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:55:31,936 INFO L93 Difference]: Finished difference Result 4022 states and 5954 transitions. [2025-01-09 18:55:31,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:55:31,937 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 221 [2025-01-09 18:55:31,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:55:31,966 INFO L225 Difference]: With dead ends: 4022 [2025-01-09 18:55:31,967 INFO L226 Difference]: Without dead ends: 2686 [2025-01-09 18:55:31,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:55:31,975 INFO L435 NwaCegarLoop]: 2036 mSDtfsCounter, 1939 mSDsluCounter, 2018 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1939 SdHoareTripleChecker+Valid, 4054 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:55:31,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1939 Valid, 4054 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-01-09 18:55:31,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2686 states. [2025-01-09 18:55:32,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2686 to 2683. [2025-01-09 18:55:32,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2683 states, 2095 states have (on average 1.4200477326968974) internal successors, (2975), 2121 states have internal predecessors, (2975), 501 states have call successors, (501), 87 states have call predecessors, (501), 86 states have return successors, (496), 488 states have call predecessors, (496), 496 states have call successors, (496) [2025-01-09 18:55:32,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2683 states to 2683 states and 3972 transitions. [2025-01-09 18:55:32,129 INFO L78 Accepts]: Start accepts. Automaton has 2683 states and 3972 transitions. Word has length 221 [2025-01-09 18:55:32,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:55:32,132 INFO L471 AbstractCegarLoop]: Abstraction has 2683 states and 3972 transitions. [2025-01-09 18:55:32,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 18:55:32,133 INFO L276 IsEmpty]: Start isEmpty. Operand 2683 states and 3972 transitions. [2025-01-09 18:55:32,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-01-09 18:55:32,139 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:55:32,139 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:55:32,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 18:55:32,139 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:55:32,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:55:32,140 INFO L85 PathProgramCache]: Analyzing trace with hash 492319007, now seen corresponding path program 1 times [2025-01-09 18:55:32,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:55:32,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784652202] [2025-01-09 18:55:32,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:55:32,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:55:32,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-01-09 18:55:32,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-01-09 18:55:32,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:55:32,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:55:33,128 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2025-01-09 18:55:33,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:55:33,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784652202] [2025-01-09 18:55:33,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784652202] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:55:33,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:55:33,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:55:33,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023951961] [2025-01-09 18:55:33,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:55:33,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:55:33,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:55:33,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:55:33,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:55:33,130 INFO L87 Difference]: Start difference. First operand 2683 states and 3972 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 18:55:33,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:55:33,188 INFO L93 Difference]: Finished difference Result 2685 states and 3973 transitions. [2025-01-09 18:55:33,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:55:33,189 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 229 [2025-01-09 18:55:33,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:55:33,205 INFO L225 Difference]: With dead ends: 2685 [2025-01-09 18:55:33,206 INFO L226 Difference]: Without dead ends: 2682 [2025-01-09 18:55:33,208 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:55:33,210 INFO L435 NwaCegarLoop]: 2032 mSDtfsCounter, 1985 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1985 SdHoareTripleChecker+Valid, 2032 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:55:33,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1985 Valid, 2032 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:55:33,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2682 states. [2025-01-09 18:55:33,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2682 to 2682. [2025-01-09 18:55:33,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2682 states, 2095 states have (on average 1.4195704057279237) internal successors, (2974), 2120 states have internal predecessors, (2974), 500 states have call successors, (500), 87 states have call predecessors, (500), 86 states have return successors, (496), 488 states have call predecessors, (496), 496 states have call successors, (496) [2025-01-09 18:55:33,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2682 states to 2682 states and 3970 transitions. [2025-01-09 18:55:33,310 INFO L78 Accepts]: Start accepts. Automaton has 2682 states and 3970 transitions. Word has length 229 [2025-01-09 18:55:33,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:55:33,313 INFO L471 AbstractCegarLoop]: Abstraction has 2682 states and 3970 transitions. [2025-01-09 18:55:33,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 18:55:33,313 INFO L276 IsEmpty]: Start isEmpty. Operand 2682 states and 3970 transitions. [2025-01-09 18:55:33,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-01-09 18:55:33,316 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:55:33,317 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:55:33,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 18:55:33,317 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:55:33,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:55:33,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1918295937, now seen corresponding path program 1 times [2025-01-09 18:55:33,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:55:33,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228814735] [2025-01-09 18:55:33,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:55:33,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:55:33,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-01-09 18:55:33,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-01-09 18:55:33,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:55:33,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:55:34,095 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2025-01-09 18:55:34,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:55:34,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228814735] [2025-01-09 18:55:34,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228814735] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:55:34,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:55:34,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:55:34,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055340443] [2025-01-09 18:55:34,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:55:34,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:55:34,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:55:34,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:55:34,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:55:34,097 INFO L87 Difference]: Start difference. First operand 2682 states and 3970 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 18:55:34,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:55:34,151 INFO L93 Difference]: Finished difference Result 2684 states and 3971 transitions. [2025-01-09 18:55:34,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:55:34,152 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 230 [2025-01-09 18:55:34,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:55:34,163 INFO L225 Difference]: With dead ends: 2684 [2025-01-09 18:55:34,164 INFO L226 Difference]: Without dead ends: 2681 [2025-01-09 18:55:34,165 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:55:34,166 INFO L435 NwaCegarLoop]: 2030 mSDtfsCounter, 1982 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1982 SdHoareTripleChecker+Valid, 2030 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:55:34,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1982 Valid, 2030 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:55:34,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2681 states. [2025-01-09 18:55:34,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2681 to 2681. [2025-01-09 18:55:34,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2681 states, 2095 states have (on average 1.41909307875895) internal successors, (2973), 2119 states have internal predecessors, (2973), 499 states have call successors, (499), 87 states have call predecessors, (499), 86 states have return successors, (496), 488 states have call predecessors, (496), 496 states have call successors, (496) [2025-01-09 18:55:34,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2681 states to 2681 states and 3968 transitions. [2025-01-09 18:55:34,252 INFO L78 Accepts]: Start accepts. Automaton has 2681 states and 3968 transitions. Word has length 230 [2025-01-09 18:55:34,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:55:34,253 INFO L471 AbstractCegarLoop]: Abstraction has 2681 states and 3968 transitions. [2025-01-09 18:55:34,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 18:55:34,253 INFO L276 IsEmpty]: Start isEmpty. Operand 2681 states and 3968 transitions. [2025-01-09 18:55:34,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2025-01-09 18:55:34,257 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:55:34,258 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:55:34,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 18:55:34,258 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:55:34,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:55:34,259 INFO L85 PathProgramCache]: Analyzing trace with hash 662056994, now seen corresponding path program 1 times [2025-01-09 18:55:34,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:55:34,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863025357] [2025-01-09 18:55:34,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:55:34,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:55:34,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-01-09 18:55:34,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-01-09 18:55:34,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:55:34,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:55:35,083 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2025-01-09 18:55:35,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:55:35,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863025357] [2025-01-09 18:55:35,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863025357] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:55:35,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:55:35,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:55:35,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310720762] [2025-01-09 18:55:35,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:55:35,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:55:35,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:55:35,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:55:35,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:55:35,085 INFO L87 Difference]: Start difference. First operand 2681 states and 3968 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 18:55:35,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:55:35,149 INFO L93 Difference]: Finished difference Result 2683 states and 3969 transitions. [2025-01-09 18:55:35,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:55:35,150 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 231 [2025-01-09 18:55:35,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:55:35,164 INFO L225 Difference]: With dead ends: 2683 [2025-01-09 18:55:35,165 INFO L226 Difference]: Without dead ends: 2680 [2025-01-09 18:55:35,167 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:55:35,168 INFO L435 NwaCegarLoop]: 2028 mSDtfsCounter, 1979 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1979 SdHoareTripleChecker+Valid, 2028 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:55:35,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1979 Valid, 2028 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:55:35,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2680 states. [2025-01-09 18:55:35,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2680 to 2680. [2025-01-09 18:55:35,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2680 states, 2095 states have (on average 1.4186157517899762) internal successors, (2972), 2118 states have internal predecessors, (2972), 498 states have call successors, (498), 87 states have call predecessors, (498), 86 states have return successors, (496), 488 states have call predecessors, (496), 496 states have call successors, (496) [2025-01-09 18:55:35,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2680 states to 2680 states and 3966 transitions. [2025-01-09 18:55:35,262 INFO L78 Accepts]: Start accepts. Automaton has 2680 states and 3966 transitions. Word has length 231 [2025-01-09 18:55:35,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:55:35,263 INFO L471 AbstractCegarLoop]: Abstraction has 2680 states and 3966 transitions. [2025-01-09 18:55:35,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 18:55:35,263 INFO L276 IsEmpty]: Start isEmpty. Operand 2680 states and 3966 transitions. [2025-01-09 18:55:35,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-01-09 18:55:35,267 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:55:35,267 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:55:35,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 18:55:35,267 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:55:35,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:55:35,268 INFO L85 PathProgramCache]: Analyzing trace with hash -951375902, now seen corresponding path program 1 times [2025-01-09 18:55:35,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:55:35,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072733657] [2025-01-09 18:55:35,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:55:35,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:55:35,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-01-09 18:55:35,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-01-09 18:55:35,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:55:35,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:55:36,011 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2025-01-09 18:55:36,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:55:36,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072733657] [2025-01-09 18:55:36,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072733657] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:55:36,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:55:36,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:55:36,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504962442] [2025-01-09 18:55:36,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:55:36,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:55:36,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:55:36,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:55:36,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:55:36,013 INFO L87 Difference]: Start difference. First operand 2680 states and 3966 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 18:55:36,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:55:36,148 INFO L93 Difference]: Finished difference Result 5283 states and 7834 transitions. [2025-01-09 18:55:36,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:55:36,148 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 232 [2025-01-09 18:55:36,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:55:36,176 INFO L225 Difference]: With dead ends: 5283 [2025-01-09 18:55:36,177 INFO L226 Difference]: Without dead ends: 5272 [2025-01-09 18:55:36,182 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:55:36,183 INFO L435 NwaCegarLoop]: 2030 mSDtfsCounter, 1952 mSDsluCounter, 1967 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1952 SdHoareTripleChecker+Valid, 3997 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:55:36,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1952 Valid, 3997 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:55:36,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5272 states. [2025-01-09 18:55:36,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5272 to 5272. [2025-01-09 18:55:36,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5272 states, 4133 states have (on average 1.4219695136704573) internal successors, (5877), 4176 states have internal predecessors, (5877), 972 states have call successors, (972), 169 states have call predecessors, (972), 166 states have return successors, (970), 952 states have call predecessors, (970), 970 states have call successors, (970) [2025-01-09 18:55:36,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5272 states to 5272 states and 7819 transitions. [2025-01-09 18:55:36,483 INFO L78 Accepts]: Start accepts. Automaton has 5272 states and 7819 transitions. Word has length 232 [2025-01-09 18:55:36,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:55:36,484 INFO L471 AbstractCegarLoop]: Abstraction has 5272 states and 7819 transitions. [2025-01-09 18:55:36,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 18:55:36,484 INFO L276 IsEmpty]: Start isEmpty. Operand 5272 states and 7819 transitions. [2025-01-09 18:55:36,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2025-01-09 18:55:36,504 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:55:36,504 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:36,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 18:55:36,505 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:55:36,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:55:36,505 INFO L85 PathProgramCache]: Analyzing trace with hash 833417097, now seen corresponding path program 1 times [2025-01-09 18:55:36,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:55:36,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986213008] [2025-01-09 18:55:36,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:55:36,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:55:37,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 338 statements into 1 equivalence classes. [2025-01-09 18:55:37,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 338 of 338 statements. [2025-01-09 18:55:37,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:55:37,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:55:37,592 INFO L134 CoverageAnalysis]: Checked inductivity of 596 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 593 trivial. 0 not checked. [2025-01-09 18:55:37,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:55:37,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986213008] [2025-01-09 18:55:37,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986213008] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:55:37,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:55:37,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:55:37,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998069116] [2025-01-09 18:55:37,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:55:37,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:55:37,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:55:37,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:55:37,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:55:37,595 INFO L87 Difference]: Start difference. First operand 5272 states and 7819 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-01-09 18:55:38,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:55:38,434 INFO L93 Difference]: Finished difference Result 10695 states and 15852 transitions. [2025-01-09 18:55:38,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:55:38,434 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 338 [2025-01-09 18:55:38,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:55:38,463 INFO L225 Difference]: With dead ends: 10695 [2025-01-09 18:55:38,464 INFO L226 Difference]: Without dead ends: 5466 [2025-01-09 18:55:38,483 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:55:38,484 INFO L435 NwaCegarLoop]: 2041 mSDtfsCounter, 142 mSDsluCounter, 1854 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 3895 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 18:55:38,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 3895 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 18:55:38,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5466 states. [2025-01-09 18:55:38,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5466 to 5456. [2025-01-09 18:55:38,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5456 states, 4288 states have (on average 1.421641791044776) internal successors, (6096), 4331 states have internal predecessors, (6096), 992 states have call successors, (992), 178 states have call predecessors, (992), 175 states have return successors, (990), 972 states have call predecessors, (990), 990 states have call successors, (990) [2025-01-09 18:55:38,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5456 states to 5456 states and 8078 transitions. [2025-01-09 18:55:38,732 INFO L78 Accepts]: Start accepts. Automaton has 5456 states and 8078 transitions. Word has length 338 [2025-01-09 18:55:38,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:55:38,732 INFO L471 AbstractCegarLoop]: Abstraction has 5456 states and 8078 transitions. [2025-01-09 18:55:38,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-01-09 18:55:38,733 INFO L276 IsEmpty]: Start isEmpty. Operand 5456 states and 8078 transitions. [2025-01-09 18:55:38,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2025-01-09 18:55:38,746 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:55:38,747 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:38,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 18:55:38,747 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:55:38,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:55:38,748 INFO L85 PathProgramCache]: Analyzing trace with hash -958282838, now seen corresponding path program 1 times [2025-01-09 18:55:38,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:55:38,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658157689] [2025-01-09 18:55:38,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:55:38,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:55:39,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 363 statements into 1 equivalence classes. [2025-01-09 18:55:39,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 363 of 363 statements. [2025-01-09 18:55:39,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:55:39,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:55:39,710 INFO L134 CoverageAnalysis]: Checked inductivity of 716 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 708 trivial. 0 not checked. [2025-01-09 18:55:39,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:55:39,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658157689] [2025-01-09 18:55:39,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658157689] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:55:39,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:55:39,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:55:39,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926556696] [2025-01-09 18:55:39,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:55:39,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:55:39,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:55:39,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:55:39,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:55:39,716 INFO L87 Difference]: Start difference. First operand 5456 states and 8078 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-01-09 18:55:39,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:55:39,927 INFO L93 Difference]: Finished difference Result 10859 states and 16093 transitions. [2025-01-09 18:55:39,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:55:39,928 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 363 [2025-01-09 18:55:39,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:55:39,976 INFO L225 Difference]: With dead ends: 10859 [2025-01-09 18:55:39,977 INFO L226 Difference]: Without dead ends: 5460 [2025-01-09 18:55:39,996 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:55:39,999 INFO L435 NwaCegarLoop]: 2028 mSDtfsCounter, 0 mSDsluCounter, 2022 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4050 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:55:39,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4050 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:55:40,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5460 states. [2025-01-09 18:55:40,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5460 to 5460. [2025-01-09 18:55:40,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5460 states, 4292 states have (on average 1.4212488350419386) internal successors, (6100), 4335 states have internal predecessors, (6100), 992 states have call successors, (992), 178 states have call predecessors, (992), 175 states have return successors, (990), 972 states have call predecessors, (990), 990 states have call successors, (990) [2025-01-09 18:55:40,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5460 states to 5460 states and 8082 transitions. [2025-01-09 18:55:40,282 INFO L78 Accepts]: Start accepts. Automaton has 5460 states and 8082 transitions. Word has length 363 [2025-01-09 18:55:40,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:55:40,283 INFO L471 AbstractCegarLoop]: Abstraction has 5460 states and 8082 transitions. [2025-01-09 18:55:40,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-01-09 18:55:40,283 INFO L276 IsEmpty]: Start isEmpty. Operand 5460 states and 8082 transitions. [2025-01-09 18:55:40,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2025-01-09 18:55:40,296 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:55:40,297 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:40,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 18:55:40,297 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:55:40,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:55:40,298 INFO L85 PathProgramCache]: Analyzing trace with hash -2015014040, now seen corresponding path program 1 times [2025-01-09 18:55:40,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:55:40,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134615825] [2025-01-09 18:55:40,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:55:40,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:55:40,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 363 statements into 1 equivalence classes. [2025-01-09 18:55:41,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 363 of 363 statements. [2025-01-09 18:55:41,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:55:41,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:55:41,427 INFO L134 CoverageAnalysis]: Checked inductivity of 716 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 708 trivial. 0 not checked. [2025-01-09 18:55:41,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:55:41,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134615825] [2025-01-09 18:55:41,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134615825] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:55:41,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:55:41,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 18:55:41,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382273274] [2025-01-09 18:55:41,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:55:41,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 18:55:41,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:55:41,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 18:55:41,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 18:55:41,430 INFO L87 Difference]: Start difference. First operand 5460 states and 8082 transitions. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-01-09 18:55:41,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:55:41,796 INFO L93 Difference]: Finished difference Result 10879 states and 16117 transitions. [2025-01-09 18:55:41,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 18:55:41,797 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 363 [2025-01-09 18:55:41,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:55:41,828 INFO L225 Difference]: With dead ends: 10879 [2025-01-09 18:55:41,828 INFO L226 Difference]: Without dead ends: 5476 [2025-01-09 18:55:41,848 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:55:41,848 INFO L435 NwaCegarLoop]: 2028 mSDtfsCounter, 1 mSDsluCounter, 4014 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 6042 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 18:55:41,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 6042 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 18:55:41,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5476 states. [2025-01-09 18:55:42,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5476 to 5468. [2025-01-09 18:55:42,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5468 states, 4300 states have (on average 1.4204651162790698) internal successors, (6108), 4343 states have internal predecessors, (6108), 992 states have call successors, (992), 178 states have call predecessors, (992), 175 states have return successors, (990), 972 states have call predecessors, (990), 990 states have call successors, (990) [2025-01-09 18:55:42,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5468 states to 5468 states and 8090 transitions. [2025-01-09 18:55:42,092 INFO L78 Accepts]: Start accepts. Automaton has 5468 states and 8090 transitions. Word has length 363 [2025-01-09 18:55:42,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:55:42,093 INFO L471 AbstractCegarLoop]: Abstraction has 5468 states and 8090 transitions. [2025-01-09 18:55:42,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-01-09 18:55:42,094 INFO L276 IsEmpty]: Start isEmpty. Operand 5468 states and 8090 transitions. [2025-01-09 18:55:42,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2025-01-09 18:55:42,109 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:55:42,109 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:42,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 18:55:42,109 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:55:42,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:55:42,110 INFO L85 PathProgramCache]: Analyzing trace with hash -358780606, now seen corresponding path program 1 times [2025-01-09 18:55:42,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:55:42,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565560560] [2025-01-09 18:55:42,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:55:42,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:55:42,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 382 statements into 1 equivalence classes. [2025-01-09 18:55:42,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 382 of 382 statements. [2025-01-09 18:55:42,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:55:42,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:55:43,044 INFO L134 CoverageAnalysis]: Checked inductivity of 716 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 708 trivial. 0 not checked. [2025-01-09 18:55:43,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:55:43,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565560560] [2025-01-09 18:55:43,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565560560] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:55:43,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:55:43,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 18:55:43,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577769462] [2025-01-09 18:55:43,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:55:43,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 18:55:43,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:55:43,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 18:55:43,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 18:55:43,047 INFO L87 Difference]: Start difference. First operand 5468 states and 8090 transitions. Second operand has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-01-09 18:55:43,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:55:43,208 INFO L93 Difference]: Finished difference Result 10887 states and 16121 transitions. [2025-01-09 18:55:43,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 18:55:43,209 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 382 [2025-01-09 18:55:43,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:55:43,230 INFO L225 Difference]: With dead ends: 10887 [2025-01-09 18:55:43,230 INFO L226 Difference]: Without dead ends: 5476 [2025-01-09 18:55:43,247 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:55:43,247 INFO L435 NwaCegarLoop]: 2027 mSDtfsCounter, 0 mSDsluCounter, 4045 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6072 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:55:43,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6072 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:55:43,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5476 states. [2025-01-09 18:55:43,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5476 to 5476. [2025-01-09 18:55:43,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5476 states, 4308 states have (on average 1.4196843082636954) internal successors, (6116), 4351 states have internal predecessors, (6116), 992 states have call successors, (992), 178 states have call predecessors, (992), 175 states have return successors, (990), 972 states have call predecessors, (990), 990 states have call successors, (990) [2025-01-09 18:55:43,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5476 states to 5476 states and 8098 transitions. [2025-01-09 18:55:43,439 INFO L78 Accepts]: Start accepts. Automaton has 5476 states and 8098 transitions. Word has length 382 [2025-01-09 18:55:43,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:55:43,440 INFO L471 AbstractCegarLoop]: Abstraction has 5476 states and 8098 transitions. [2025-01-09 18:55:43,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-01-09 18:55:43,440 INFO L276 IsEmpty]: Start isEmpty. Operand 5476 states and 8098 transitions. [2025-01-09 18:55:43,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2025-01-09 18:55:43,453 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:55:43,454 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:43,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 18:55:43,454 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:55:43,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:55:43,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1000140257, now seen corresponding path program 1 times [2025-01-09 18:55:43,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:55:43,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384891691] [2025-01-09 18:55:43,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:55:43,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:55:44,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 388 statements into 1 equivalence classes. [2025-01-09 18:55:44,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 388 of 388 statements. [2025-01-09 18:55:44,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:55:44,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:55:44,366 INFO L134 CoverageAnalysis]: Checked inductivity of 719 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 711 trivial. 0 not checked. [2025-01-09 18:55:44,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:55:44,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384891691] [2025-01-09 18:55:44,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384891691] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:55:44,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:55:44,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:55:44,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598561453] [2025-01-09 18:55:44,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:55:44,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:55:44,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:55:44,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:55:44,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:55:44,369 INFO L87 Difference]: Start difference. First operand 5476 states and 8098 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-01-09 18:55:44,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:55:44,568 INFO L93 Difference]: Finished difference Result 10899 states and 16133 transitions. [2025-01-09 18:55:44,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:55:44,568 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 388 [2025-01-09 18:55:44,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:55:44,590 INFO L225 Difference]: With dead ends: 10899 [2025-01-09 18:55:44,590 INFO L226 Difference]: Without dead ends: 5480 [2025-01-09 18:55:44,604 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:55:44,605 INFO L435 NwaCegarLoop]: 2028 mSDtfsCounter, 0 mSDsluCounter, 2022 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4050 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:55:44,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4050 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:55:44,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5480 states. [2025-01-09 18:55:44,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5480 to 5480. [2025-01-09 18:55:44,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5480 states, 4312 states have (on average 1.4192949907235621) internal successors, (6120), 4355 states have internal predecessors, (6120), 992 states have call successors, (992), 178 states have call predecessors, (992), 175 states have return successors, (990), 972 states have call predecessors, (990), 990 states have call successors, (990) [2025-01-09 18:55:44,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5480 states to 5480 states and 8102 transitions. [2025-01-09 18:55:44,821 INFO L78 Accepts]: Start accepts. Automaton has 5480 states and 8102 transitions. Word has length 388 [2025-01-09 18:55:44,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:55:44,821 INFO L471 AbstractCegarLoop]: Abstraction has 5480 states and 8102 transitions. [2025-01-09 18:55:44,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-01-09 18:55:44,822 INFO L276 IsEmpty]: Start isEmpty. Operand 5480 states and 8102 transitions. [2025-01-09 18:55:44,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2025-01-09 18:55:44,838 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:55:44,838 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:44,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 18:55:44,838 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:55:44,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:55:44,838 INFO L85 PathProgramCache]: Analyzing trace with hash 908317533, now seen corresponding path program 1 times [2025-01-09 18:55:44,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:55:44,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712552746] [2025-01-09 18:55:44,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:55:44,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:55:45,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 388 statements into 1 equivalence classes. [2025-01-09 18:55:45,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 388 of 388 statements. [2025-01-09 18:55:45,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:55:45,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:55:45,651 INFO L134 CoverageAnalysis]: Checked inductivity of 719 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 711 trivial. 0 not checked. [2025-01-09 18:55:45,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:55:45,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712552746] [2025-01-09 18:55:45,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712552746] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:55:45,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:55:45,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:55:45,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055839081] [2025-01-09 18:55:45,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:55:45,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:55:45,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:55:45,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:55:45,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:55:45,654 INFO L87 Difference]: Start difference. First operand 5480 states and 8102 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-01-09 18:55:45,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:55:45,779 INFO L93 Difference]: Finished difference Result 11047 states and 16353 transitions. [2025-01-09 18:55:45,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:55:45,780 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 388 [2025-01-09 18:55:45,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:55:45,799 INFO L225 Difference]: With dead ends: 11047 [2025-01-09 18:55:45,799 INFO L226 Difference]: Without dead ends: 5624 [2025-01-09 18:55:45,810 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:55:45,811 INFO L435 NwaCegarLoop]: 2029 mSDtfsCounter, 35 mSDsluCounter, 2024 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 4053 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:55:45,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 4053 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:55:45,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5624 states. [2025-01-09 18:55:45,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5624 to 5620. [2025-01-09 18:55:45,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5620 states, 4424 states have (on average 1.418625678119349) internal successors, (6276), 4467 states have internal predecessors, (6276), 1020 states have call successors, (1020), 178 states have call predecessors, (1020), 175 states have return successors, (1018), 1000 states have call predecessors, (1018), 1018 states have call successors, (1018) [2025-01-09 18:55:45,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5620 states to 5620 states and 8314 transitions. [2025-01-09 18:55:45,947 INFO L78 Accepts]: Start accepts. Automaton has 5620 states and 8314 transitions. Word has length 388 [2025-01-09 18:55:45,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:55:45,947 INFO L471 AbstractCegarLoop]: Abstraction has 5620 states and 8314 transitions. [2025-01-09 18:55:45,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-01-09 18:55:45,948 INFO L276 IsEmpty]: Start isEmpty. Operand 5620 states and 8314 transitions. [2025-01-09 18:55:45,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2025-01-09 18:55:45,959 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:55:45,960 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:45,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 18:55:45,960 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:55:45,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:55:45,960 INFO L85 PathProgramCache]: Analyzing trace with hash 570094023, now seen corresponding path program 1 times [2025-01-09 18:55:45,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:55:45,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126356934] [2025-01-09 18:55:45,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:55:45,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:55:46,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 390 statements into 1 equivalence classes. [2025-01-09 18:55:46,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 390 of 390 statements. [2025-01-09 18:55:46,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:55:46,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:55:46,894 INFO L134 CoverageAnalysis]: Checked inductivity of 719 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 711 trivial. 0 not checked. [2025-01-09 18:55:46,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:55:46,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126356934] [2025-01-09 18:55:46,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126356934] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 18:55:46,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2070394972] [2025-01-09 18:55:46,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:55:46,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:55:46,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:55:46,900 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:55:46,901 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:55:48,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 390 statements into 1 equivalence classes. [2025-01-09 18:55:48,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 390 of 390 statements. [2025-01-09 18:55:48,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:55:48,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:55:48,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 4543 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 18:55:48,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 18:55:49,836 INFO L134 CoverageAnalysis]: Checked inductivity of 719 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 599 trivial. 0 not checked. [2025-01-09 18:55:49,836 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 18:55:49,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2070394972] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:55:49,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 18:55:49,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-01-09 18:55:49,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769023077] [2025-01-09 18:55:49,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:55:49,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 18:55:49,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:55:49,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 18:55:49,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 18:55:49,838 INFO L87 Difference]: Start difference. First operand 5620 states and 8314 transitions. Second operand has 4 states, 4 states have (on average 43.5) internal successors, (174), 4 states have internal predecessors, (174), 3 states have call successors, (34), 3 states have call predecessors, (34), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-01-09 18:55:53,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 18:55:56,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:55:56,305 INFO L93 Difference]: Finished difference Result 16752 states and 24805 transitions. [2025-01-09 18:55:56,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 18:55:56,306 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.5) internal successors, (174), 4 states have internal predecessors, (174), 3 states have call successors, (34), 3 states have call predecessors, (34), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 390 [2025-01-09 18:55:56,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:55:56,357 INFO L225 Difference]: With dead ends: 16752 [2025-01-09 18:55:56,357 INFO L226 Difference]: Without dead ends: 16742 [2025-01-09 18:55:56,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 390 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 18:55:56,367 INFO L435 NwaCegarLoop]: 3987 mSDtfsCounter, 3825 mSDsluCounter, 3469 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3825 SdHoareTripleChecker+Valid, 7456 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:55:56,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3825 Valid, 7456 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 551 Invalid, 1 Unknown, 0 Unchecked, 6.1s Time] [2025-01-09 18:55:56,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16742 states. [2025-01-09 18:55:56,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16742 to 16708. [2025-01-09 18:55:56,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16708 states, 13172 states have (on average 1.4215001518372306) internal successors, (18724), 13315 states have internal predecessors, (18724), 3020 states have call successors, (3020), 522 states have call predecessors, (3020), 515 states have return successors, (3018), 2948 states have call predecessors, (3018), 3018 states have call successors, (3018) [2025-01-09 18:55:56,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16708 states to 16708 states and 24762 transitions. [2025-01-09 18:55:57,000 INFO L78 Accepts]: Start accepts. Automaton has 16708 states and 24762 transitions. Word has length 390 [2025-01-09 18:55:57,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:55:57,002 INFO L471 AbstractCegarLoop]: Abstraction has 16708 states and 24762 transitions. [2025-01-09 18:55:57,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.5) internal successors, (174), 4 states have internal predecessors, (174), 3 states have call successors, (34), 3 states have call predecessors, (34), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-01-09 18:55:57,003 INFO L276 IsEmpty]: Start isEmpty. Operand 16708 states and 24762 transitions. [2025-01-09 18:55:57,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2025-01-09 18:55:57,036 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:55:57,036 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:57,053 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 18:55:57,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:55:57,241 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:55:57,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:55:57,241 INFO L85 PathProgramCache]: Analyzing trace with hash -450974331, now seen corresponding path program 1 times [2025-01-09 18:55:57,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:55:57,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448639558] [2025-01-09 18:55:57,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:55:57,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:55:57,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 390 statements into 1 equivalence classes. [2025-01-09 18:55:57,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 390 of 390 statements. [2025-01-09 18:55:57,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:55:57,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:55:58,276 INFO L134 CoverageAnalysis]: Checked inductivity of 719 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 711 trivial. 0 not checked. [2025-01-09 18:55:58,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:55:58,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448639558] [2025-01-09 18:55:58,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448639558] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:55:58,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:55:58,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 18:55:58,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211389511] [2025-01-09 18:55:58,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:55:58,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 18:55:58,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:55:58,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 18:55:58,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 18:55:58,279 INFO L87 Difference]: Start difference. First operand 16708 states and 24762 transitions. Second operand has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 18:55:58,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:55:58,882 INFO L93 Difference]: Finished difference Result 41747 states and 61873 transitions. [2025-01-09 18:55:58,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 18:55:58,883 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 390 [2025-01-09 18:55:58,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:55:59,004 INFO L225 Difference]: With dead ends: 41747 [2025-01-09 18:55:59,004 INFO L226 Difference]: Without dead ends: 33365 [2025-01-09 18:55:59,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 18:55:59,041 INFO L435 NwaCegarLoop]: 2039 mSDtfsCounter, 2025 mSDsluCounter, 3996 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2025 SdHoareTripleChecker+Valid, 6035 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:55:59,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2025 Valid, 6035 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 18:55:59,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33365 states. [2025-01-09 18:55:59,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33365 to 16714. [2025-01-09 18:55:59,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16714 states, 13178 states have (on average 1.4213082410077402) internal successors, (18730), 13323 states have internal predecessors, (18730), 3020 states have call successors, (3020), 522 states have call predecessors, (3020), 515 states have return successors, (3018), 2946 states have call predecessors, (3018), 3018 states have call successors, (3018) [2025-01-09 18:55:59,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16714 states to 16714 states and 24768 transitions. [2025-01-09 18:55:59,749 INFO L78 Accepts]: Start accepts. Automaton has 16714 states and 24768 transitions. Word has length 390 [2025-01-09 18:55:59,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:55:59,749 INFO L471 AbstractCegarLoop]: Abstraction has 16714 states and 24768 transitions. [2025-01-09 18:55:59,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 18:55:59,749 INFO L276 IsEmpty]: Start isEmpty. Operand 16714 states and 24768 transitions. [2025-01-09 18:55:59,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2025-01-09 18:55:59,768 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:55:59,768 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:59,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 18:55:59,769 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:55:59,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:55:59,769 INFO L85 PathProgramCache]: Analyzing trace with hash -2008986671, now seen corresponding path program 1 times [2025-01-09 18:55:59,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:55:59,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193216314] [2025-01-09 18:55:59,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:55:59,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:56:00,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 391 statements into 1 equivalence classes. [2025-01-09 18:56:00,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 391 of 391 statements. [2025-01-09 18:56:00,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:56:00,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:56:00,880 INFO L134 CoverageAnalysis]: Checked inductivity of 719 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 711 trivial. 0 not checked. [2025-01-09 18:56:00,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:56:00,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193216314] [2025-01-09 18:56:00,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193216314] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:56:00,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:56:00,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:56:00,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018553997] [2025-01-09 18:56:00,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:56:00,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:56:00,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:56:00,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:56:00,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:56:00,882 INFO L87 Difference]: Start difference. First operand 16714 states and 24768 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-01-09 18:56:01,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:56:01,255 INFO L93 Difference]: Finished difference Result 33407 states and 49525 transitions. [2025-01-09 18:56:01,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:56:01,256 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 391 [2025-01-09 18:56:01,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:56:01,320 INFO L225 Difference]: With dead ends: 33407 [2025-01-09 18:56:01,320 INFO L226 Difference]: Without dead ends: 16750 [2025-01-09 18:56:01,364 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:56:01,365 INFO L435 NwaCegarLoop]: 2025 mSDtfsCounter, 2 mSDsluCounter, 2022 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4047 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:56:01,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4047 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:56:01,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16750 states. [2025-01-09 18:56:01,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16750 to 16726. [2025-01-09 18:56:01,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16726 states, 13190 states have (on average 1.4209249431387414) internal successors, (18742), 13335 states have internal predecessors, (18742), 3020 states have call successors, (3020), 522 states have call predecessors, (3020), 515 states have return successors, (3018), 2946 states have call predecessors, (3018), 3018 states have call successors, (3018) [2025-01-09 18:56:01,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16726 states to 16726 states and 24780 transitions. [2025-01-09 18:56:01,843 INFO L78 Accepts]: Start accepts. Automaton has 16726 states and 24780 transitions. Word has length 391 [2025-01-09 18:56:01,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:56:01,843 INFO L471 AbstractCegarLoop]: Abstraction has 16726 states and 24780 transitions. [2025-01-09 18:56:01,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-01-09 18:56:01,843 INFO L276 IsEmpty]: Start isEmpty. Operand 16726 states and 24780 transitions. [2025-01-09 18:56:01,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2025-01-09 18:56:01,864 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:56:01,864 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:01,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 18:56:01,864 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:56:01,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:56:01,865 INFO L85 PathProgramCache]: Analyzing trace with hash 455443826, now seen corresponding path program 1 times [2025-01-09 18:56:01,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:56:01,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911291553] [2025-01-09 18:56:01,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:56:01,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:56:02,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 393 statements into 1 equivalence classes. [2025-01-09 18:56:02,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 393 of 393 statements. [2025-01-09 18:56:02,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:56:02,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:56:05,170 INFO L134 CoverageAnalysis]: Checked inductivity of 719 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2025-01-09 18:56:05,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:56:05,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911291553] [2025-01-09 18:56:05,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911291553] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:56:05,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:56:05,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 18:56:05,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045128419] [2025-01-09 18:56:05,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:56:05,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 18:56:05,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:56:05,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 18:56:05,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2025-01-09 18:56:05,172 INFO L87 Difference]: Start difference. First operand 16726 states and 24780 transitions. Second operand has 16 states, 16 states have (on average 10.875) internal successors, (174), 14 states have internal predecessors, (174), 6 states have call successors, (34), 2 states have call predecessors, (34), 3 states have return successors, (33), 8 states have call predecessors, (33), 6 states have call successors, (33) [2025-01-09 18:56:09,198 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 18:56:13,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 18:56:17,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 18:56:29,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:56:29,419 INFO L93 Difference]: Finished difference Result 30919 states and 46131 transitions. [2025-01-09 18:56:29,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 18:56:29,420 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 10.875) internal successors, (174), 14 states have internal predecessors, (174), 6 states have call successors, (34), 2 states have call predecessors, (34), 3 states have return successors, (33), 8 states have call predecessors, (33), 6 states have call successors, (33) Word has length 393 [2025-01-09 18:56:29,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:56:29,510 INFO L225 Difference]: With dead ends: 30919 [2025-01-09 18:56:29,510 INFO L226 Difference]: Without dead ends: 22495 [2025-01-09 18:56:29,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=115, Invalid=755, Unknown=0, NotChecked=0, Total=870 [2025-01-09 18:56:29,546 INFO L435 NwaCegarLoop]: 1974 mSDtfsCounter, 4038 mSDsluCounter, 22645 mSDsCounter, 0 mSdLazyCounter, 2522 mSolverCounterSat, 358 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4039 SdHoareTripleChecker+Valid, 24619 SdHoareTripleChecker+Invalid, 2883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 358 IncrementalHoareTripleChecker+Valid, 2522 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.3s IncrementalHoareTripleChecker+Time [2025-01-09 18:56:29,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4039 Valid, 24619 Invalid, 2883 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [358 Valid, 2522 Invalid, 3 Unknown, 0 Unchecked, 22.3s Time] [2025-01-09 18:56:29,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22495 states. [2025-01-09 18:56:30,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22495 to 21924. [2025-01-09 18:56:30,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21924 states, 17571 states have (on average 1.4322463149507711) internal successors, (25166), 17717 states have internal predecessors, (25166), 3832 states have call successors, (3832), 527 states have call predecessors, (3832), 520 states have return successors, (3830), 3757 states have call predecessors, (3830), 3830 states have call successors, (3830) [2025-01-09 18:56:30,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21924 states to 21924 states and 32828 transitions. [2025-01-09 18:56:30,417 INFO L78 Accepts]: Start accepts. Automaton has 21924 states and 32828 transitions. Word has length 393 [2025-01-09 18:56:30,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:56:30,418 INFO L471 AbstractCegarLoop]: Abstraction has 21924 states and 32828 transitions. [2025-01-09 18:56:30,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 10.875) internal successors, (174), 14 states have internal predecessors, (174), 6 states have call successors, (34), 2 states have call predecessors, (34), 3 states have return successors, (33), 8 states have call predecessors, (33), 6 states have call successors, (33) [2025-01-09 18:56:30,418 INFO L276 IsEmpty]: Start isEmpty. Operand 21924 states and 32828 transitions. [2025-01-09 18:56:30,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2025-01-09 18:56:30,442 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:56:30,442 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:30,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 18:56:30,443 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:56:30,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:56:30,443 INFO L85 PathProgramCache]: Analyzing trace with hash -441949452, now seen corresponding path program 1 times [2025-01-09 18:56:30,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:56:30,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028992808] [2025-01-09 18:56:30,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:56:30,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms